From Linear Equalization to Lattice-Reduction-Aided Sphere-Detector as an Answer to the MIMO Detection Problematic in Spatial Multiplexing Systems

ISBN 978-953-307-223-4International audienc

Performance Evaluation of MIMO Spatial Multiplexing Detection Techniques

Multiple Input Multiple Output (MIMO) multiplexing is a promising technology that can greatly increase the channel capacity without additional spectral resources. The challenge is to design detection algorithms that can recover transmitted signals with acceptable complexity and high performance. In this paper, several MIMO Spatial Multiplexing (SM) detection techniques are introduced and evaluated in terms of BER. Different aspects have been considered and discussed in this evaluation such as; signal to noise ratio, number of transmit and receive antennas. The performance comparisons and graphs have been generated using an optimized simulator. This simulator has been developed using MATLAB®

Novel LDPC coding and decoding strategies: design, analysis, and algorithms

In this digital era, modern communication systems play an essential part in nearly every aspect of life, with examples ranging from mobile networks and satellite communications to Internet and data transfer. Unfortunately, all communication systems in a practical setting are noisy, which indicates that we can either improve the physical characteristics of the channel or find a possible systematical solution, i.e. error control coding. The history of error control coding dates back to 1948 when Claude Shannon published his celebrated work “A Mathematical Theory of Communication”, which built a framework for channel coding, source coding and information theory. For the first time, we saw evidence for the existence of channel codes, which enable reliable communication as long as the information rate of the code does not surpass the so-called channel capacity. Nevertheless, in the following 60 years none of the codes have been proven closely to approach the theoretical bound until the arrival of turbo codes and the renaissance of LDPC codes. As a strong contender of turbo codes, the advantages of LDPC codes include parallel implementation of decoding algorithms and, more crucially, graphical construction of codes. However, there are also some drawbacks to LDPC codes, e.g. significant performance degradation due to the presence of short cycles or very high decoding latency. In this thesis, we will focus on the practical realisation of finite-length LDPC codes and devise algorithms to tackle those issues. Firstly, rate-compatible (RC) LDPC codes with short/moderate block lengths are investigated on the basis of optimising the graphical structure of the tanner graph (TG), in order to achieve a variety of code rates (0.1 < R < 0.9) by only using a single encoder-decoder pair. As is widely recognised in the literature, the presence of short cycles considerably reduces the overall performance of LDPC codes which significantly limits their application in communication systems. To reduce the impact of short cycles effectively for different code rates, algorithms for counting short cycles and a graph-related metric called Extrinsic Message Degree (EMD) are applied with the development of the proposed puncturing and extension techniques. A complete set of simulations are carried out to demonstrate that the proposed RC designs can largely minimise the performance loss caused by puncturing or extension. Secondly, at the decoding end, we study novel decoding strategies which compensate for the negative effect of short cycles by reweighting part of the extrinsic messages exchanged between the nodes of a TG. The proposed reweighted belief propagation (BP) algorithms aim to implement efficient decoding, i.e. accurate signal reconstruction and low decoding latency, for LDPC codes via various design methods. A variable factor appearance probability belief propagation (VFAP-BP) algorithm is proposed along with an improved version called a locally-optimized reweighted (LOW)-BP algorithm, both of which can be employed to enhance decoding performance significantly for regular and irregular LDPC codes. More importantly, the optimisation of reweighting parameters only takes place in an offline stage so that no additional computational complexity is required during the real-time decoding process. Lastly, two iterative detection and decoding (IDD) receivers are presented for multiple-input multiple-output (MIMO) systems operating in a spatial multiplexing configuration. QR decomposition (QRD)-type IDD receivers utilise the proposed multiple-feedback (MF)-QRD or variable-M (VM)-QRD detection algorithm with a standard BP decoding algorithm, while knowledge-aided (KA)-type receivers are equipped with a simple soft parallel interference cancellation (PIC) detector and the proposed reweighted BP decoders. In the uncoded scenario, the proposed MF-QRD and VM-QRD algorithms are shown to approach optimal performance, yet require a reduced computational complexity. In the LDPC-coded scenario, simulation results have illustrated that the proposed QRD-type IDD receivers can offer near-optimal performance after a small number of detection/decoding iterations and the proposed KA-type IDD receivers significantly outperform receivers using alternative decoding algorithms, while requiring similar decoding complexity

Polynomial matrix decomposition techniques for frequency selective MIMO channels

For a narrowband, instantaneous mixing multi-input, multi-output (MIMO) communications system, the channel is represented as a scalar matrix. In this scenario, singular value decomposition (SVD) provides a number of independent spatial subchannels which can be used to enhance data rates or to increase diversity. Alternatively, a QR decomposition can be used to reduce the MIMO channel equalization problem to a set of single channel equalization problems. In the case of a frequency selective MIMO system, the multipath channel is represented as a polynomial matrix. Thus conventional matrix decomposition techniques can no longer be applied. The traditional solution to this broadband problem is to reduce it to narrowband form by using a discrete Fourier transform (DFT) to split the broadband channel into N narrow uniformly spaced frequency bands and applying scalar decomposition techniques within each band. This describes an orthogonal frequency division multiplexing (OFDM) based system. However, a novel algorithm has been developed for calculating the eigenvalue decomposition of a para-Hermitian polynomial matrix, known as the sequential best rotation (SBR2) algorithm. SBR2 and its QR based derivatives allow a true polynomial singular value and QR decomposition to be formulated. The application of these algorithms within frequency selective MIMO systems results in a fundamentally new approach to exploiting spatial diversity. Polynomial matrix decomposition and OFDM based solutions are compared for a wide variety of broadband MIMO communication systems. SVD is used to create a robust, high gain communications channel for ultra low signal-to-noise ratio (SNR) environments. Due to the frequency selective nature of the channels produced by polynomial matrix decomposition, additional processing is required at the receiver resulting in two distinct equalization techniques based around turbo and Viterbi equalization. The proposed approach is found to provide identical performance to that of an existing OFDM scheme while supporting a wider range of access schemes. This work is then extended to QR decomposition based communications systems, where the proposed polynomial approach is found to not only provide superior bit-error-rate (BER) performance but significantly reduce the complexity of transmitter design. Finally both techniques are combined to create a nulti-user MIMO system that provides superior BER performance over an OFDM based scheme. Throughout the work the robustness of the proposed scheme to channel state information (CSI) error is considered, resulting in a rigorous demonstration of the capabilities of the polynomial approach

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

Transmit antenna selection and user selection in multiuser MIMO downlink systems

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonMultiuser multiple input multiple output (MU-MIMO) systems play essential role in improving throughput performance and link reliability in wireless communications. This improvement can be achieved by exploiting the spatial domain and without the need of additional power and bandwidth. In this thesis, three main issues which are of importance to the data rate transmission have been investigated. Firstly, antenna selection in MU-MIMO downlink systems has been considered, where this technique can be e fficiently used to reduce the complexity and cost caused by radio frequency chains, associated with antennas, while keeping most of the diversity advantages of the system. We proposed a transmit antenna selection algorithm which can select an optimal set of antennas for transmission in descending order depending on the product of eigenvalues of users' effective channels. The capacity achieved by the proposed algorithm is about 99:6% of the capacity of the optimum search method, with much lower complexity. Secondly, user selection technology in MU-MIMO downlink systems has been studied. Based on the QR decomposition, we proposed a greedy suboptimal user selection algorithm which adopts the product of singular values of users' effective channels as a selection metric. The performance achieved by the proposed algorithm is identical to that of the capacity-based algorithm, with significant reduction in complexity. Finally, a proportional fairness scheduling algorithm for MU-MIMO downlink systems has been proposed. By utilising the upper triangular matrix obtained by applying the QRD on the users' effective channel matrices, two selection metrics have been proposed to achieve the scheduling process. The first metric is based on the maximum entry of the upper triangular matrix, while the second metric is designed using the ratio between the maximum and minimum entries of the triangular matrix multiplied by the product of singular values of effective channels. The two metric provide significant degrees of fairness. For each of these three issues, a different precoding method has been used in order to cancel the interuser interference before starting the selection process. This allows to investigate each precoding design separately and to evaluate the computational burden required for each design.Ministry of Higher Education-Ira

Performance analysis of diversity techniques in wireless communication systems: Cooperative systems with CCI and MIMO-OFDM systems

This Dissertation analyzes the performance of ecient digital commu- nication systems, the performance analysis includes the bit error rate (BER) of dier- ent binary and M-ary modulation schemes, and the average channel capacity (ACC) under dierent adaptive transmission protocols, namely, the simultaneous power and rate adaptation protocol (OPRA), the optimal rate with xed power protocol (ORA), the channel inversion with xed rate protocol (CIFR), and the truncated channel in- version with xed transmit power protocol (CTIFR). In this dissertation, BER and ACC performance of interference-limited dual-hop decode-and-forward (DF) relay- ing cooperative systems with co-channel interference (CCI) at both the relay and destination nodes is analyzed in small-scale multipath Nakagami-m fading channels with arbitrary (integer as well as non-integer) values of m. This channel condition is assumed for both the desired signal as well as co-channel interfering signals. In addition, the practical case of unequal average fading powers between the two hops is assumed in the analysis. The analysis assumes an arbitrary number of indepen- dent and non-identically distributed (i.n.i.d.) interfering signals at both relay (R) and destination (D) nodes. Also, the work extended to the case when the receiver employs the maximum ratio combining (MRC) and the equal gain combining (EGC) schemes to exploit the diversity gain

Low-Complexity Algorithms for Channel Estimation in Optimised Pilot-Assisted Wireless OFDM Systems

Orthogonal frequency division multiplexing (OFDM) has recently become a dominant transmission technology considered for the next generation fixed and mobile broadband wireless communication systems. OFDM has an advantage of lessening the severe effects of the frequency-selective (multipath) fading due to the band splitting into relatively flat fading subchannels, and allows for low-complexity transceiver implementation based on the fast Fourier transform algorithms. Combining OFDM modulation with multilevel frequency-domain symbol mapping (e.g., QAM) and spatial multiplexing (SM) over the multiple-input multiple-output (MIMO) channels, can theoretically achieve near Shannon capacity of the communication link. However, the high-rate and spectrumefficient system implementation requires coherent detection at the receiving end that is possible only when accurate channel state information (CSI) is available. Since in practice, the response of the wireless channel is unknown and is subject to random variation with time, the receiver typically employs a channel estimator for CSI acquisition. The channel response information retrieved by the estimator is then used by the data detector and can also be fed back to the transmitter by means of in-band or out-of-band signalling, so the latter could adapt power loading, modulation and coding parameters according to the channel conditions. Thus, design of an accurate and robust channel estimator is a crucial requirement for reliable communication through the channel, which is selective in time and frequency. In a MIMO configuration, a separate channel estimator has to be associated with each transmit/receive antenna pair, making the estimation algorithm complexity a primary concern. Pilot-assisted methods, relying on the insertion of reference symbols in certain frequencies and time slots, have been found attractive for identification of the doubly-selective radio channels from both the complexity and performance standpoint. In this dissertation, a family of the reduced-complexity estimators for the single and multiple-antenna OFDM systems is developed. The estimators are based on the transform-domain processing and have the same order of computational complexity, irrespective of the number of pilot subcarriers and their positioning. The common estimator structure represents a cascade of successive small-dimension filtering modules. The number of modules, as well as their order inside the cascade, is determined by the class of the estimator (one or two-dimensional) and availability of the channel statistics (correlation and signal-to-noise power ratio). For fine precision estimation in the multipath channels with statistics not known a priori, we propose recursive design of the filtering modules. Simulation results show that in the steady state, performance of the recursive estimators approaches that of their theoretical counterparts, which are optimal in the minimum mean square error (MMSE) sense. In contrast to the majority of the channel estimators developed so far, our modular-type architectures are suitable for the reconfigurable OFDM transceivers where the actual channel conditions influence the decision of what class of filtering algorithm to use, and how to allot pilot subcarrier positions in the band. In the pilot-assisted transmissions, channel estimation and detection are performed separately from each other over the distinct subcarrier sets. The estimator output is used only to construct the detector transform, but not as the detector input. Since performance of both channel estimation and detection depends on the signal-to-noise power vi ratio (SNR) at the corresponding subcarriers, there is a dilemma of the optimal power allocation between the data and the pilot symbols as these are conflicting requirements under the total transmit power constraint. The problem is exacerbated by the variety of channel estimators. Each kind of estimation algorithm is characterised by its own SNR gain, which in general can vary depending on the channel correlation. In this dissertation, we optimise pilot-data power allocation for the case of developed low-complexity one and two-dimensional MMSE channel estimators. The resultant contribution is manifested by the closed-form analytical expressions of the upper bound (suboptimal approximate value) on the optimal pilot-to-data power ratio (PDR) as a function of a number of design parameters (number of subcarriers, number of pilots, number of transmit antennas, effective order of the channel model, maximum Doppler shift, SNR, etc.). The resultant PDR equations can be applied to the MIMO-OFDM systems with arbitrary arrangement of the pilot subcarriers, operating in an arbitrary multipath fading channel. These properties and relatively simple functional representation of the derived analytical PDR expressions are designated to alleviate the challenging task of on-the-fly optimisation of the adaptive SM-MIMO-OFDM system, which is capable of adjusting transmit signal configuration (e.g., block length, number of pilot subcarriers or antennas) according to the established channel conditions

Doctor of Philosophy

dissertationThe continuous growth of wireless communication use has largely exhausted the limited spectrum available. Methods to improve spectral efficiency are in high demand and will continue to be for the foreseeable future. Several technologies have the potential to make large improvements to spectral efficiency and the total capacity of networks including massive multiple-input multiple-output (MIMO), cognitive radio, and spatial-multiplexing MIMO. Of these, spatial-multiplexing MIMO has the largest near-term potential as it has already been adopted in the WiFi, WiMAX, and LTE standards. Although transmitting independent MIMO streams is cheap and easy, with a mere linear increase in cost with streams, receiving MIMO is difficult since the optimal methods have exponentially increasing cost and power consumption. Suboptimal MIMO detectors such as K-Best have a drastically reduced complexity compared to optimal methods but still have an undesirable exponentially increasing cost with data-rate. The Markov Chain Monte Carlo (MCMC) detector has been proposed as a near-optimal method with polynomial cost, but it has a history of unusual performance issues which have hindered its adoption. In this dissertation, we introduce a revised derivation of the bitwise MCMC MIMO detector. The new approach resolves the previously reported high SNR stalling problem of MCMC without the need for hybridization with another detector method or adding heuristic temperature scaling terms. Another common problem with MCMC algorithms is an unknown convergence time making predictable fixed-length implementations problematic. When an insufficient number of iterations is used on a slowly converging example, the output LLRs can be unstable and overconfident, therefore, we develop a method to identify rare, slowly converging runs and mitigate their degrading effects on the soft-output information. This improves forward-error-correcting code performance and removes a symptomatic error floor in bit-error-rates. Next, pseudo-convergence is identified with a novel way to visualize the internal behavior of the Gibbs sampler. An effective and efficient pseudo-convergence detection and escape strategy is suggested. Finally, the new excited MCMC (X-MCMC) detector is shown to have near maximum-a-posteriori (MAP) performance even with challenging, realistic, highly-correlated channels at the maximum MIMO sizes and modulation rates supported by the 802.11ac WiFi specification, 8x8 256 QAM. Further, the new excited MCMC (X-MCMC) detector is demonstrated on an 8-antenna MIMO testbed with the 802.11ac WiFi protocol, confirming its high performance. Finally, a VLSI implementation of the X-MCMC detector is presented which retains the near-optimal performance of the floating-point algorithm while having one of the lowest complexities found in the near-optimal MIMO detector literature