Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

被引:0
|
作者
Karmakar, Sanjay [1 ]
Rajan, B. Sundar [1 ]
机构
[1] Indian Inst Sci, Dept ECE, Bangalore 560012, Karnataka, India
关键词
D O I
10.1109/ISIT.2006.261722
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.
引用
收藏
页码:793 / +
页数:2
相关论文
共 50 条
  • [1] On Optimal Quasi-Orthogonal Space-Time Block Codes With Minimum Decoding Complexity
    Wang, Haiquan
    Wang, Dong
    Xia, Xiang-Gen
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (03) : 1104 - 1130
  • [2] On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
    Wang, HQ
    Wang, D
    Xia, XG
    [J]. 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1168 - 1172
  • [3] REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES
    Su Xin* ** Yi Kechu* Tian Bin* Sun Yongjun* *(State Key Laboratory of Integrated Service Networks
    [J]. Journal of Electronics(China), 2007, (01) : 112 - 115
  • [4] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (04) : 936 - 941
  • [5] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [6] On a class of non-orthogonal space-time block codes with linear decoding complexity
    Dalton, LA
    Georghiades, CN
    [J]. 2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS, 2003, : 1728 - 1732
  • [7] A very low complexity soft decoding of space-time block codes
    Chen, YN
    Parhi, KK
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 2693 - 2696
  • [8] Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras
    Karmakar, Sanjay
    Rajan, B. Sundar
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 788 - +
  • [9] Distributed space-time codes with reduced decoding complexity
    Kiran, T.
    Rajan, B. Sundar
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 542 - +
  • [10] Space-time trellis, code design based on super quasi-orthogonal block codes with minimum decoding complexity
    Wang, Dong
    Wang, Haiquan
    Xia, Xiang-Gen
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (08) : 1441 - 1447