Perfect space-time codes for any number of antennas

被引：88
|
作者：
Elia, Petros [1 ]
Sethuraman, B. A.
Kumar, R. Vijay
机构：
[1] Forschungszentrum Telecommun, A-1220 Vienna, Austria
[2] Calif State Univ Northridge, Dept Math, Northridge, CA 91330 USA
[3] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 11期
基金：
美国国家科学基金会;
关键词：
diversity-multiplexing tradeoff (DMT); division algebras; multiple-input multiple-output (MIMO); perfect space-time (ST) codes;
D O I：
10.1109/TIT.2007.907502
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In a recent paper, perfect (n x n) space-time codes were introduced as the class of linear dispersion space-time (ST) codes having full rate, nonvanishing determinant, a signal constellation isomorphic to either the rectangular or hexagonal lattices in 2n(2) dimensions, and uniform average transmitted energy per antenna. Consequence of these conditions include optimality of perfect codes with respect to the Zheng-Tse diversity-multiplexing gain tradeoff (DMT), as well as excellent low signal-to-noise ratio (SNR) performance. Yet perfect space-time codes have been constructed only for two, three, four, and six transmit antennas. In this paper, we construct perfect codes for all channel dimensions, present some additional attributes of this class of ST codes, and extend the notion of a perfect code to the rectangular case.
引用
收藏
页码：3853 / 3868
页数：16
相关论文
共 50 条
  • [1] Perfect space-time codes with minimum and non-minimum delay for any number of antennas
    Elia, P
    Sethuraman, BA
    Kumar, PV
    [J]. 2005 International Conference on Wireless Networks, Communications and Mobile Computing, Vols 1 and 2, 2005, : 722 - 727
  • [2] Space-time codes with controllable ML decoding complexity for any number of transmit antennas
    Sharma, Naresh
    Pinnamraju, Pavan R.
    Papadias, Constantinos B.
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2911 - +
  • [3] Performance of space-time codes for a large number of antennas
    Biglieri, E
    Taricco, G
    Tulino, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) : 1794 - 1803
  • [4] Designing space-time codes for large number of receiving antennas
    Biglieri, E
    Tulino, AM
    [J]. ELECTRONICS LETTERS, 2001, 37 (17) : 1073 - 1074
  • [5] On the Existence of Perfect Space-Time Codes
    Berhuy, Gregory
    Oggier, Frederique
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) : 2078 - 2082
  • [6] 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
  • [7] Space-time codes for quaternary CPFSK systems with large number of receiver antennas
    Hong, SK
    Chung, JM
    Yun, Y
    Kwon, SL
    [J]. AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2005, 59 (08) : 486 - 490
  • [8] 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
  • [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] Improved Perfect Space-Time Block Codes
    Srinath, Pavan K.
    Rajan, B. Sundar
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2013, : 3192 - 3197
12345