Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number

被引:5
作者
Wong, Anzhong [1 ]
Zhang, Jian-Kang [1 ]
机构
[1] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4K1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Diophantine equations; full diversity; ML receiver; number of nearest neighbors; optimal coding gain; quasi-orthogonal STBCs;
D O I
10.1109/LSP.2010.2081977
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this letter, we consider a coherent communication system equipped with multiple transmitter antennas and a single receiver antenna, i.e., a MISO system. For such a system, quasi-orthogonal STBC designs with fast maximum likelihood (ML) decoding have been proposed [1]-[3]. However, full diversity cannot be achieved by such codes. The rotated quasi- orthogonal STBC [15] overcomes such shortcomings and enables full diversity and optimal coding gain. However, for large constellations, the performance of such codes deteriorates due to the increase of the number of the nearest neighbor per symbol. In this letter, we propose to add the number of nearest neighbor as a design criterion. We show that for the rotated quasi- orthogonal code proposed in [4], the number of nearest neighbor tends to infinity when the size of constellation becomes infinite. Furthermore, we propose to have a particular value of rotation and show that this value not only achieves full diversity and maximum coding gain, but also has only a small number of nearest neighbors even for very large constellations.
引用
收藏
页码:965 / 968
页数:4
相关论文
共 19 条
[1]   A simple transmit diversity technique for wireless communications [J].
Alamouti, SM .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (08) :1451-1458
[2]   On Fast-Decodable Space-Time Block Codes [J].
Biglieri, Ezio ;
Hong, Yi ;
Viterbo, Emanuele .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) :524-530
[3]   Four-group decodable space-time block codes [J].
Dao, Dung Ngoc ;
Yuen, Chau ;
Tellambura, Chintha ;
Guan, Yong Liang ;
Tjhung, Tjeng Thiang .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (01) :424-430
[4]  
Hua L. K., 1982, INTRO NUMBER THEORY
[5]   A quasi-orthogonal space-time block code [J].
Jafarkhani, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (01) :1-4
[6]  
KARMAKAR S, 2006, IEEE INF THEOR WORKS, P448
[7]   Orthogonal designs with maximal rates [J].
Liang, XB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2468-2503
[8]   Capacity-approaching space-time codes for systems employing four transmitter antennas [J].
Papadias, CB ;
Foschini, GJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (03) :726-733
[9]   A new full-rate full-diversity space-time block code with nonvanishing determinants and simplified maximum-likelihood decoding [J].
Paredes, Javier M. ;
Gershman, Alex B. ;
Gharavi-Alkhansari, Mohammad .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) :2461-2469
[10]   Space-time block codes: A capacity perspective [J].
Sandhu, S ;
Paulraj, A .
IEEE COMMUNICATIONS LETTERS, 2000, 4 (12) :384-386