Quasi-orthogonal Space-time Block Code

Quasi-orthogonal Space-time Block Code
Author: Chau Yuen
Publisher: Imperial College Press
Total Pages: 209
Release: 2007
Genre: Computers
ISBN: 1860948693

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. Sample Chapter(s). Foreword (151 KB). Chapter 1: Introduction of MIMO Channel and Space-Time Block Code (703 KB). Contents: Introduction of MIMO Channel and Space-Time Block Code; Orthogonal and Quasi- Orthogonal Space-Time Block Code; Insights of QO-STBC; Quasi-Orthogonal Space-Time Block Code with Minimum Decoding Complexity; Differential QO-STBC; Rate, Complexity and Diversity Trade-Off in QO-STBC; Other Developments and Applications of QO-STBC. Readership: Academics and graduate-level research students and developers of next-generation wireless systems.

Space-Time Coding

Space-Time Coding
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.

Performance Analysis and Design of Space-time Codes

Performance Analysis and Design of Space-time Codes
Author: Chen Liao
Publisher:
Total Pages:
Release: 2006
Genre: Electrical engineering and electronics
ISBN: 9780542979873

Wireless communication technologies have evolved from the original analog networks to IP-based network. Today's wireless communications have been affected by increasing customer expectations on wireless wideband internet services and continuously evolving improvements on technologies. Wireless communication systems must increase their ability to respond to the challenges. The new generation wireless systems (3G/4G) are designed for this purpose. The notable characteristic of 3G/4G is that it provides high data rate transmission at data rate up to 348kbps/2Mbps for 3G and 100Mbps/1Gbps for 4G. Designing the system for such high data rate transmission has become very challenging for wireless systems where the multipath fading is an important factor. In recent years, researches are ongoing in the industry and academic to increase capacity performance of wireless systems through antenna diversity. Multiple Input Multiple Output (MIMO) is one of the major recent developments in the study of high data rate transmission. There has been considerable attention paid to remarkable performance improvements in MIMO in terms of capacity. Another technology that has been traditionally adopted for wireless communications is the channel coding. Combining MIMO with channel coding has received increasing interest to support a variety of high data rate applications. These schemes have been termed as "space-time codes". Space-time codes are currently an area of exciting activity and have been studied as promising candidates for future 3G/4G systems. The most important characteristic of space-time codes is that it can provide full diversity gain as well as coding gain. In this dissertation, both performance analysis of upper bound of Pair-Wise Error Probability (PEP) and exact PEP are performed. In the derivation of exact PEP, a new method is presented. The method is straightforward and comprehensible. The upper bound provides the insight to understand the performance behavior for high Signal-to-Noise Ratio (SNR), while the exact PEP provides a better understanding of the performance behavior to other range of SNR. Design criteria for space-time codes had been first developed by Tarokh, which utilize the analysis of the upper bound on PEP to maximize diversity gain and coding gain from the property of the codeword distance matrix. These criteria are the most widely accepted, which form the basis for space-time codes. The criteria assume that the performance of space-time codes is dominated by the dominant error events. However, there are no dominant error events in fading channel for space-time codes. Therefore, Tarokh's criteria do not provide design guideline for the coding gain. Union bound analysis offers a alternative solution to this problem. The union bound technique is a more attractive method that allows us to analyze the contribution of all error events to the performance. In this thesis, the performance of space-time codes are analyzed using union bound analysis. Based on the union bound on Frame Error Rate (FER), new design criteria are proposed. This is achieved by applying more accurate upper bound of PEP in the union bound analysis. With the proposed criteria, new coding gain performance metrics had been defined. New codes based on the new performance metrics are designed and their coding gain performance superiority are demonstrated. Space-time block codes have been initially designed to provide full diversity order with low decoding complexity, but without coding gain. By integrating space-time trellis codes with space-time block codes, super-orthogonal space-time trellis codes can significantly enhance the coding gain performance. However, the super-orthogonal space-time trellis codes improve performance only in slow fading channel, but do not perform well in fast fading channel. In fast fading channel, the orthogonal design of space-time block codes has little effect on the coding gain and does not lead to noticeable improvement. Furthermore, super-orthogonal space-time trellis codes introduce the diversity gain loss in fast fading channel. It is well known that the performances of space-time codes are dominated by diversity gain and any diversity gain loss may cause substantial loss in performance. We therefore develop orthogonal space-time trellis codes, which improve performance in diversity gain in fast fading channel. The improvement is achieved by transferring the vector output of space-time trellis codes into an orthogonal matrix of space-time block codes, and meanwhile maintaining the symbol Hamming distance of space-time trellis codes. Theoretical analysis and simulation results had demonstrated that the proposed codes can improve diversity gain linearly with an increase in the number of transmit antennas. Performance saturation and decoding complexity increase with the increased number of trellis states are the major problems that trellis-based codes have to face in practice. Turbo codes that allow for reaching near Shannon limit performance are a significant advance in digital communications. Space-time turbo codes have been developed to achieve high performance. In a perfect world, system designers would like to achieve high performance while maintaining a full code rate. Therefore, puncture operation is always used in space-time turbo codes. The problem with the puncture operation in space-time turbo codes is that codeword distance matrix is rank deficient for small diversity gain in slow fading channel, which constitutes a major problem with space-time turbo codes. Space-time turbo codes that concern the rank deficiency have been developed. The codes improve performance by reducing the effect of rank deficiency on performance, but exist high complexity in both code structure and design criteria. This limitation makes the codes not suitable for the design of complex codes with large trellis state and/or large numbers of transmit antennas. A new space-time turbo codes have been proposed in this research. In previous works, it has been demonstrated the systematic structure with the rotation of the output of the low constitute encoder can effectively reduce the rank deficient effect on performance. Our new codes utilize the systematic characteristic to construct a simple code structure. Further, a simple but very effective trace criterion has been proposed. With the simple codes structure and design criteria, the design of complex codes can be achieved with significant improvement in coding gain performance for the systems with small diversity gain in slow fading channel. Overall, this dissertation presents new design criteria and new codes that contribute to improving performances of space-time codes.

Cyclic Division Algebras

Cyclic Division Algebras
Author: Frdrique Oggier
Publisher: Now Publishers Inc
Total Pages: 109
Release: 2007
Genre: Computers
ISBN: 1601980507

Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space-Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion, requires that the difference of any two distinct codewords has full rank. Extensive work has been done on Space-Time coding, aiming to attain fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space-Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. Cyclic Division Algebras: A Tool for Space-Time Coding provides a tutorial introduction to the algebraic tools involved in the design of codes based on division algebras. The different design criteria involved are illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property and the diversity multiplexing tradeoff. Finally complete mathematical background underlying the construction of the Golden code and the other Perfect Space-Time block codes is given. Cyclic Division Algebras: A Tool for Space-Time Coding is for students, researchers and professionals working on wireless communication systems.

Orthogonal Space-Time Block Code with Pulse Shaped Offset Qam

Orthogonal Space-Time Block Code with Pulse Shaped Offset Qam
Author: Kun Zhong
Publisher: LAP Lambert Academic Publishing
Total Pages: 116
Release: 2010-08
Genre:
ISBN: 9783838393452

Space-time block code (STBC) is a maturing technology to achieve transmit diversity over fading channels. As the number of transmit antennas increases beyond two, current approaches to design STBCs either make trade off between the achievable diversity gain and the code rate, or achieve both full diversity and full rate at the expense of exponentially increased decoder complexity. This book presents a new STBC design method that combines two real orthogonal STBCs (O-STBC) with offset QAM. This approach is able to achieve both full diversity and full code rate, yet allows simple real symbol wise decoding whose complexity is independent of the number of transmit antennas. This book provides a detailed analysis of the impact of key system parameters on the error performance of the scheme. A complete chapter is devoted to systematic design of the two real O-STBCs for optimal error performance. This book should be useful to any researcher who is in the field of MIMO communications, or any engineering professional who is looking for an effective STBC solution for practical implementation.

Space-time Block Codes with Low Maximum-likelihood Decoding Complexity

Space-time Block Codes with Low Maximum-likelihood Decoding Complexity
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.