Space Time Block Codes With Low Maximum Likelihood Decoding Complexity
Download Space Time Block Codes With Low Maximum Likelihood Decoding Complexity full books in PDF, epub, and Kindle. Read online free Space Time Block Codes With Low Maximum Likelihood Decoding Complexity ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Mohanned Omar Sinnokrot |
| Publisher | : |
| Total Pages | : |
| Release | : 2009 |
| Genre | : Algorithms |
| ISBN | : |
In this thesis, we consider the problem of designing space-time block codes that have low maximum-likelihood (ML) decoding complexity. We present a unified framework for determining the worst-case ML decoding complexity of space-time block codes. We use this framework to not only determine the worst-case ML decoding complexity of our own constructions, but also to show that some popular constructions of space-time block codes have lower ML decoding complexity than was previously known. Recognizing the practical importance of the two transmit and two receive antenna system, we propose the asymmetric golden code, which is designed specifically for low ML decoding complexity. The asymmetric golden code has the lowest decoding complexity compared to previous constructions of space-time codes, regardless of whether the channel varies with time. We also propose the embedded orthogonal space-time codes, which is a family of codes for an arbitrary number of antennas, and for any rate up to half the number of antennas. The family of embedded orthogonal space-time codes is the first general framework for the construction of space-time codes with low-complexity decoding, not only for rate one, but for any rate up to half the number of transmit antennas. Simulation results for up to six transmit antennas show that the embedded orthogonal space-time codes are simultaneously lower in complexity and lower in error probability when compared to some of the most important constructions of space-time block codes with the same number of antennas and the same rate larger than one. Having considered the design of space-time block codes with low ML decoding complexity on the transmitter side, we also develop efficient algorithms for ML decoding for the golden code, the asymmetric golden code and the embedded orthogonal space-time block codes on the receiver side. Simulations of the bit-error rate performance and decoding complexity of the asymmetric golden code and embedded orthogonal codes are used to demonstrate their attractive performance-complexity tradeoff.
| Author | : Jeff Leuschner |
| Publisher | : |
| Total Pages | : 162 |
| Release | : 2007 |
| Genre | : |
| ISBN | : |
Space-time block coding is a technique used to exploit diversity in a multiple-input multiple-output (MIMO) environment. Orthogonal space-time block codes (OSTBCs) are desirable because they can achieve full transmit diversity while maintaining a simple low-complexity maximum-likelihood (ML) decoding algorithm. However, OSTBCs are limited in their error performance. This has led to the development of more general linear space-time block codes, such as quasi-orthogonal space-time block codes (QOSTBCs). QOSTBCs offer better error performance, but their decoding complexity is a concern since it is no longer a linear function of the number of transmitted symbols. In this thesis, a new vectorization for linear STBCs is proposed that explicitly maintains the redundancy in the STBC transmission matrix. By expressing the ML metric using the new vectorization, a new generic representation of the ML metric expression for a linear STBC is derived. One immediate application of this new metric expression is the convenient partial decoupling and simplification of the detection metric for linear STBCs. The new metric expression can also be used as a design tool to help in the construction of new STBCs with low decoding complexity. As an example, a new QOSTBC is constructed that has lower decoding complexity than one previously proposed in the literature of equal rate and diversity. A comparison is conducted to answer the following question: for the family of QOSTBCs, when is it best to perform an exhaustive search using a metric expression that is simplified and decoupled as much as possible, and when should an efficient implementation of the sphere decoding algorithm be applied? Determining this boundary is an important and practical issue not yet directly addressed in the literature. The new metric expression can also be used as the framework for a new family of sub-optimal decoding algorithms for STBCs that trade-off error performance for a reduction in decoding complexity. A practical example of such an algorithm is given as an example.
| Author | : Yong Liang Guan |
| Publisher | : World Scientific |
| Total Pages | : 209 |
| Release | : 2007-11-19 |
| Genre | : Technology & Engineering |
| ISBN | : 1908979100 |
Quasi-Orthogonal Space-Time Block Code presents an up-to-date, comprehensive and in-depth discussion of an important emerging class of space-time codes, called the Quasi-Orthogonal STBC (QO-STBC). Used in Multiple-Input Multiple-Output (MIMO) communication systems, they provide transmit diversity with higher code rates than the well-known orthogonal STBC (O-STBC), yet at lower decoding complexity than non-orthogonal STBC. This book will help readers gain a broad understanding of the fundamental principles as well as the state-of-the-art work in QO-STBC, thus enabling them to appreciate the roles of QO-STBC in future broadband wireless systems and to inspire further research./a
| Author | : Hamid Jafarkhani |
| Publisher | : Cambridge University Press |
| Total Pages | : 320 |
| Release | : 2005-09-22 |
| Genre | : Technology & Engineering |
| ISBN | : 1139444441 |
This book covers the fundamental principles of space-time coding for wireless communications over multiple-input multiple-output (MIMO) channels, and sets out practical coding methods for achieving the performance improvements predicted by the theory. Starting with background material on wireless communications and the capacity of MIMO channels, the book then reviews design criteria for space-time codes. A detailed treatment of the theory behind space-time block codes then leads on to an in-depth discussion of space-time trellis codes. The book continues with discussion of differential space-time modulation, BLAST and some other space-time processing methods and the final chapter addresses additional topics in space-time coding. The theory and practice sections can be used independently of each other. Written by one of the inventors of space-time block coding, this book is ideal for a graduate student familiar with the basics of digital communications, and for engineers implementing the theory in real systems.
| Author | : Ming-Yang Chen |
| Publisher | : |
| Total Pages | : |
| Release | : 2011 |
| Genre | : |
| ISBN | : |
Multiple-input multiple-output (MIMO) wireless systems provide tremendous throughput and reliability gains by utilizing multiple antennas at the transmitters and receivers. As a result, numerous papers have addressed communication and signal-processing topics like space-time code design and signal detection theory. However, today's industry still faces problems with integrating MIMO into products owing to the implementation complexity. Management of complexity is therefore essential to realize the promise of MIMO technology. Previous research on designing space-time block codes was mostly concerned with maximizing transmit diversity and coding gains, and with achieving the optimal diversity-multiplexing trade-off. In contrast, this thesis aims at designing new transmission strategies that can be efficiently decoded while retaining or approaching the optimal performance. The first part of this thesis proposes a new set of rate-1 space-time block codes in systems with 2^n-transmit antennas. These designs achieve the full spatial diversity in quadrature amplitude modulation (QAM). Furthermore, the column vectors of each code matrix can be partitioned into two classes such that any two vectors from different classes are orthogonal. As a result, the maximum-likelihood (ML) detection can be implemented in reduced time complexity. For a system with four transmit antennas, the proposed encoders attain the optimal bit error rate (BER) in QAM without the necessity of extra modulation. These results will be extended to new rate-1 codes employing four transmit antennas for which the ML detection can be determined in linear time. These codes similarly achieve the full diversity in QAM, and moreover in 4M-phase-shift keying (4M-PSK), while the corresponding ML detection can be accomplished by independently decoding each symbol. The reduction in detection complexity simply necessitates an increment of 0.21 dB in the signal-to-noise ratio (SNR) for sustaining the same BER.
| Author | : Victor Beresnevich |
| Publisher | : Springer Nature |
| Total Pages | : 281 |
| Release | : 2021-01-08 |
| Genre | : Technology & Engineering |
| ISBN | : 3030613038 |
This volume explores the rich interplay between number theory and wireless communications, reviewing the surprisingly deep connections between these fields and presenting new research directions to inspire future research. The contributions of this volume stem from the Workshop on Interactions between Number Theory and Wireless Communication held at the University of York in 2016. The chapters, written by leading experts in their respective fields, provide direct overviews of highly exciting current research developments. The topics discussed include metric Diophantine approximation, geometry of numbers, homogeneous dynamics, algebraic lattices and codes, network and channel coding, and interference alignment. The book is edited by experts working in number theory and communication theory. It thus provides unique insight into key concepts, cutting-edge results, and modern techniques that play an essential role in contemporary research. Great effort has been made to present the material in a manner that is accessible to new researchers, including PhD students. The book will also be essential reading for established researchers working in number theory or wireless communications looking to broaden their outlook and contribute to this emerging interdisciplinary area.
| Author | : National Aeronautics and Space Adm Nasa |
| Publisher | : Independently Published |
| Total Pages | : 26 |
| Release | : 2018-10-18 |
| Genre | : Science |
| ISBN | : 9781728906683 |
For long linear block codes, maximum likelihood decoding based on full code trellises would be very hard to implement if not impossible. In this case, we may wish to trade error performance for the reduction in decoding complexity. Sub-optimum soft-decision decoding of a linear block code based on a low-weight sub-trellis can be devised to provide an effective trade-off between error performance and decoding complexity. This chapter presents such a suboptimal decoding algorithm for linear block codes. This decoding algorithm is iterative in nature and based on an optimality test. It has the following important features: (1) a simple method to generate a sequence of candidate code-words, one at a time, for test; (2) a sufficient condition for testing a candidate code-word for optimality; and (3) a low-weight sub-trellis search for finding the most likely (ML) code-word. Lin, Shu and Fossorier, Marc Goddard Space Flight Center NAG5-931; NAG5-2938
| Author | : Avik Sengupta |
| Publisher | : |
| Total Pages | : |
| Release | : 2012 |
| Genre | : |
| ISBN | : |
Space-time coding (STC) schemes for Multiple Input Multiple Output (MIMO) systems have been an area of active research in the past decade. In this thesis, we propose a novel design of Space-Time Block Codes (STBCs) using Redundant Residue Number System (RRNS) codes, which are ideal for high data rate communication systems. Application of RRNS as a concatenated STC scheme to a MIMO wireless communication system is the main motivation for this work. We have optimized the link between residues and complex constellations by incorporating the "Direct Mapping" scheme, where residues are mapped directly to Gray coded constellations. Knowledge of apriori probabilities of residues is utilized to implement a probability based "Distance-Aware Direct Mapping" (DA) scheme, which uses a set-partitioning approach to map the most probable residues such that they are separated by the maximum possible distance. We have proposed an "Indirect Mapping" scheme, where we convert the residues back to bits before mapping them. We have also proposed an adaptive demapping scheme which utilizes the RRNS code structure to reduce the ML decoding complexity and improve the error performance. We quantify the upper bounds on codeword and bit error probabilities of both Systematic and Non-systematic RRNS-STBC and characterize the achievable coding and diversity gains assuming maximum likelihood decoding (MLD). Simulation results demonstrate that the DA Mapping scheme provides performance gain relative to a Gray coded direct mapping scheme. We show that Systematic RRNS-STBC codes provide superior performance compared to Nonsystematic RRNS-STBC, for the same code parameters, owing to more efficient binary to residue mapping. When compared to other concatenated STBC and Orthogonal STBC (OSTBC) schemes, the proposed system gives better performance at low SNRs.
| Author | : National Aeronautics and Space Administration (NASA) |
| Publisher | : Createspace Independent Publishing Platform |
| Total Pages | : 24 |
| Release | : 2018-07-15 |
| Genre | : |
| ISBN | : 9781722916640 |
For long linear block codes, maximum likelihood decoding based on full code trellises would be very hard to implement if not impossible. In this case, we may wish to trade error performance for the reduction in decoding complexity. Sub-optimum soft-decision decoding of a linear block code based on a low-weight sub-trellis can be devised to provide an effective trade-off between error performance and decoding complexity. This chapter presents such a suboptimal decoding algorithm for linear block codes. This decoding algorithm is iterative in nature and based on an optimality test. It has the following important features: (1) a simple method to generate a sequence of candidate code-words, one at a time, for test; (2) a sufficient condition for testing a candidate code-word for optimality; and (3) a low-weight sub-trellis search for finding the most likely (ML) code-word. Lin, Shu and Fossorier, Marc Goddard Space Flight Center NAG5-931; NAG5-2938...
| Author | : Min Zhang |
| Publisher | : |
| Total Pages | : 252 |
| Release | : 2010 |
| Genre | : MIMO systems |
| ISBN | : |
In this thesis the use of space-frequency block codes (SFBC) and space-time-frequency block codes (STFBC) in wireless systems are investigated. A variety of SFBC and STFBC schemes are proposed for particular propagation scenarios and system settings where each has its own advantages and disadvantages. The objective is to pro-pose coding strategies with improved flexibility, feasibility and spectral efficiency,and reduce the decoding complexity in an MIMO-OFDM system.
