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 条
  • [31] High-Rate and Full-Diversity Space-Time Block Codes with Low Complexity Partial Interference Cancellation Group Decoding
    Shi, Long
    Zhang, Wei
    Xia, Xiang-Gen
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (05) : 1201 - 1207
  • [32] Low complexity adative design for full-diversity full-rate space-time codes
    Ding, Peilu
    Love, David J.
    Wang, Jianqi
    Zoltowski, Michael D.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (08) : 3180 - 3189
  • [33] Rate-Reliability-Complexity tradeoff for ML and Lattice decoding of full-rate codes
    Singh, Arun
    Elia, Petros
    Jalden, Joakim
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1267 - +
  • [34] Asynchronous Space Time Block Codes: Low Complexity Decoding Methods
    Nahas, Michel
    Saadani, Ahmed
    Hatoum, Rima
    SPAWC 2011: 2011 IEEE 12TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 2011, : 401 - 405
  • [35] Iterative decoding of low-complexity space-time codes
    Sezgin, A
    Boche, H
    PIMRC 2003: 14TH IEEE 2003 INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS PROCEEDINGS, VOLS 1-3 2003, 2003, : 1683 - 1687
  • [36] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [37] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (04) : 936 - 941
  • [38] A new lattice decoding for space time block codes with low complexity
    Beygi, L
    Ghaderipoor, HAR
    Dolatyar, K
    Jamali, SH
    13TH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOL 1-5, PROCEEDINGS: SAILING THE WAVES OF THE WIRELESS OCEANS, 2002, : 428 - 430
  • [39] A full rate space-time turbo codes and its near-optimum decoding algorithms
    Li, YH
    Li, DB
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2003, 3 (06): : 717 - 733
  • [40] Full rate space-time turbo codes
    Liu, YJ
    Fitz, MP
    Takeshita, OY
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (05) : 969 - 980