Semiorthogonal space-time block codes

  • Authors:
  • Ngoc-Dũng Dào;Chintha Tellambura

  • Affiliations:
  • Toshiba Research Europe, Ltd., Telecommunications Research Laboratory, Bristol, UK and Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

In this paper, a new class of full-diversity, rate-one space-time block codes (STBCs) called semiorthogonal algebraic space-time block codes (SAST codes) is proposed. SAST codes are delay optimal when the number of transmit antennas is even. The SAST codeword matrix has a generalized Alamouti structure where the transmitted symbols are replaced by circulant matrices and the commutativity of circulant matrices simplifies the detection of transmit symbols. SAST codes with maximal coding gain are constructed by using rate-one linear threaded algebraic space-time (LTAST) codes. Compared with LTSAT codes, SAST codes not only reduce the complexity of maximum-likelihood detection, but also provide remarkable performance gain. They also outperform other STBC with rate one or less. SAST codes also perform well with suboptimal detectors such as the vertical-Bell Laboratories layered space-time (V-BLAST) nulling and cancellation receiver. Finally, SAST codes attain nearly 100% of the Shannon capacity of open-loop multiple-input-single-output (MISO) channels.