Two Quasi Orthogonal Space-Time Block Codes with Better Performance and Low Complexity Decoder

被引:0
|
作者
Lotfi-Rezaabad, Ali [1 ]
Talebi, Siamak [2 ,3 ]
Chizari, Ata [1 ]
机构
[1] Sharif Univ Technol, Tehran, Iran
[2] Sharif Univ Technol, ACRI, Tehran, Iran
[3] Shahid Bahonar Univ Kerman, Kerman, Iran
关键词
Multi-input single-output; 5G; space time block codes; fading channels; multipath channels;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This paper presents two new space time block codes (STBCs) with quasi orthogonal structure for an open loop multi-input single-output (MISO) systems. These two codes have been designed to transmit from three or four antennas at the transmitter and be given to one antenna at the receiver. In this paper first, the proposed codes are introduced and their structures are investigated. This is followed by the demonstration of how the decoder decodes half of transmitted symbols independent of the other half. The last part of this paper discusses the simulation results, makes performance comparison against other popular approaches and concludes that the proposed solutions offer superiority.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] A Low Complexity Decoder for Quasi-Orthogonal Space Time Block Codes
    Alabed, Samer J.
    Paredes, Javier M.
    Gershman, Alex B.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (03) : 988 - 994
  • [2] A Low-Complexity Decoding Algorithm for Quasi-orthogonal Space-Time Block Codes
    Jin, Xiao-Ping
    Li, You-Ming
    Li, Zheng-Quan
    Jin, Ning
    ELECTRONICS, COMMUNICATIONS AND NETWORKS V, 2016, 382 : 19 - 25
  • [3] Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes
    Peng, AYC
    Kim, IM
    Yousefi, S
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (03) : 377 - 382
  • [4] A new sub-optimal decoder for quasi-orthogonal space-time block codes
    Leuschner, Jeff
    Yousefi, Shahram
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (08) : 548 - 550
  • [5] On Optimal Quasi-Orthogonal Space-Time Block Codes With Minimum Decoding Complexity
    Wang, Haiquan
    Wang, Dong
    Xia, Xiang-Gen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (03) : 1104 - 1130
  • [6] On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
    Wang, HQ
    Wang, D
    Xia, XG
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1168 - 1172
  • [7] Reduced complexity decoding algorithm for quasi-orthogonal space-time block codes
    Kim, Jeongchang
    Cheun, Kyungwhoon
    2006 ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1 AND 2, 2006, : 408 - +
  • [8] Low-complexity symbol timing error detection for quasi-orthogonal space-time block codes
    Dmochowski, Pawel A.
    IET COMMUNICATIONS, 2013, 7 (03) : 206 - 216
  • [9] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [10] 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