Space-time codes with controllable ML decoding complexity for any number of transmit antennas

被引:0
|
作者
Sharma, Naresh [1 ]
Pinnamraju, Pavan R. [2 ]
Papadias, Constantinos B. [3 ]
机构
[1] Tata Inst Fundamental Res, Homi Bhabha Rd, Bombay 400005, Maharashtra, India
[2] Indian Inst Technol, Delhi, India
[3] Athens Informat Technol, Athens, Greece
关键词
D O I
10.1109/ISIT.2007.4557660
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for M transmit antennas can be varied from ML decoding of 2([log2 M]-1) symbols together to single symbol ML decoding. For ML decoding of 2([log2 M]-n) (n = 1,2,...) symbols together, a diversity of min(M, 2([log2 M]-n+1)) can be achieved. Numerical results show that the performance of the constructed code when 2([log2 M]-1) symbols are decoded together is quite close to the performance of ideal rate-1 orthogonal codes (that are non-existent for more than 2 transmit antennas).
引用
收藏
页码:2911 / +
页数:2
相关论文
共 50 条
  • [1] Perfect space-time codes for any number of antennas
    Elia, Petros
    Sethuraman, B. A.
    Kumar, R. Vijay
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (11) : 3853 - 3868
  • [2] Algebraic distributed space-time codes with low ML decoding complexity
    Rajan, G. Susinder
    Rajan, B. Sundar
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1516 - 1520
  • [3] ML detection and decoding of space-time codes
    Larsson, EG
    Stoica, P
    Li, E
    [J]. CONFERENCE RECORD OF THE THIRTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1 AND 2, 2001, : 1435 - 1439
  • [4] Design of recursive convolutional space-time codes with an arbitrary number of transmit antennas
    Li, Y
    Guo, XD
    Wang, XM
    [J]. IEEE COMMUNICATIONS LETTERS, 2005, 9 (07) : 637 - 639
  • [5] Space-time block codes for eight transmit antennas
    Ahmed, Y
    Buehrer, RM
    Reed, JH
    [J]. THIRTY-SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS - CONFERENCE RECORD, VOLS 1 AND 2, CONFERENCE RECORD, 2002, : 1359 - 1363
  • [6] Differential space-time codes with four transmit antennas
    Konishi, T
    [J]. 1ST INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS 2004, PROCEEDINGS, 2004, : 343 - 346
  • [7] Full-rate full-diversity space-time block codes for any odd number of transmit antennas
    Jung, T. -J.
    Chae, C. -H.
    Lim, H. -S.
    [J]. IET COMMUNICATIONS, 2008, 2 (09) : 1205 - 1212
  • [8] Reduced-complexity ML decoding of rate 6/8 and rate 1 linear space-time codes for up to eight transmit antennas with phase feedback
    Sharma, N
    Papadias, CB
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2005, 12 (08) : 565 - 568
  • [9] Doubly iterative decoding of space-time turbo codes with a large number of antennas
    Biglieri, E
    Nordio, A
    Taricco, G
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (05) : 773 - 779
  • [10] Effective design of recursive convolutional space-time codes with an arbitrary number of transmit antennas
    Li, Y
    Guo, XD
    Wang, XM
    [J]. 2005 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 473 - 478