Doctor of Philosophy

dissertationThe demand for high speed communication has been increasing in the past two decades. Multicarrier communication technology has been suggested to address this demand. Orthogonal frequency-division multiplexing (OFDM) is the most widely used multicarrier technique. However, OFDM has a number of disadvantages in time-varying channels, multiple access, and cognitive radios. On the other hand, filterbank multicarrier (FBMC) communication has been suggested as an alternative to OFDM that can overcome the disadvantages of OFDM. In this dissertation, we investigate the application of filtered multitone (FMT), a subset of FBMC modulation methods, to slow fading and fast fading channels. We investigate the FMT transmitter and receiver in continuous and discrete time domains. An efficient implementation of FMT systems is derived and the conditions for perfect reconstruction in an FBMC communication system are presented. We derive equations for FMT in slow fading channels that allow evaluation of FMT when applied to mobile wireless communication systems. We consider using fractionally spaced per tone channel equalizers with different number of taps. The numerical results are presented to investigate the performance of these equalizers. The numerical results show that single-tap equalizers suffice for typical wireless channels. The equalizer design study is advanced by introducing adaptive equalizers which use channel estimation. We derive equations for a minimum mean square error (MMSE) channel estimator and improve the channel estimation by considering the finite duration of channel impulse response. The results of optimum equalizers (when channel is known perfectly) are compared with those of the adaptive equalizers, and it is found that a loss of 1 dB or less incurs. We also introduce a new form of FMT which is specially designed to handle doubly dispersive channels. This method is called FMT-dd (FMT for doubly dispersive channels). The proposed FMT-dd is applied to two common methods of data symbol orientation in the time-frequency space grid; namely, rectangular and hexagonal lattices. The performance of these methods along with OFDM and the conventional FMT are compared and a significant improvement in performance is observed. The FMT-dd design is applied to real-world underwater acoustic (UWA) communication channels. The experimental results from an at-sea experiment (ACOMM10) show that this new design provides a significant gain over OFDM. The feasibility of implementing a MIMO system for multicarrier UWA communication channels is studied through computer simulations. Our study emphasizes the bandwidth efficiency of multicarrier MIMO communications .We show that the value of MIMO to UWA communication is very limited

Advanced receiver structures for mobile MIMO multicarrier communication systems

Beyond third generation (3G) and fourth generation (4G) wireless communication systems are targeting far higher data rates, spectral efficiency and mobility requirements than existing 3G networks. By using multiple antennas at the transmitter and the receiver, multiple-input multiple-output (MIMO) technology allows improving both the spectral efficiency (bits/s/Hz), the coverage, and link reliability of the system. Multicarrier modulation such as orthogonal frequency division multiplexing (OFDM) is a powerful technique to handle impairments specific to the wireless radio channel. The combination of multicarrier modulation together with MIMO signaling provides a feasible physical layer technology for future beyond 3G and fourth generation communication systems. The theoretical benefits of MIMO and multicarrier modulation may not be fully achieved because the wireless transmission channels are time and frequency selective. Also, high data rates call for a large bandwidth and high carrier frequencies. As a result, an important Doppler spread is likely to be experienced, leading to variations of the channel over very short period of time. At the same time, transceiver front-end imperfections, mobility and rich scattering environments cause frequency synchronization errors. Unlike their single-carrier counterparts, multi-carrier transmissions are extremely sensitive to carrier frequency offsets (CFO). Therefore, reliable channel estimation and frequency synchronization are necessary to obtain the benefits of MIMO OFDM in mobile systems. These two topics are the main research problems in this thesis. An algorithm for the joint estimation and tracking of channel and CFO parameters in MIMO OFDM is developed in this thesis. A specific state-space model is introduced for MIMO OFDM systems impaired by multiple carrier frequency offsets under time-frequency selective fading. In MIMO systems, multiple frequency offsets are justified by mobility, rich scattering environment and large angle spread, as well as potentially separate radio frequency - intermediate frequency chains. An extended Kalman filter stage tracks channel and CFO parameters. Tracking takes place in time domain, which ensures reduced computational complexity, robustness to estimation errors as well as low estimation variance in comparison to frequency domain processing. The thesis also addresses the problem of blind carrier frequency synchronization in OFDM. Blind techniques exploit statistical or structural properties of the OFDM modulation. Two novel approaches are proposed for blind fine CFO estimation. The first one aims at restoring the orthogonality of the OFDM transmission by exploiting the properties of the received signal covariance matrix. The second approach is a subspace algorithm exploiting the correlation of the channel frequency response among the subcarriers. Both methods achieve reliable estimation of the CFO regardless of multipath fading. The subspace algorithm needs extremely small sample support, which is a key feature in the face of time-selective channels. Finally, the Cramér-Rao (CRB) bound is established for the problem in order to assess the large sample performance of the proposed algorithms.reviewe

A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction

The widespread of underdetermined systems has brought forth a variety of new algorithmic solutions, which capitalize on the Compressed Sensing (CS) of sparse data. While well known greedy or iterative threshold type of CS recursions take the form of an adaptive filter followed by a proximal operator, this is no different in spirit from the role of block iterative decision-feedback equalizers (BI-DFE), where structure is roughly exploited by the signal constellation slicer. By taking advantage of the intrinsic sparsity of signal modulations in a communications scenario, the concept of interblock interference (IBI) can be approached more cunningly in light of CS concepts, whereby the optimal feedback of detected symbols is devised adaptively. The new DFE takes the form of a more efficient re-estimation scheme, proposed under recursive-least-squares based adaptations. Whenever suitable, these recursions are derived under a reduced-complexity, widely-linear formulation, which further reduces the minimum-mean-square-error (MMSE) in comparison with traditional strictly-linear approaches. Besides maximizing system throughput, the new algorithms exhibit significantly higher performance when compared to existing methods. Our reasoning will also show that a properly formulated BI-DFE turns out to be a powerful CS algorithm itself. A new algorithm, referred to as CS-Block DFE (CS-BDFE) exhibits improved convergence and detection when compared to first order methods, thus outperforming the state-of-the-art Complex Approximate Message Passing (CAMP) recursions. The merits of the new recursions are illustrated under a novel 3D MIMO Radar formulation, where the CAMP algorithm is shown to fail with respect to important performance measures.A proliferação de sistemas sub-determinados trouxe a tona uma gama de novas soluções algorítmicas, baseadas no sensoriamento compressivo (CS) de dados esparsos. As recursões do tipo greedy e de limitação iterativa para CS se apresentam comumente como um filtro adaptativo seguido de um operador proximal, não muito diferente dos equalizadores de realimentação de decisão iterativos em blocos (BI-DFE), em que um decisor explora a estrutura do sinal de constelação. A partir da esparsidade intrínseca presente na modulação de sinais no contexto de comunicações, a interferência entre blocos (IBI) pode ser abordada utilizando-se o conceito de CS, onde a realimentação ótima de símbolos detectados é realizada de forma adaptativa. O novo DFE se apresenta como um esquema mais eficiente de reestimação, baseado na atualização por mínimos quadrados recursivos (RLS). Sempre que possível estas recursões são propostas via formulação linear no sentido amplo, o que reduz ainda mais o erro médio quadrático mínimo (MMSE) em comparação com abordagens tradicionais. Além de maximizar a taxa de transferência de informação, o novo algoritmo exibe um desempenho significativamente superior quando comparado aos métodos existentes. Também mostraremos que um equalizador BI-DFE formulado adequadamente se torna um poderoso algoritmo de CS. O novo algoritmo CS-BDFE apresenta convergência e detecção aprimoradas, quando comparado a métodos de primeira ordem, superando as recursões de Passagem de Mensagem Aproximada para Complexos (CAMP). Os méritos das novas recursões são ilustrados através de um modelo tridimensional para radares MIMO recentemente proposto, onde o algoritmo CAMP falha em aspectos importantes de medidas de desempenho

Spectrally efficient multicarrier communication systems: signal detection, mathematical modelling and optimisation

This thesis considers theoretical, analytical and engineering design issues relating to non-orthogonal Spectrally Efficient Frequency Division Multiplexing (SEFDM) communication systems that exhibit significant spectral merits when compared to Orthogonal FDM (OFDM) schemes. Alas, the practical implementation of such systems raises significant challenges, with the receivers being the bottleneck. This research explores detection of SEFDM signals. The mathematical foundations of such signals lead to proposals of different orthonormalisation techniques as required at the receivers of non-orthogonal FDM systems. To address SEFDM detection, two approaches are considered: either attempt to solve the problem optimally by taking advantage of special cases properties or to apply sub-optimal techniques that offer reduced complexities at the expense of error rates degradation. Initially, the application of sub-optimal linear detection techniques, such as Zero Forcing (ZF) and Minimum Mean Squared Error (MMSE), is examined analytically and by detailed modelling. To improve error performance a heuristic algorithm, based on a local search around an MMSE estimate, is designed by combining MMSE with Maximum Likelihood (ML) detection. Yet, this new method appears to be efficient for BPSK signals only. Hence, various variants of the sphere decoder (SD) are investigated. A Tikhonov regularised SD variant achieves an optimal solution for the detection of medium size signals in low noise regimes. Detailed modelling shows the SD detector to be well suited to the SEFDM detection, however, with complexity increasing with system interference and noise. A new design of a detector that offers a good compromise between computational complexity and error rate performance is proposed and tested through modelling and simulation. Standard reformulation techniques are used to relax the original optimal detection problem to a convex Semi-Definite Program (SDP) that can be solved in polynomial time. Although SDP performs better than other linear relaxations, such as ZF and MMSE, its deviation from optimality also increases with the deterioration of the system inherent interference. To improve its performance a heuristic algorithm based on a local search around the SDP estimate is further proposed. Finally, a modified SD is designed to implement faster than the local search SDP concept. The new method/algorithm, termed the pruned or constrained SD, achieves the detection of realistic SEFDM signals in noisy environments

System design and validation of multi-band OFDM wireless communications with multiple antennas

[no abstract

Application of integer quadratic programming in detection of high-dimensional wireless systems

High-dimensional wireless systems have recently generated a great deal of interest due to their ability to accommodate increasing demands for high transmission data rates with high communication reliability. Examples of such large-scale systems include single-input, single-output symbol spread OFDM system, large-scale single-user multi-input multi-output (MIMO) OFDM systems, and large-scale multiuser MIMO systems. In these systems, the number of symbols required to be jointly detected at the receiver is relatively large. The challenge with the practical realization of these systems is to design a detection scheme that provides high communication reliability with reasonable computational complexity, even as the number of simultaneously transmitted independent communication signals becomes very large.^ Most of the optimal or near-optimal detection techniques that have been proposed in the literature of relatively low-dimensional wireless systems, such as MIMO systems in which number of antennas is less than 10, become problematic for high-dimensional detection problems. That is, their performance degrades or the computational complexity becomes prohibitive, especially when higher-order QAM constellations are employed.^ In the first part of this thesis, we propose a near-optimal detection technique which offers a flexible trade-off between complexity and performance. The proposed technique formulates the detection problem in terms of Integer Quadratic Programming (IQP), which is then solved through a controlled Branch and Bound (BB) search tree algorithm. In addition to providing good performance, an important feature of this approach is that its computational complexity remains roughly the same even as we increase the constellation order from 4-QAM to 256-QAM. The performance of the proposed algorithm is investigated for both symbol spread OFDM systems and large-scale MIMO systems with both frequency selective and at fading channels.^ The second part of this work focuses on a reduced complexity version of IQP referred to as relaxed quadratic programming (QP). In particular, QP is used to reformulate two widely used detection schemes for MIMO OFDM: (1) Successive Interference Cancellation (SIC) and (2) Iterative Detecting and Decoding (IDD). First, SIC-based algorithms are derived via a QP formulation in contrast to using a linear MMSE detector at each stage. The resulting QP-SIC algorithms offer lower computational complexity than the SIC schemes that employ linear MMSE at each stage, especially when the dimension of the received signal vector is high. Three versions of QP-SIC are proposed based on various trade-offs between complexity and receiver performance; each of the three QP-SIC algorithms outperforms existing SIC techniques. Second, IDD-based algorithms are developed using a QP detector. We show how the soft information, in terms of the Log Likelihood Ratio (LLR), can be extracted from the QP detector. Further, the procedure for incorporating the a-priori information that is passed from the channel decoder to the QP detector is developed. Simulation results are presented demonstrating that the use of QP in IDD offers improved performance at the cost of a reasonable increase in complexity compared to linear detectors

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

Comparative study and performance evaluation of MC-CDMA and OFDM over AWGN and fading channels environment

Η απαίτηση για εφαρμογές υψηλής ταχύτητας μετάδοσης δεδομένων έχει αυξηθεί σημαντικά τα τελευταία χρόνια. Η πίεση των χρηστών σήμερα για ταχύτερες επικοινωνίες, ανεξαρτήτως κινητής ή σταθερής, χωρίς επιπλέον κόστος είναι μια πραγματικότητα. Για να πραγματοποιηθούν αυτές οι απαιτήσεις, προτάθηκε ένα νέο σχήμα που συνδυάζει ψηφιακή διαμόρφωση και πολλαπλές προσβάσεις, για την ακρίβεια η Πολλαπλή Πρόσβαση με διαίρεση Κώδικα Πολλαπλού Φέροντος (Multi-Carrier Code Division Multiple Access MC-CDMA). Η εφαρμογή του Γρήγορου Μετασχηματισμού Φουριέ (Fast Fourier Transform,FFT) που βασίζεται στο (Orthogonal Frequency Division Multiplexing, OFDM) χρησιμοποιεί τις περίπλοκες λειτουργίες βάσεως και αντικαθίσταται από κυματομορφές για να μειώσει το επίπεδο της παρεμβολής. Έχει βρεθεί ότι οι μετασχηματισμένες κυματομορφές (Wavelet Transform,W.T.) που βασίζονται στον Haar είναι ικανές να μειώσουν το ISI και το ICI, που προκαλούνται από απώλειες στην ορθογωνιότητα μεταξύ των φερόντων, κάτι που τις καθιστά απλούστερες για την εφαρμογή από του FFT. Επιπλέον κέρδος στην απόδοση μπορεί να επιτευχθεί αναζητώντας μια εναλλακτική λειτουργία ορθογωνικής βάσης και βρίσκοντας ένα καλύτερο μετασχηματισμό από του Φουριέ (Fourier) και τον μετασχηματισμό κυματομορφής (Wavelet Transform). Στην παρούσα εργασία, υπάρχουν τρία προτεινόμενα μοντέλα. Το 1ο, ( A proposed Model ‘1’ of OFDM based In-Place Wavelet Transform), το 2ο, A proposed Model ‘2’ based In-Place Wavelet Transform Algorithm and Phase Matrix (P.M) και το 3ο, A proposed Model ‘3’ of MC-CDMA Based on Multiwavelet Transform. Οι αποδόσεις τους συγκρίθηκαν με τα παραδοσιακά μοντέλα μονού χρήστη κάτω από διαφορετικά κανάλια (Κανάλι AWGN, επίπεδη διάλειψη και επιλεκτική διάλειψη).The demand for high data rate wireless multi-media applications has increased significantly in the past few years. The wireless user’s pressure towards faster communications, no matter whether mobile, nomadic, or fixed positioned, without extra cost is nowadays a reality. To fulfill these demands, a new scheme which combines wireless digital modulation and multiple accesses was proposed in the recent years, namely, Multicarrier-Code Division Multiple Access (MC-CDMA). The Fourier based OFDM uses the complex exponential bases functions and it is replaced by wavelets in order to reduce the level of interference. It is found that the Haar-based wavelets are capable of reducing the ISI and ICI, which are caused by the loss in orthogonality between the carriers. Further performance gains can be made by looking at alternative orthogonal basis functions and finding a better transform rather than Fourier and wavelet transform. In this thesis, there are three proposed models [Model ‘1’ (OFDM based on In-Place Wavelet Transform, Model ‘2’ (MC-CDMA based on IP-WT and Phase Matrix) and Model ‘3’ (MC-CDMA based on Multiwavelet Transform)] were created and then comparison their performances with the traditional models for single user system were compared under different channel characteristics (AWGN channel, flat fading and selective fading). The conclusion of my study as follows, the models (1) was achieved much lower bit error rates than traditional models based FFT. Therefore these models can be considered as an alternative to the conventional MC-CDMA based FFT. The main advantage of using In-Place wavelet transform in the proposed models that it does not require an additional array at each sweep such as in ordered Fast Haar wavelet transform, which makes it simpler for implementation than FFT. The model (2) gave a new algorithm based on In-Place wavelet transform with first level processing multiple by PM was proposed. The model (3) gave much lower bit error than other two models in additional to traditional models

Channel equalization to achieve high bit rates in discrete multitone systems

textMulticarrier modulation (MCM) techniques such as orthogonal frequency division multiplexing (OFDM) and discrete multi-tone (DMT) modulation are attractive for high-speed data communications due to the ease with which MCM can combat channel dispersion. With all the benefits MCM could give, DMT modulation has an extra ability to perform dynamic bit loading, which has the potential to exploit fully the available bandwidth in a slowly time-varying channel. In broadband wireline communications, DMT modulation is standardized for asymmetric digital subscribe line (ADSL) and very-high-bit-rate digital subscriber line (VDSL) modems. ADSL and VDSL standards are used by telephone companies to provide high speed data service to residences and offices. In an ADSL receiver, an equalizer is required to compensate for the channel’s dispersion in the time domain and the channel’s distortion in the frequency domain of the transmitted waveform. This dissertation proposes design methods for linear equalizers to increase the bit rate of the connection. The methods are amenable to implementation on programmable fixed-point digital signal processors, which are employed in ADSL/VDSL transceivers. A conventional ADSL equalizer consists of a time-domain equalizer, a fast Fourier transform, and a frequency domain equalizer. The time domain equalizer (TEQ) is a finite impulse response filter that when coupled with a discretized channel produces an equivalent channel whose impulse response is shorter than that of the discretized channel. This channel shortening is required by the ADSL standards. In this dissertation, I first propose a linear phase TEQ design that exploits symmetry in existing eigen-filter approaches such as minimum mean square error(MMSE), maximum shortening signal to noise ratio (MSSNR) and minimum intersymbol interference (Min-ISI) equalizers. TEQs with symmetric coefficients can reach the same performance as non-symmetric ones with much lower training complexity. Second, I improve Min-ISI design. I reformulate the cost function to make long TEQs design feasible. I remove the dependency of transmission delay in order to reduce the complexity associated with delay optimization. The quantized weighting is introduced to further lower the complexity. I also propose an iterative optimization procedure of Min-ISI that completely avoids Cholesky decomposition hence is better suited for a fixed-point implementation. Finally I propose a dual-path TEQ structure, which designs a standard singleFIR TEQ to achieve good bit rate over the entire transmission bandwidth, and designs another FIR TEQ to improve the bit rate over a subset of subcarriers. Dualpath TEQ can be viewed as a special case of a complex valued filter bank structure that delivers the best bit rate of existing DMT equalizers. However, dual-path TEQ provides a very good tradeoff between achievable bit rate vs. implementation complexity on a programmable digital signal processor.Electrical and Computer Engineerin