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 条
  • [21] On a class of non-orthogonal space-time block codes with linear decoding complexity
    Dalton, LA
    Georghiades, CN
    2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS, 2003, : 1728 - 1732
  • [22] Linear Dispersion Codes for a (not so) large number of receive antennas
    Clerckx, B
    Vanhoenacker-Janvier, D
    Vandendorpe, L
    VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 1284 - 1288
  • [23] Low complexity turbo space-time code for system with large number of antennas
    Jason, LHC
    Cheng, RS
    GLOBECOM '00: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1- 3, 2000, : 990 - 994
  • [24] Distributed space-time codes with reduced decoding complexity
    Kiran, T.
    Rajan, B. Sundar
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 542 - +
  • [25] Comprehensive study on a 2 x 2 full-rate and linear decoding complexity space-time block code
    Hosseini, Seyyed Saleh
    Talebi, Siamak
    Abouei, Jamshid
    IET COMMUNICATIONS, 2015, 9 (01) : 122 - 132
  • [26] COMPLEXITY OF DECODING FOR LINEAR CODES.
    Evseev, G.S.
    1600, (19):
  • [27] Perfect space-time codes for any number of antennas
    Elia, Petros
    Sethuraman, B. A.
    Kumar, R. Vijay
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (11) : 3853 - 3868
  • [28] Space time codes for CPFSK with arbitrary number of receive antennas
    Hong, Sung Kwon
    Chung, Jong-Moon
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2006, 5 (11) : 2988 - 2991
  • [29] Influence of Extrinsic Information Scaling Coefficient on Double-Iterative Decoding Algorithm for Space-Time Turbo Codes with Large Number of Antennas
    Trifina, Lucian
    Tarniceriu, Daniela
    Rotopanescu, Ana-Mirela
    ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING, 2011, 11 (01) : 85 - 90
  • [30] NOVEL ORTHOGONAL SPACE TIME BLOCK CODES FOR MULTIPLE TRANSMIT ANTENNAS(nine and ten antennas with full code rate)
    Murthy, N. S.
    Gowri, S. Sri
    Rao, B. Prabhakara
    2015 2ND INTERNATIONAL CONFERENCE ON ELECTRONICS AND COMMUNICATION SYSTEMS (ICECS), 2015, : 675 - 678