A new non-orthogonal space-time code with low decoding complexity

Mohammad A. Maddah-Ali, Amir K. Khandani

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

A full diversity block space-time code over two transmit antennas and two symbol periods is introduced. In this method, each code is equal to the addition of two matrices; A m and DA n, where A and D are the two constant matrices and m and n are the two data symbols. A is selected such that the set A m, 0 ≤ m ≤ 2 b - 1 is closed under the matrix multiplication. This structure allows a simple Maximum Likelihood (ML) decoding method, and at the same time, simplifies the optimization of the coding advantage. Simulations show that the performance of the new code is very close to that of the Damen code [1] which is the best known block space-time code in terms of the coding advantage. Moreover, the decoding complexity of the proposed method is significantly lower than that of the Damen code.

Original languageEnglish (US)
Pages (from-to)1115-1121
Number of pages7
JournalIEEE Transactions on Wireless Communications
Volume5
Issue number5
DOIs
StatePublished - May 2006
Externally publishedYes

Keywords

  • Maximum Likelihood (ML) decoding
  • Multiple-antenna arrays
  • Space-time coding
  • Transmit diversity
  • Wireless communications

Fingerprint

Dive into the research topics of 'A new non-orthogonal space-time code with low decoding complexity'. Together they form a unique fingerprint.

Cite this