A complete family of quasi-orthogonal space-time codes

被引:0
|
作者
Chang, Y [1 ]
Hua, YB [1 ]
机构
[1] Univ Calif Riverside, Dept Elect Engn, Riverside, CA 92521 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For two-transmitter systems, there are (full-rate) orthogonal space-time block codes (O-STBC). For four-transmitter systems, there are (full-rate) quasi-orthogonal space-time block codes (QO-STBC). The orthogonality of such codes makes a decoder attractively simple with only little compromise of optimality of coding performance. A complete family of O-STBC is well understood. But for QO-STBC, only ad hoc examples have been reported in the literature. In this paper, we provide a systematic construction of a complete family of 4 x 4 QO-STBC. We show that there are only three independent QO-STBC and all other QO-STBC can be constructed by trivial variations of any three independent codes. Indeed, all 4 x 4 QO-STBC in the literature can be constructed in such a way. Furthermore, we show a connection between three independent QO-STBC and the Hurwitz-Radon families of matrices. A complete set of the HR families of size four is also discovered.
引用
收藏
页码:777 / 780
页数:4
相关论文
共 50 条
  • [31] Quasi-Orthogonal Space-Time Block Codes Designs Based on Jacket Transform
    Song, Wei
    Lee, Moon Ho
    Matalgah, Mustafa M.
    Guo, Ying
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2010, 12 (03) : 240 - 245
  • [32] On decoupling of quasi-orthogonal space-time block codes based on inherent structure
    Kapinas, Vasilios M.
    Karagiannidis, George K.
    2007 PROCEEDINGS OF THE 16TH IST MOBILE AND WIRELESS COMMUNICATIONS, VOLS 1-3, 2007, : 1449 - 1453
  • [33] Signal constellations for quasi-orthogonal space-time block codes with full diversity
    Su, WF
    Xia, XG
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) : 2331 - 2347
  • [34] Signal constellations for quasi-orthogonal space-time block codes with full diversity
    Dept. of Elec. and Comp. Engineering, University of Maryland, College Park, MD 20742, United States
    不详
    1600, 2331-2347 (October 2004):
  • [35] Optimal rotation angles for quasi-orthogonal space-time codes with PSK modulation
    Xian, L
    Liu, HP
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (08) : 676 - 678
  • [36] Efficient space-time block codes derived from quasi-orthogonal structures
    Janani, Mohammad
    Nosratinia, Aria
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (05) : 1643 - 1646
  • [37] Improved quasi-orthogonal space-time block codes with hexagonal lattice modulation
    Smith, David B.
    2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, 2007, : 260 - 264
  • [38] On Optimal Quasi-Orthogonal Space-Time Block Codes With Minimum Decoding Complexity
    Wang, Haiquan
    Wang, Dong
    Xia, Xiang-Gen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (03) : 1104 - 1130
  • [39] On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
    Wang, HQ
    Wang, D
    Xia, XG
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1168 - 1172
  • [40] Reduced complexity decoding algorithm for quasi-orthogonal space-time block codes
    Kim, Jeongchang
    Cheun, Kyungwhoon
    2006 ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1 AND 2, 2006, : 408 - +