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.
Author(s): Chau Yuen
Series: Communications and Signal Processing Communications and Signal Porcessing
Publisher: Imperial College Press
Year: 2007
Language: English
Pages: 209
Contents......Page 10
Foreword......Page 6
1 . Introduction of MIMO Channel and Space-Time Block Code......Page 14
1.1 MIMO Channel for Wireless Communications......Page 15
1.2 Transmit Diversity with Space-Time Block Code......Page 19
1.3 Notations and Abbreviations......Page 22
1.4.1 Signal model of MIMO channel......Page 24
1.4.2 Signal model of STBC......Page 26
1.5 Design Criteria and Performance Measure of STBC......Page 30
2.1.1 Benefits of 0-STBC......Page 33
2.1.2 Background of amicable orthogonal design......Page 35
2.1.3 Construction of 0-STBC and its rate limitation......Page 38
2.2 Quasi-Orthogonal Space-Time Block Code......Page 41
2.2.1 Approaching capacity with low decoding complexity......Page 42
2.2.2.1 Full-diversity QO-STBC with constellation rotation......Page 48
2.2.2.2 Full-diversity QO-STBC without constellation rotation......Page 51
2.2.3 Remark......Page 52
3.1 Algebraic Structure of QO-STBC......Page 53
3.1.1 Decoding complexity of a QO-STBC......Page 54
3.2 Generalized Decoding Framework of QO-STBC......Page 57
3.3.1 Simplified QO-STBC model with real symbols only......Page 64
3.3.2 Decoding complexity of QO-STBC with CR......Page 66
3.4.1 Definition of GCLT......Page 70
3.4.2 Optimization of GCLT parameters......Page 72
3.4.2.1 GCLT of J4......Page 73
3.4.2.3 GCLTof TBH8......Page 79
3.4.3.1 ML decoding complexity......Page 80
3.4.3.2 Decoding performance......Page 82
3.5 Chapter Summary......Page 85
4 . Quasi-Orthogonal Space-Time Block Code with Minimum Decoding Complexity......Page 86
4.1 Algebraic Structure of MDC-QOSTBC......Page 87
4.2.1 Definition of preferred AOD pair......Page 89
4.2.2 Relationship between MDC-QOSTBC and AOD through preferred AOD pair......Page 91
4.2.3 Lower bound on the code rate for square design......Page 94
4.2.4.2 Systematic construction of preferred AOD pair......Page 98
4.2.4.3 Examples of MDC-QOSTBC constructed)om preferred AOD pair......Page 104
4.3 Construction of MDC-QOSTBC from 0-STBC......Page 105
4.3.1 Construction method......Page 106
4.3.2 Performance optimization......Page 109
4.3.2.1 Diversity product of MDC-QOSTBC......Page 110
4.3.2.2 Optimum CR angle for square- and rectangular-QAM......Page 112
4.3.2.3 Optimum CR angle for PSK......Page 113
4.3.3.1 MDC-QOSTBC for odd number of transmit antennas......Page 115
4.3.3.2 Maximum code rate of square MDC-QOSTBC......Page 117
4.3.3.3 Maximum code rate of non-square MDC-QOSTBC......Page 119
4.4 Performance Results......Page 121
4.5 Chapter Summary......Page 124
5.1 DSTM Codeword Model and Design Criteria......Page 125
5.2.2 Signal model of unitary DSTM scheme......Page 127
5.2.3.1 STBC Unitary DSTM Based on Double-Symbol-Decodable QO-......Page 129
5.2.3.2 Design of constellation set......Page 132
5.2.4 Performance comparison......Page 135
5.3.1 Literature review......Page 138
5.3.2 Signal model of quasi-unitary DSTM scheme......Page 139
5.3.3.1 Quasi-unitary DSTM based on single-symbol-decodable MDC-QOSTBC......Page 141
5.3.3.2 Constellation design......Page 144
5.3.3.3 Performance comparison......Page 150
5.4 Chapter Summary......Page 153
6.1.1 Introduction......Page 154
6.1.2.1 Construction of 4Gp-QOSTBC......Page 155
6.1.2.2 Code rate of 4Gp-QOSTBC......Page 158
6. I .2.3 Decoding performance......Page 159
6.1.3 Rate-complexity-diversity tradeoff......Page 162
6.1.4 Section summary......Page 163
6.2.2 Code search methodology......Page 164
6.2.3 Graph modelling and modified depth first search for implementing step (b)......Page 167
6.2.4 Code search results......Page 173
6.2.5 Section summary......Page 181
6.3 Chapter Summary......Page 182
7.1.1 Closed-loop QO-STBC......Page 183
7.1.3 Super space-time trellis code based on QO-STBC......Page 185
7.2 QO-STBC in Communication Standards......Page 186
8 . Conclusions......Page 190
APPENDIX A......Page 193
APPENDIX B......Page 194
BIBLIOGRAPHY......Page 197
INDEX......Page 204
