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
来源：
2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS | 2010年
基金：
瑞典研究理事会;
关键词：
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 条
  • [31] Equivalent Codes and Optimality of Orthogonal Space-Time Block Codes
    Geyer, Alex E.
    Vorobyov, Sergiy A.
    Beaulieu, Norman C.
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1559 - 1563
  • [32] A Low Complexity Decoding Scheme for Quasi-Orthogonal Space-Time Block Coding
    Jiang, Cunliang
    Zhang, Haixia
    Yuan, Dongfeng
    Chen, Hsiao-Hwa
    2008 IEEE SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP, 2008, : 9 - +
  • [33] Low complexity decoding of a class of linear space-time block codes by subspace partitioning
    Kuhn, M
    Wittneben, A
    IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 2182 - 2186
  • [34] Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity
    Karmakar, Sanjay
    Rajan, B. Sundar
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 793 - +
  • [35] LOW COMPLEXITY ESSENTIALLY MAXIMUM LIKELIHOOD DECODING OF PERFECT SPACE-TIME BLOCK CODES
    Howard, S. D.
    Sirianunpiboon, S.
    Calderbank, A. R.
    2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS, 2009, : 2725 - +
  • [36] A fast decoding algorithm for space-time block codes
    Li, K
    Tang, B
    Yang, JY
    Du, ZC
    International Symposium on Communications and Information Technologies 2005, Vols 1 and 2, Proceedings, 2005, : 342 - 345
  • [37] Diagonal block orthogonal algebraic space-time block codes
    Liu, C
    Wu, ZY
    Zhao, HA
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (07): : 1457 - 1459
  • [38] New sphere decoding for block space-time codes
    Harchegani, LB
    Ghaderipoor, AR
    Jamali, SH
    Dolatyar, K
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 4170 - 4170
  • [39] On decoding algorithm and performance of space-time block codes
    Xu, CJ
    Kwak, KS
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (03) : 825 - 829
  • [40] Constellation space invariance of orthogonal space-time block codes
    Gharavi-Alkhansari, M
    Gershman, AB
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) : 331 - 334
12345