Full-diversity full-rate complex-field space-time coding
TL;DR: This work designs systems capable of achieving full-diversity and full-rate (FDFR), with any number of transmit- and receive-antennas, and develops FDFR designs not only for flat-fading but for frequency-selective, or, time- selective fading MIMO channels as well.
Abstract: Exciting developments in wireless multiantenna communications have led to designs aiming mainly at one of two objectives: either high-performance by enabling the diversity provided by multi-input multi-output (MIMO) channels or high-rates by capitalizing on space-time multiplexing gains to realize the high capacity of MIMO fading channels. By concatenating a linear complex-field coder (a.k.a. linear precoder) with a layered space-time mapper, we design systems capable of achieving both goals: full-diversity and full-rate (FDFR), with any number of transmit- and receive-antennas. We develop FDFR designs not only for flat-fading but for frequency-selective, or, time-selective fading MIMO channels as well. Furthermore, we establish the flexibility of our FDFR designs in striking desirable performance-rate-complexity tradeoffs. Our theoretical claims are confirmed by simulations.
Citations
More filters
TL;DR: This article provides an overview of the basics of MIMO-OFDM technology and focuses on space-frequency signaling, receiver design, multiuser systems, and hardware implementation aspects.
Abstract: Multiple-input multiple-output (MIMO) wireless technology in combination with orthogonal frequency division multiplexing (MIMO-OFDM) is an attractive air-interface solution for next-generation wireless local area networks (WLANs), wireless metropolitan area networks (WMANs), and fourth-generation mobile cellular wireless systems. This article provides an overview of the basics of MIMO-OFDM technology and focuses on space-frequency signaling, receiver design, multiuser systems, and hardware implementation aspects. We conclude with a discussion of relevant open areas for further research
376 citations
Cites methods from "Full-diversity full-rate complex-fi..."
...A framework for designing codes that achieve full rate and full diversity in frequency-selective fading multiantenna channels was proposed in [ 13 ]....
[...]
01 Jul 2006
TL;DR: In this article, the authors provide an extensive overview of the state-of-the-art in MIMO communications, ranging from its roots in antenna array processing to advanced cellular communication systems.
Abstract: One of the most promising technologies to resolve the bottlenecks in traffic capacity of future wireless networks is multiple-input multiple-output (MIMO) communications and space-time processing. MIMO wireless technology has progressed from the stage of fundamental research to commercially available products within a decade. With over sixty contributors from the field, this book provides an extensive overview of the state-of-the-art in MIMO communications, ranging from its roots in antenna array processing to advanced cellular communication systems. A balanced treatment of three key areas---information theory, algorithms and systems studies, and implementation issues---has been assembled by four editors with a broad range of academic and industry experience. This comprehensive reference will appeal to practitioners, researchers, and graduate students in wireless communications.
273 citations
Cites background from "Full-diversity full-rate complex-fi..."
...As another set of examples, [Damen et al., 2002; Ma and Giannakis, 2003] focus on using such codes to achieve the two end-points of the diversity-multiplexing frontier....
[...]
Book•
22 Jun 2009
TL;DR: TheWireless Channel and the Concept of Diversity, a Coherent Versus Differential Turbo Detection of Sphere-packing-aided Single-user MIMO Systems, and a Universal Approach to Space-Time Block Codes: A Universal Approach are reviewed.
Abstract: About the Authors. OtherWiley IEEE Press Books on Related Topics. Preface. Acknowledgments. 1 Problem Formulation, Objectives and Benefits. 1.1 TheWireless Channel and the Concept of Diversity. 1.2 Diversity and Multiplexing Trade-offs in Multi-functional MIMO Systems. 1.3 Coherent versus Non-coherent Detection for STBCs Using Co-located and Cooperative Antenna Elements. 1.4 Historical Perspective and State-of-the-Art Contributions. 1.5 Iterative Detection Schemes and their Convergence Analysis. 1.6 Outline and Novel Aspects of the Monograph. Part I Coherent Versus Differential Turbo Detection of Sphere-packing-aided Single-user MIMO Systems. List of Symbols in Part I. 2 Space-Time Block Code Design using Sphere Packing. 2.1 Introduction. 2.2 Design Criteria for Space-Time Signals. 2.3 Design Criteria for Time-correlated Fading Channels. 2.4 Orthogonal Space-Time Code Design using SP. 2.5 STBC-SP Performance. 2.6 Chapter Conclusions. 2.7 Chapter Summary. 3 Turbo Detection of Channel-coded STBC-SP Schemes. 3.1 Introduction. 3.2 System Overview. 3.3 Iterative Demapping. 3.4 Binary EXIT Chart Analysis. 3.5 Performance of Turbo-detected Bit-based STBC-SP Schemes. 3.6 Chapter Conclusions. 3.7 Chapter Summary. 4 Turbo Detection of Channel-coded DSTBC-SP Schemes. 4.1 Introduction. 4.2 Differential STBC using SP Modulation. 4.3 Bit-based RSC-coded Turbo-detected DSTBC-SP Scheme. 4.4 Chapter Conclusions. 4.5 Chapter Summary. 5 Three-stage Turbo-detected STBC-SP Schemes. 5.1 Introduction. 5.2 System Overview. 5.3 EXIT Chart Analysis. 5.4 Maximum Achievable Bandwidth Efficiency. 5.5 Performance of Three-stageTurbo-detected STBC-SP Schemes. 5.6 Chapter Conclusions. 5.7 Chapter Summary. 6 Symbol-based Channel-coded STBC-SP Schemes. 6.1 Introduction. 6.2 System Overview. 6.3 Symbol-based Iterative Decoding. 6.4 Non-binary EXIT Chart Analysis. 6.5 Performance of Bit-based and Symbol-based LDPC-coded STBC-SP Schemes. 6.6 Chapter Conclusions. 6.7 Chapter Summary. Part II Coherent Versus Differential Turbo Detection of Single-user and Cooperative MIMOs. List of Symbols in Part II. 7 Linear Dispersion Codes: An EXIT Chart Perspective. 7.1 Introduction and Outline. 7.2 Linear Dispersion Codes. 7.3 Link Between STBCs and LDCs. 7.4 EXIT-chart-based Design of LDCs. 7.5 EXIT-chart-based Design of IR-PLDCs. 7.6 Conclusion. 8 Differential Space-Time Block Codes: A Universal Approach. 8.1 Introduction and Outline. 8.2 System Model. 8.3 DOSTBCs. 8.4 DLDCs. 8.5 RSC-coded Precoder-aided DOSTBCs. 8.6 IRCC-coded Precoder-aided DLDCs. 8.7 Conclusion. 9 Cooperative Space-Time Block Codes. 9.1 Introduction and Outline. 9.2 Twin-layer CLDCs. 9.3 IRCC-coded Precoder-aided CLDCs. 9.4 Conclusion. Part III Differential Turbo Detection of Multi-functional MIMO-aided Multi-user and Cooperative Systems. List of Symbols in Part III. 10 Differential Space-Time Spreading. 10.1 Introduction. 10.2 DPSK. 10.3 DSTS Designusing Two Transmit Antennas. 10.4 DSTS Design Using Four Transmit Antennas. 10.5 Chapter Conclusions. 10.6 Chapter Summary. 11 Iterative Detection of Channel-coded DSTS Schemes. 11.1 Introduction. 11.2 Iterative Detection of RSC-coded DSTS Schemes. 11.3 Iterative Detection of RSC-coded and Unity-rate Precoded Four-antenna-aided DSTS-SP System. 11.4 Chapter Conclusions. 11.5 Chapter Summary. 12 Adaptive DSTS-assisted Iteratively Detected SP Modulation. 12.1 Introduction. 12.2 System Overview. 12.3 Adaptive DSTS-assisted SP Modulation. 12.4 VSF-based Adaptive Rate DSTS. 12.5 Variable-code-rate Iteratively Detected DSTS-SP System. 12.6 Results and Discussion. 12.7 Chapter Conclusion and Summary. 13 Layered Steered Space-Time Codes. 13.1 Introduction. 13.2 LSSTCs. 13.3 Capacity of LSSTCs. 13.4 Iterative Detection and EXIT Chart Analysis. 13.5 Results and Discussion. 13.6 Chapter Conclusions. 13.7 Chapter Summary. 14 DL LSSTS-aided Generalized MC DS-CDMA. 14.1 Introduction. 14.2 LSSTS-aided Generalized MCDS-CDMA. 14.3 Increasing the Number of Users by Employing TD and FD Spreading. 14.4 Iterative Detection and EXIT Chart Analysis. 14.5 Results and Discussion. 14.6 Chapter Conclusions. 14.7 Chapter Summary. 15 Distributed Turbo Coding. 15.1 Introduction. 15.2 Background of Cooperative Communications. 15.3 DTC. 15.4 Results and Discussion. 15.5 Chapter Conclusions. 15.6 Chapter Summary. 16 Conclusions and Future Research. 16.1 Summary and Conclusions. 16.2 Future Research Ideas. 16.3 Closing Remarks. A Gray Mapping and AGM Schemes for SP Modulation of Size L =16. B EXIT Charts of Various Bit-based Turbo-detected STBC-SP Schemes. C EXIT Charts of Various Bit-based Turbo-detected DSTBC-SP Schemes. D LDCs' / for QPSK Modulation. E DLDCs' / for 2PAM Modulation. F CLDCs' / 1 and / 2 for BPSK Modulation. G Weighting Coefficient Vectors e and a. H Gray Mapping and AGM Schemes for SP Modulation of Size L =16. Glossary. Bibliography. Index. Author Index.
204 citations
Cites background from "Full-diversity full-rate complex-fi..."
...(TVLT) codes [30] and those proposed in [320], possess many desirable features, they remain a subset of the LDC framework....
[...]
...With the aid of recent advances in high-rate full-diversity STBCs [28] [320] [334], it has been shown that it is not necessary to sacrifice rate in order to achieve diversity and vice versa....
[...]
TL;DR: It is shown that these substreams can be designed to obtain full diversity and full rate gain using feedback from the receiver to transmitter, and Monte Carlo simulations show substantial performance gains over beamforming and spatial multiplexing.
Abstract: Multiple-input multiple-output (MIMO) wireless systems obtain large diversity and capacity gains by employing multielement antenna arrays at both the transmitter and receiver. The theoretical performance benefits of MIMO systems, however, are irrelevant unless low error rate, spectrally efficient signaling techniques are found. This paper proposes a new method for designing high data-rate spatial signals with low error rates. The basic idea is to use transmitter channel information to adaptively vary the transmission scheme for a fixed data rate. This adaptation is done by varying the number of substreams and the rate of each substream in a precoded spatial multiplexing system. We show that these substreams can be designed to obtain full diversity and full rate gain using feedback from the receiver to transmitter. We model the feedback using a limited feedback scenario where only finite sets, or codebooks, of possible precoding configurations are known to both the transmitter and receiver. Monte Carlo simulations show substantial performance gains over beamforming and spatial multiplexing.
181 citations
Cites background from "Full-diversity full-rate complex-fi..."
...The full rate and full diversity problem was first discussed in space-time code design in [ 27 ] and [28]....
[...]
...Previous work in diversity-multiplexing tradeoff (see, for example, [ 27 ], [28], and [35]‐[37]) emphasized that every spatio-temporal signaling method has an accompanying diversity-multiplexing gain tradeoff curve....
[...]
TL;DR: It is shown that blind ML OSTBC detection can be simplified to a Boolean quadratic program (BQP), and numerical studies show that the SDR algorithm provides better complexity performance than the sphere decoder in the worst-case sense, and vice versa in the average sense.
Abstract: Orthogonal space-time block codes (OSTBCs) have attracted much attention owing to their simple code construction, maximal diversity gain, and low maximum-likelihood (ML) detection complexity when channel state information (CSI) is available at the receiver. This paper addresses the problem of ML OSTBC detection with unknown CSI. Focusing on the binary and quaternary PSK constellations, we show that blind ML OSTBC detection can be simplified to a Boolean quadratic program (BQP). From an optimization viewpoint the BQP is still a computationally hard problem, and we propose two alternatives for dealing with this inherent complexity. First, we consider the semidefinite relaxation (SDR) approach, which leads to a suboptimal, but accurate, blind ML detection algorithm with an affordable worst-case computational cost. We also consider the sphere decoding approach, which leads to an exact blind ML detection algorithm that remains computationally expensive in the worst case, but generally incurs a reasonable average computational cost. For the two algorithms, we study implementation methods that can significantly reduce the computational complexity. Simulation results indicate that the two blind ML detection algorithms are competitive, in that the bit error performance of the two algorithms is almost the same and is noticeably better than that of some other existing blind detectors. Moreover, numerical studies show that the SDR algorithm provides better complexity performance than the sphere decoder in the worst-case sense, and vice versa in the average sense.
127 citations
References
More filters
AT&T1
TL;DR: This paper presents a simple two-branch transmit diversity scheme that provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas.
Abstract: This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The new scheme does not require any bandwidth expansion or any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC.
13,706 citations
01 Nov 1999
TL;DR: In this paper, the authors investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading, and derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such formulas.
Abstract: We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such formulas. We show that the potential gains of such multi-antenna systems over single-antenna systems is rather large under independenceassumptions for the fades and noises at different receiving antennas.
12,542 citations
TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
Abstract: This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver.
We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.
10,526 citations
AT&T1
TL;DR: A generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas and it is shown that many of the codes presented here are optimal in this sense.
Abstract: We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
7,348 citations
"Full-diversity full-rate complex-fi..." refers background or methods in this paper
...It subsumes space-time orthogonal designs (ST-OD) [46], linear constellation precoding (LCP) ST designs [61], VBLAST [57], and DBLAST [13]....
[...]
...Using average pairwise error probability analysis, it follows that the maximum diversity order provided by the MIMO channel is (see, e.g., [46] and [47]) (4) As it takes time slots (number of columns of) to transmit symbols (size of ), the transmission rate is symbols per channel use (pcu (5) but…...
[...]
TL;DR: In this paper, the authors consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas and derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective.
Abstract: We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders.
7,105 citations