Full Rate Space Time Codes for Large Number of Transmitting Antennas with Linear Complexity Decoding

被引:0
|
作者
Amir Laufer
Yeheskel Bar-Ness
机构
[1] New Jersey Institute of Technology (NJIT),The Center for Wireless Communications and Signal Processing Research, ECE department
来源
关键词
Orthogonal space time codes; MIMO; Diversity;
D O I
暂无
中图分类号
学科分类号
摘要
Among the specification of the 5G networks two crucial aspects are the support of fast mobility and high data rates. With fast mobility, the fading channels phenomenon become crucial, resulting in the need for multiple input/output channel to create spatial diversity. Space time codes (STC) have been shown to be well used with the Multiple Input Multiple Output channel. The Orthogonal STC (OSTC) family of codes is known to achieve full diversity as well as very simple implementation of the Maximum Likelihood (ML) decoder. However, it was also proven that with a complex symbol constellation one cannot achieve a full rate code when the number of transmitting antennas is larger than two. Quasi-OSTC (QSTC) can have full rate even for more than two transmitting antennas but with the penalty of decoding complexity which becomes severe if the constellation size is large. In order to tackle this inherent drawback of the OSTC/QSTC and to be able to support the 5G high data rate demand, we have come up with a different STC code that, when used with a new transmission and decoding methods, achieves full rate while maintaining linear complexity decoding for any number of transmit antennas. It can also be shown that when the transmitter knows the strongest channel (through minimal feedback) the code also achieves full diversity along with better error rate than the OSTC and the QSTC.
引用
收藏
页码:465 / 480
页数:15
相关论文
共 50 条
  • [1] Full Rate Space Time Codes for Large Number of Transmitting Antennas with Linear Complexity Decoding
    Laufer, Amir
    Bar-Ness, Yeheskel
    WIRELESS PERSONAL COMMUNICATIONS, 2011, 57 (03) : 465 - 480
  • [2] Full Rate Space Time Codes for Large Number of Transmitting Antennas with Linear Complexity Decoding and High Performance
    Laufer, Amir
    Bar-Ness, Yeheskel
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 416 - 420
  • [3] Linear Computational Complexity Decoding for Semi Orthogonal Full Rate Space Time Codes
    Laufer, Amir
    Bar-Ness, Yeheskel
    2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 1534 - 1539
  • [4] On the complexity of ML lattice decoders for decoding linear full rate Space-Time Codes
    Rekaya, G
    Belfiore, JC
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 206 - 206
  • [5] Space-time codes with controllable ML decoding complexity for any number of transmit antennas
    Sharma, Naresh
    Pinnamraju, Pavan R.
    Papadias, Constantinos B.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2911 - +
  • [6] Doubly iterative decoding of space-time turbo codes with a large number of antennas
    Biglieri, E
    Nordio, A
    Taricco, G
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (05) : 773 - 779
  • [7] Doubly-iterative decoding of space-time turbo codes with a large number of antennas
    Biglieri, E
    Nordio, A
    Taricco, G
    2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 473 - 477
  • [8] Performance of space-time codes for a large number of antennas
    Biglieri, E
    Taricco, G
    Tulino, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) : 1794 - 1803
  • [9] Full-rate full-diversity linear quasi-orthogonal space-time codes for any number of transmit antennas
    Sharma, N
    Papadias, CB
    EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, 2004, 2004 (09) : 1246 - 1256
  • [10] Full-rate full-diversity linear quasi-orthogonal space-time codes for any number of transmit antennas
    Sharma, N. (nareshs@bell-labs.com), 1600, Hindawi Publishing Corporation (2004):