Receiver Architectures for MIMO Wireless Communication Systems Based on V-BLAST and Sphere Decoding Algorithms


Book Description

Modern day technology aspires to always progress. This progression leads to a lot of research in any significant area of improvement. There is a growing amount of end-users in the wireless spectrum which has led to a need for improved bandwidth usage and BER values. In other words, new technologies which would increase the capacity of wireless systems are proving to be a crucial point of research in these modern times. Different combinations of multiuser receivers are evaluated to determine performance under normal working conditions by comparing their BER performance charts. Multiple input, multiple output (MIMO) systems are incorporated into the system to utilise the increased capacity rates achievable using the MIMO configuration. The effect of MIMO on the technologies associated with modern day technological standards such as CDMA and OFDM have been investigated due to the significant capacity potentials these technologies normally exhibit in a single antenna scenario. An in-depth comparison is established before comparison is made with a conventional maximum likelihood (ML) detector. The complexity of the ML detector makes its realization evaluated in such a manner to achieve the same or near ML solution but with lower computational complexity. This was achieved using a proposed modification of the Schnorr-Euchner Sphere decoding algorithm (SE-SDA). The proposed sphere decoder (P-SD) adopts a modification of the radius utilised in the SE-SDA to obtain a near ML solution at a much lower complexity compared to the conventional ML decoder. The P-SD was configured to work in different MIMO antenna configurations. The need for the highest possible data rates from the available limited spectrum led to my research into the multi-user detection scenario and MIMO.




Baseband Receiver Design for Wireless MIMO-OFDM Communications


Book Description

The Second Edition of OFDM Baseband Receiver Design for Wirless Communications, this book expands on the earlier edition with enhanced coverage of MIMO techniques, additional baseband algorithms, and more IC design examples. The authors cover the full range of OFDM technology, from theories and algorithms to architectures and circuits. The book gives a concise yet comprehensive look at digital communication fundamentals before explaining signal processing algorithms in receivers. The authors give detailed treatment of hardware issues - from architecture to IC implementation. Links OFDM and MIMO theory with hardware implementation Enables the reader to transfer communication received concepts into hardware; design wireless receivers with acceptable implemntation loss; achieve low-power designs Covers the latest standards, such as DVB-T2, WiMax, LTE and LTE-A Includes more baseband algorithms, like soft-decoding algorithms such as BCJR and SOVA Expanded treatment of channel models, detection algorithms and MIMO techniques Features concrete design examples of WiMAX systems and cognitive radio apllications Companion website with lecture slides for instructors Based on materials developed for a course in digital communication IC design, this book is ideal for graduate students and researchers in VLSI design, wireless communications, and communications signal processing. Practicing engineers working on algorithms or hardware for wireless communications devices will also find this to be a key reference.




Algorithms and VLSI Implementations of MIMO Detection


Book Description

This book provides a detailed overview of detection algorithms for multiple-input multiple-output (MIMO) communications systems focusing on their hardware realisation. The book begins by analysing the maximum likelihood detector, which provides the optimal bit error rate performance in an uncoded communications system. However, the maximum likelihood detector experiences a high complexity that scales exponentially with the number of antennas, which makes it impractical for real-time communications systems. The authors proceed to discuss lower-complexity detection algorithms such as zero-forcing, sphere decoding, and the K-best algorithm, with the aid of detailed algorithmic analysis and several MATLAB code examples. Furthermore, different design examples of MIMO detection algorithms and their hardware implementation results are presented and discussed. Finally, an ASIC design flow for implementing MIMO detection algorithms in hardware is provided, including the system simulation and modelling steps and register transfer level modelling using hardware description languages. Provides an overview of MIMO detection algorithms and discusses their corresponding hardware implementations in detail; Highlights architectural considerations of MIMO detectors in achieving low power consumption and high throughput; Discusses design tradeoffs that will guide readers’ efforts when implementing MIMO algorithms in hardware; Describes a broad range of implementations of different MIMO detectors, enabling readers to make informed design decisions based on their application requirements.




Space-time Code Designs and Fast Decoding for MIMO and Cooperative Communication Systems


Book Description

Space-time coding is an attractive technique to exploit the transmit diversity gain provided by a multiple-input multiple-output (MIMO) wireless system. Regarding a space-time code design, some important concerns are high rates, full diversity, large coding gain (diversity products) and low decoding complexity. However, a tradeoff exists among these goals and constructing a good code that optimizes some or all of these goals is a very practical and interesting problem that has attracted a lot of attention in the past 10 years. Furthermore, other design issues may also matter and should be taken into account when one considers certain special scenarios to which the space-time coding technique is applied. In this dissertation, we study both the code design at the transmitter side and the fast decoding algorithm at the receiver side for space-time coding. The first topic attempts to achieve both low decoding overhead and maximum (full) diversity for space-time block codes (STBC). By deploying a linear detector at the receiver, we can efficiently reduce the decoding complexity for an STBC and always obtain soft outputs that are desired when the STBC is concatenated with a channel code as in a real system. In this dissertation, we propose a design criterion for STBC to achieve full diversity with a zero-forcing (ZF) or minimum mean-square error (MMSE) receiver. Two families of STBC, orthogonal STBC (OSTBC) and Toeplitz codes, which are known to have full diversity with ZF or MMSE receiver, indeed meet this criterion, as one may expect. We also show that the symbol rates of STBC under this criterion are upper bounded by 1. Subsequently, we propose a novel family of STBC that satisfy the criterion and thus achieve full diversity with ZF or MMSE receiver. Our newly proposed STBC are constructed by overlapping the 2 x 2 Alamouti code and hence are named overlapped Alamouti codes. The new codes are close to orthogonal and have asymptotically optimal symbol rates. Simulation results show that overlapped Alamouti codes significantly outperform Toeplitz codes for any number of transmit antennas and also outperform OSTBC when the number of transmit antennas is above 4. The second topic concerns the design of space-time trellis codes (STTC) for their applications in cooperative communication systems, where transmission among different relay nodes that cooperate with each other is essentially asynchronous. A family of STTC that can achieve full cooperative diversity order regardless of the node transmission delays has been proposed and it was shown that the construction of this STTC family can be reduced to the design of binary matrices that can keep full row rank no matter how their rows are shifted. We call such matrices as shift-full-rank (SFR) matrices. We propose a systematic method to construct all the SFR matrices and, in particular, the shortest (square) SFR (SSFR) matrices that are attractive as the associated STTC require the fewest memories and hence the lowest decoding complexity. By relaxing the restriction imposed on SFR matrices, we also propose two matrix variations, q -SFR and LT-SFR matrices. In an extended cooperative system model with fractional symbol delays whose maximum value is specified, the STTC generated from q -SFR and LT-SFR matrices can still achieve asynchronous full diversity. As a result, more eligible generator matrices than SFR ones become available and some better STTC in terms of coding gain may be found. Finally, the third topic is to speed up the decoding algorithm for the vertical Bell Laboratories layered space-time (V-BLAST) scheme, a full rate STBC that however does not exploit any transmit diversity gain. A fast recursive algorithm for V-BLAST with the optimal ordered successive interference cancellation (SIC) detection has been proposed and two improved algorithms for it have also been independently introduced by different authors lately. We first incorporate the existing improvements into the original fast recursive algorithm to give an algorithm that is the fastest known one for the optimal SIC detection of V-BLAST. Then, we propose a further improvement from which two new algorithms result. Relative to the fastest known one from the existing improvements, one new algorithm has a speedup of 1:3 times in both the number of multiplications and the number of additions, and the other new algorithm requires less memory storage.




Robust Multiple-input Multiple-output Communications


Book Description

"Multiple antennas at both the transmitter and receiver is known as multiple-input multiple-output (MIMO) system. This has emerged as the most promising technique for improving the performance of wireless digital transmission systems as well as allowing higher data rates to be obtained for a given bandwidth. A consequence of the MIMO wireless communications revolution is that multipath scattering of the transmitted signal has moved from being a problem to being a valuable resource. This has happened to such extent that MIMO systems have come to rely on this resource. However, away from dense urban and indoor environments such as Australian rural and remote areas with wide open spaces and flat or smooth undulating terrain such rich scattering can be hard to find. This research seeks to develop MIMO schemes which will give robust and reliable perfor?mance in environments that can change rapidly from rich scattering environment to clear line of sight between transmitter and receiver. Wireless communications system which are robust to changing environment conditions are a particular important factor in military communication systems as well as for civilian emergency services. In this work, polarization is proposed as a source of diversity in wireless communications. Polarization diversity is particularly suited to the Australian rural and remote environment where wide open spaces and flat or smooth undulating terrain give rise to line of sight conditions between the transmitter and the receiver. The polarization diversity of transmitted signals is mostly preserved by the line-of-sight environment, presenting an opportunity for transmitter and receiver diversity techniques. Another aspect of the research presented here is the development of fast, fixed complexity, decoding algorithms for space-time codes that are robust to the changing transmission conditions. Reliable high rate transmission over the MIMO system can only be achieved through "space-time coding". The major drawback of a number of potentially useful space-time codes is the high computational complexity of the known decoding algorithms. This is particular true for a number of codes which are best suited to the exploitation of polarization diversity. The existing "fast" decoding algorithm for this decoding problem, the so-called sphere decoder, has performance which depends crucially on the channel conditions. When the channel is close to singular, that is, when the channel between the base station and terminal is close to pure line-of-sight, the sphere decoder defaults to an exhaustive search. If such conditions persist the communication system could be in outage purely due to computational overload. In this project we develop fast decoding algorithms which have fixed complexity across all channel conditions. In particular, we present the fastest known fixed complexity decoding algorithm for the Golden code, an important code used in the WiMax standard for fully mobile internet access"--P. iii.







Digital Communication Receiver Algorithms and Architectures for Reduced Complexity and High Throughput


Book Description

In this dissertation, efficient receiver algorithms and architectures for digital communications are studied. As the demand for higher data communication rate increases, the dimension of communication systems is rapidly growing, thereby requiring computationally efficient detection and decoding algorithms in the receiver. Hence, it is crucial to develop receiver algorithms that can offer good performance-complexity trade-offs in high dimensional communication systems such as multi-input multi-output (MIMO) systems and systems with a large delay spread. In this dissertation, computationally efficient receiver algorithms and low-power implementation of receiver architectures are investigated. First, a low-complexity near maximum-likelihood (ML) detector, called the reduced-dimension ML search (RD-MLS), is proposed. The main idea of the RD-MLS is based on reduction of search space dimension. That is, a solution is searched over a subset of symbols to reduce the search complexity. In order to minimize the inevitable performance loss due to the search space reduction, a list tree search (LTS) algorithm is employed, which finds the best K candidates over the reduced search space. A final solution is chosen among the K candidates after extension to the full dimension via an MMSE decision-feedback (MMSE-DF) detector. To determine the candidate size, K adaptively, a stopping criterion is incorporated into the LTS. Through computer simulations, we demonstrate that the RD-MLS algorithm achieves significant complexity reduction over the existing near ML detectors while limiting performance loss to within one dB from ML detection. Second, a low complexity MIMO tree detector, called the improved soft-input soft-output M-algorithm (ISS-MA), is presented. The proposed detector is developed for iterative detection and decoding (IDD) systems, which are known to achieve near-optimal detection performance for MIMO channels. In order to improve the performance of tree detection, a look-ahead path metric is employed that accounts for the impact of unvisited paths of the tree via an unconstrained linear MMSE estimator. Based on an analysis of the probability of correct path loss, we show that the improved path metric offers better detection performance than the conventional path metric. We also demonstrate through simulations that the ISS-MA provides a better performance-complexity trade-off than existing soft-input soft-output detection algorithms. Third, a computationally efficient turbo equalization algorithm for underwater acoustic communications is studied. The performances of two popular linear turbo equalizers, a channel estimate-based minimum mean square error TEQ (CE-based MMSE-TEQ) and a direct-adaptive TEQ (DA-TEQ) technique, are compared in the presence of channel estimation errors and adjustment errors of a least mean square (LMS) adaptive algorithm. Next, an underwater receiver architecture built upon the LMS DA-TEQ technique is introduced. To maintain a performance gains over time-varying channels, the convergence speed of the LMS algorithm is improved via two methods: (1) data reusing and gear-shifting LMS and (2) reducing the length of the equalizer by capturing the sparse structure of underwater acoustic channels. In addition, the sparse structure resulting from the underwater channel can be exploited to reduce the complexity of the equalizer and mitigate error propagation. Receiver performance for different modulation orders, channel codes, and hydrophone configurations was examined at a variety of distances, up to 1 km, from the transmitters. Experimental results show great promise for this approach, as data rates in excess of 15 kbit/s could readily be achieved without error. Lastly, an energy efficient estimation and detection problem is formulated for low-power digital filtering. Building on the soft digital signal processing technique that combines algorithmic noise tolerance and voltage scaling to reduce power, a minimum power soft error cancellation (MP-SEC) technique detects, estimates and corrects transient errors that arise from voltage over-scaling. These timing violation-induced errors, called soft errors, can be detected and corrected by exploiting the correlation structure induced by the filtering operation being protected, together with a reduced-precision replica of the protected operation. By exploiting a spacing property of soft errors in certain architectures, MP-SEC can achieve up to 30 % power savings with no SNR loss and up to 55 % power savings with less than 1 dB SNR loss, according to logic-level simulations performed for an example 25-tap frequency-selective filter.




Enabling Technologies for Next Generation Wireless Communications


Book Description

Enabling Technologies for Next Generation Wireless Communications provides up-to-date information on emerging trends in wireless systems, their enabling technologies and their evolving application paradigms. This book includes the latest trends and developments toward next generation wireless communications. It highlights the requirements of next generation wireless systems, limitations of existing technologies in delivering those requirements and the need to develop radical new technologies. It focuses on bringing together information on various technological developments that are enablers vital to fulfilling the requirements of future wireless communication systems and their applications. Topics discussed include spectrum issues, network planning, signal processing, transmitter, receiver, antenna technologies, channel coding, security and application of machine learning and deep learning for wireless communication systems. The book also provides information on enabling business models for future wireless systems. This book is useful as a resource for researchers and practitioners worldwide, including industry practitioners, technologists, policy decision-makers, academicians, and graduate students.




Large MIMO Systems


Book Description

Large MIMO systems, with tens to hundreds of antennas, are a promising emerging communication technology. This book provides a unique overview of this technology, covering the opportunities, engineering challenges, solutions and state of the art of large MIMO test beds. There is in-depth coverage of algorithms for large MIMO signal processing, based on meta-heuristics, belief propagation and Monte Carlo sampling techniques, and suited for large MIMO signal detection, precoding and LDPC code designs. The book also covers the training requirement and channel estimation approaches in large-scale point-to-point and multi-user MIMO systems; spatial modulation is also included. Issues like pilot contamination and base station cooperation in multi-cell operation are addressed. A detailed exposition of MIMO channel models, large MIMO channel sounding measurements in the past and present, and large MIMO test beds is also presented. An ideal resource for academic researchers, next generation wireless system designers and developers, and practitioners in wireless communications.