Computational Complexity of Decoding Orthogonal Space-Time Block Codes

被引:0
|
作者
Ayanoglu, Ender [1 ]
Larsson, Erik G. [2 ]
Karipidis, Eleftherios [2 ]
机构
[1] Univ Calif Irvine, Dept Elect Engn & Comp Sci, Ctr Pervas Commun & Comp, Irvine, CA 92697 USA
[2] Linkoping Univ, Dept Elect Engn, S-58183 Linkoping, Sweden
基金
瑞典研究理事会;
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same computational complexity are specified. Modifications to the basic formulation in special cases are calculated and illustrated by means of examples.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] 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
  • [2] Decoding algorithms for space-time orthogonal block codes
    Farhang-Borotuyeny, B
    Ho, CK
    [J]. 2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS, 2003, : 2535 - 2539
  • [3] Reduced complexity decoding algorithm for quasi-orthogonal space-time block codes
    Kim, Jeongchang
    Cheun, Kyungwhoon
    [J]. 2006 ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1 AND 2, 2006, : 408 - +
  • [4] 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
  • [5] 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
  • [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] Orthogonal decoding of Space-Time Block Codes in fast fading
    de Abreu, GTF
    Kohno, R
    [J]. 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 155 - 155
  • [8] A Low-Complexity Decoding Algorithm for Quasi-orthogonal Space-Time Block Codes
    Jin, Xiao-Ping
    Li, You-Ming
    Li, Zheng-Quan
    Jin, Ning
    [J]. ELECTRONICS, COMMUNICATIONS AND NETWORKS V, 2016, 382 : 19 - 25
  • [9] Sphere decoding of orthogonal space-time block codes for incoherent channels
    Li, Q
    Georghiades, CN
    [J]. 2005 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL & 13TH MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1 AND 2, 2005, : 702 - 706
  • [10] A squaring method to simplify the decoding of orthogonal space-time block codes
    Li, XM
    Luo, T
    Yue, GX
    Yin, CC
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (10) : 1700 - 1703