Novel rotated quasi-orthogonal space-time block codes with the fixed nearest neighbor number

  • Authors:

  • An-Zhong Wong;Jian-Kang Zhang

  • Affiliations:

  • Department of Electrical and Computer Engineering, McMaster University, Hamilton, ONT, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ONT, Canada

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, various space-time block coding (STBC) schemes have been developed to take advantage of the MIMO communication channel. The code designs using the pairwise error probability of the maximum likelihood (ML) detector are based mainly on the rank and the determinant criteria. In particular, the current STBC designs focus on full diversity and the non-vanishing determinant, since such codes enable the optimal tradeoff of diversity and multiplexing gains. In this paper, we consider a coherent communication system equipped with multiple transmitter antennas and a single receiver antenna, i.e., a MISO system. For such systems, Afarkhani, Tirkkonen-Boariu-Hottinen, and Papadias-Foschini proposed the quasi-orthogonal STBC designs with fast ML decoding. Su and Xia designed the rotated quasi-orthogonal STBCs enabling full diversity and optimal coding gain. However, the nearest neighbor number per symbol for this code tends to infinity when the size of constellation is infinity. Here, we explore a novel criterion to design rotated quasi-orthogonal STBCs. In addition to both maximizing the rank and the coding gain, our design attempts to make the average number of the nearest neighbors as small as possible.