In orthogonal frequency division multiplexing (OFDM) systems, when transmitted blocks of signal through the multipath channel, the present transmitted blocks of signal will be interfered by the previous one due to the effect of channel delay spread. In order to solve this problem, conventionally we introduce a guard interval in transmitted blocks of signal to avoid inter-block interference (IBI). The most popular methods of the guard interval insertion are zero-padding (ZP) and cyclic prefixing (CP). ZP insert the guard interval at the end of the transmitted blocks of signal, in which all elements are zeros. The length of this interval must be equal to or greater then the channel order. In this way we can avoid IBI, at the expense of lossing the orthogonality between subcarrier due to the multipath channel. However, we can use CP to cope whit this problem. In CP we copy the 25% length at the end of the transmitted blocks of signal, and put it in front of the transmitted block to suppress the inter-block interference and inter-carrier interference. In this thesis, we consider OFDM system without the guard interval, hence the received signal contains IBI and ICI. In our proposed scheme, we use an oblique projector (OB) to suppress IBI at first. Then we combine it with a generalized sidelobe canceller (GSC) based equalizer [1] for ICI supppression and demodulate the receiver signal. In computer simulations, we use the GSC-based equalizer with oblique projector to suppress IBI/ICI in the time-invariant channel and time-varying channel. As we will see, in the CP-free OFDM system, the oblique projector can suppress IBI exactly. Moreover we can get better performance in channel with larger order.

Selected mapping (SLM) schemes are commonly employed to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. It has been shown that the computational complexity of the traditional SLM scheme can be substantially reduced by adopting conversion vectors obtained by using the inverse fast Fourier transform (IFFT) of the phase rotation vector in place of the conventional IFFT operations [21]. Unfortunately, however, the elements of these phase rotation vectors of the conversion vectors in [21] do not generally have an equal magnitude, and thus a significant degradation in the bit error rate (BER) performance is incurred. This problem can be remedied by utilizing conversion vectors having the form of a perfect sequence. This paper presents three novel classes of perfect sequence, each of which comprises certain base vectors and their cyclic-shifted versions. Three novel low-complexity SLM schemes are then proposed based upon the unique structures of these perfect sequences. It is shown that while the PAPR performances of the proposed schemes are marginally poorer than that of the traditional SLM scheme, the three schemes achieve an identical BER performance and have a substantially lower computational complexity.

The Orthogonal frequency division multiplexing (OFDM) modulator with redundancy has been adopted in many wireless communication systems for higher data rate transmissions .The block transmission of signal-blocks through the channel will suffer from the inter-block interference (IBI) and inter-symbol interference (ISI). In the traditional transmitter of the OFDM systems, redundancy (or guard interval), such cyclic prefix (CP) or zero padding (ZP), with sufficient length, is inserted in the transmitted block to avoid the IBI. In this thesis, we propose a novel pseudo random cyclic postfix (PRCP-) OFDM system configuration and joint a blind channel shortening algorithm which named MERRY algorithm [18], which adopts the PRCP as redundancy and combines with multiple antennas. In fact, the multiple input and multiple output (MIMO) system, which exploits the spatial diversity, it can be used to further enhance the channel capacity and achieve high data-rate, and we extend the PRCP-OFDM to the MIMO case with space-time block coding. In redundancy insufficient case, the blind channel shortening algorithm be adopted for suppressing the IBI. The main property of PRCP-OFDM modulation is that it exploits the cyclic-postfix sequences to estimate channel information with a low complexity method. For CP-OFDM, it overcomes the channel null problem. Compared with ZP-OFDM, it uses the additional information to estimate channel which is replaced by zero samples in ZP-OFDM. Moreover, PRCP-OFDM avoids the interference of signals to the desired postfix when we estimate channel impulse response (CIR) and which is different from pseudo random postfix (PRP-) OFDM [8]. Thus, when SNR grows, PRCP-OFDM can have better performance than PRP-OFDM. With the help of [9], [12] and [13]. Via computer simulation, we verify that the performance is improved.

The objective of the proposed research is to present a new all-digital outphasing transmitter IC, a comprehensive explanation of its operation, and its performance characterization. The all-digital transmitter chip leverages flexible digital phase modulators (DPMs) to adaptively compensate for amplifier mismatches. As the DPM uses a digital input to directly modulate the RF phase of each path, the phase control becomes very simple and accurate for power amplifier (PA) gain/phase mismatch compensation. Furthermore, this digital phase modulation scheme also facilitates minimizing the distortion of an RF combiner. It is newly proposed that two distinct digital predistortion algorithms are required for perfect compensation for both PAs and a combiner. All phase calibration values can be adaptively calculated as a function of outphase angle and saved in digital look-up tables to predistort the phase inputs of two DPMs. Various types of PAs and combiners are investigated to further enhance the performance of the outphasing transmitter. These features are implemented in a chip fabricated in a 0.18-¥ìm CMOS process and evaluated with IEEE 802.16e baseband symbols.

<p>Kraven på dagens trådlösa förbindelser kommer hela tiden att öka och med detta följer även högre krav på nya produkter som kan tillgodose de ökade kraven. För att göra processen från idé till produkt snabbare krävs enkla verktyg för att snabbt kunna gå från den formulerade standarden till en hårdvaruprototyp. Detta arbete har använt sig av ett av dessa verktyg som idag finns tillgängliga, Xilinx System Generator for DSP 1.1, för att ta fram sändare och mottagare för en del av den trådlösa standarden IEEE 802.11a. Arbetet ger en beskrivning av hur sändare och mottagare är uppbyggda samt även synpunkter på System Generator och beskrivningar av problem som uppstod under arbetet. </p> / <p>The demands on todays wireless communications will continue to increase and with this follows a demand for shorter and shorter development times for the products that are going to satisfy this demand. To accomplish this shorter development time simple tools for going from the formulated standard to a hardware prototype is needed. This work uses one of these tools today available, Xilinx System Generator for DSP 1.1, to develop a transmitter and a reciever for a part of the wireless standard IEEE 802.11a. The work gives a description of the building blocks of the transmitter and the reciever but also some views on System Generator and descriptions of problems that were encountered during the work.</p>

Solutions to the problem of large peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are proposed. Although the design of PAPR reduction codewords has been extensively studied and the existence of asymptotically good codes with low PAPR has been proved, still no reduced PAPR capacity achieving code has been constructed. This is the topic of the current thesis.This goal is achieved by implementing a time-frequency turbo block coded OFDM. In this scheme, we design the frequency domain component code to have a PAPR bounded by a small number. The time domain component code is designed to obtain good performance while the decoding algorithm has reasonable complexity. Through comparative numerical evaluation we show that our method achieves considerable improvement in terms of PAPR with slight performance degradation compared to capacity achieving codes with similar block lengths. For the frequency domain component code, we used the realization of Golay sequences as cosets of the fi rst order Reed-Muller code and the modi cation of dual BCH code. A simple MAP decoding algorithm for the modi ed dual BCH code is also provided. Finally, we provide a flexible and practical scheme based on probabilistic approach to a PAPR problem. This approach decreases the PAPR without any signi cant performance loss and without any adverse impact or required change to the system. / Engineering and Applied Sciences

Modern wireless communication systems strive to enable communications at high data rates, over wide geographical areas, and to multiple users. Unfortunately, this can be a daunting task in practice, as natural laws governing the wireless medium may hinder point-to-point transmissions. Communications over large distances (path loss), and physical obstructions in line-of-sight signals (shadowing) are prime examples of such impediments. One promising solution is to deploy intermediary terminals to help reestablish such broken point-to-point communication links. Such terminals are called relay nodes, and the corresponding systems are referred to as being relay-aided. As in the case of point-to-point communication, design of efficient transmission and reception techniques in relay-aided systems depends on the availability of propagational channel state information. In practice, such information is only accurate to a certain degree which is governed by overhead constraints, feedback delay, and channel fluctuations due to mobility. Understanding the impacts of such partial channel state information, and devising transmission and reception methods based on such understandings, is the main topic of this dissertation. The transmission protocol classifies relays as either one-way, where the relay receives signals from one terminal, or two-way, where the relay receives signals from more than one terminal. Designs and solutions for both one- and two-way relaying systems are presented in this dissertation. Emphasis is placed on two-way relaying systems given their superior efficiency in utilizing channel resources. For one-way relaying this dissertation presents power loading strategies for multiuser-multicast systems derived based on the availability of full or partial channel state information at the terminals. In the case of two-way relaying, both single and multi-user systems are analyzed. For single-user two-way relaying, this dissertation presents optimal methods of acquiring partial channel state information via pilot-aided channel estimation methods. This includes an analysis of the effects of channel estimation upon the system sum-rate. Also, the design of channel equalizers exhibiting robustness to partial channel state information is proposed. For multi-user two-way relaying, this dissertation presents several precoding strategies at the relay terminal(s) to combat the effects co-channel interference in light of the existence of self-interference inherent to two-way relaying operations. / text

Link adaptation is an important component of contemporary wireless networks that require high spectral efficiency and service a variety of network applications/configurations. By exploiting information about the wireless channel, link adaptation strategically selects wireless communication transmission parameters in real-time to optimize performance. Link adaptation in practice has proven challenging due to impairments outside system models and analytical intractability in modern broadband networks with multiple antennas (MIMO), orthogonal frequency division multiplexing (OFDM), forward error correction, and bit-interleaving. The objective of this dissertation is to provide simple and flexible link adaptation algorithms with few link model assumptions that are amenable to modern wireless networks. First, a complete design and analysis of supervised learning for link adaptation in MIMO-OFDM is provided. This includes the construction of a publicly available data set, a new frame error rate bound leading to a new feature set, and IEEE 802.11n performance evaluation to verify that my design outperforms existing link quality metrics. Next, two supervised learning classification algorithms are designed to exploit information collected from packets transmitted and received over standard links in real time: database learning with nearest neighbor classifiers and support vector machines. Algorithms are also proposed to preserve diversity of feature sets in the database and to allow learning algorithms to seek out more information about the network. Finally, link adaptation with supervised learning is applied to MIMO-OFDM systems where the modulation order may be adapted per-stream. This leads to the analysis of the ordered SNR per stream and its connection to the cumulative distribution function of SNR on each stream. Decoupled link adaptation algorithms, which significantly reduce the complexity of non-uniform link adaptation algorithms, are proposed. New analysis of non-uniform link adaptation shows that the performance of decoupled link adaptation algorithms converge to the performance of joint (optimal) link adaptation algorithms as the number of modulation and coding options per-stream increase. This guides the construction of future standards to reduce the complexity of link adaptation in MIMO-OFDM. / text

Στα ασύρµατα δίκτυα η τεχνολογία MIMO-OFDM έχει ευρέως υιοθετηθεί µε στόχο την αύξηση του ρυθµού δεδοµένων σε υπηρεσίες υψηλής ποιότητας. Στο δέκτη ενός συστήµατος MIMO-OFDM ο υπολογισµός του µητρώου συντελεστών που χρειάζεται ο εξισωτής (equalizer) είναι ένα κρίσιµο σηµείο µε υψηλή υπολογιστική πολυπλοκότητα. Η καθυστέρηση που απαιτείται για την εκτέλεση του συγκεκριµένου υπολογισµού επηρεάζει άµεσα το ρυθµό περάτωσης (throughput) και την ποιότητα υπηρεσίας (QoS). Σε συστήµατα wi-fi (για παράδειγµα στο IEEE 802.11ac) στην αρχή κάθε πακέτου µεταδίδονται προσυµφωνηµένα σύµβολα, ώστε να εκπαιδεύσουν τον εξισωτή. Η συµβατική µέθοδος περιµένει να έρθουν όλα τα σύµβολα και στη συνέχεια υπολογίζει τοµητρώο του εξισωτή. Μια πιο πρόσφατη µέθοδος που αποσκοπεί στη µείωση της παραπάνω καθυστέρησης είναι ο προοδευτικός υπολογισµός του µητρώου του εξισωτή. Στη µέθοδο αυτή, γίνονται υπολογισµοί ανά σύµβολο εκπαίδευσης χωρίς να επηρεάζεται το τελικό αποτέλεσµα. Στα πλαίσια της διπλωµατικής υλοποιήθηκαν αρχιτεκτονικές υλικού για εξισωτές που αξιοποιούν την ανωτέρω µέθοδο και απεικονίστηκαν σε αναπτυξιακό σύστηµα µε FPGA. Επίσης, διερευνήθηκε ο ρόλος της αναπαράστασης των δεδοµένων στην πολυπλοκότητα του συστήµατος και βελτιστοποιήθηκαν οι σχετικές σχεδιαστικές παράµετροι, µε έµφαση στη χρήση της λογαριθµικής αριθµητικής. / In wireless networks, the MIMO-OFDM technology has been widely adopted in order to increase the data rate at high quality of service (QoS). In the receiver, the MIMO equalizer matrix calculation is an important part with high computational complexity. The delay of the matrix calculation affects directly the system throughput and QoS. In wi-fi systems (e.g. IEEE 802.11ac), training symbols are transmitted at the beginning of every frame, in order to train the equalizer. The conventional method waits all the training symbols to arrive before starting the calculations. A recent method proposes the progressive calculation of the equalizer matrix in order to decrease the processing delay. In this method, the equalizer matrix calculation starts upon receiving the first training symbol. The object of this thesis is the development of hardware architectures for equalizers that follow the progressive method and their implementation on FPGA. Furthermore, we analyzed the impact of the data representation on the system complexity and optimized the respective design parameters, using logarithmic number system.

Στις υποθαλάσσιες επικοινωνίες χρησιμοποιούνται ακουστικά κύματα για τη μεταφορά της πληροφορίας. Κατά τη διαδικασία της μετάδοσης εμφανίζονται προβλήματα που σχετίζον- ται με τη καθυστέρηση διάδοσης, την εξασθένηση του σήματος, τις πολλαπλές οδεύσεις λόγω ανάκλασης καθώς και άλλα προβλήματα που παρουσιάζονται στις ασύρματες επι- κοινωνίες. Στην παρούσα εργασία αναλύεται και εξετάζεται η πλειονότητα αυτών. Στο πρώτο κεφάλαιο γίνεται μία συνοπτική περιγραφή του φαινομένου των διαλείψεων καθώς και η ανάλυση βασικών εννοιών, τις οποίες συναντάμε σε επόμενα κεφάλαια. Στο δεύτερο κεφάλαιο περιγράφεται η πολύπλεξη OFDM, η οποία χρησιμοποιείται στις περισσότερες εφαρμογές των υποθαλάσσιων επικοινωνιών. Στο τρίτο κεφάλαιο αναλύεται μαθηματικά η τυφλή εκτίμηση για συστήματα OFDM και αναφέρονται επίσης προσαρμοστικοί αλγόριθ- μοι για την εκτίμηση του καναλιού με βάση την θεωρία η οποία παρουσιάζεται. Τέλος στο τέταρτο κεφάλαιο παρατίθεται κώδικας matlab, στον οποίο γίνεται χρήση των αλγορίθμων των τρίτου κεφαλαίου με σκοπό την εκτίμηση της κρουστικής απόκρισης του καναλιού, ενώ πέραν της γενικής περίπτωσης εξετάζονται επιπλέον λύσεις sparse μορφής. / --