By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anzhong Wong ; Department of Electrical and Computer Engineering, McMaster University, Hamilton, Canada ; Jian-Kang Zhang

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. However, full diversity cannot be achieved by such codes. The rotated quasi-orthogonal STBC 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, 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.

Published in:

IEEE Signal Processing Letters  (Volume:17 ,  Issue: 11 )