Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel

Amaro Barreal, Camilla Hollanti, Nadya Markin

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)
95 Downloads (Pure)

Abstract

In this article, the first general constructions of fast-decodable, more specifically (conditionally) g-group decodable, space-time block codes for the nonorthogonal amplify and forward (NAF) multiple-input multiple-output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ multiple antennas for data transmission and reception. The worst-case decoding complexity of the obtained codes is reduced by up to 75%. In addition to being fast-decodable, the proposed codes achieve full-diversity and have nonvanishing determinants, which has been shown to be useful for achieving the optimal diversity-multiplexing tradeoff (DMT) of the NAF channel. Furthermore, it is shown that the same techniques as in the cooperative scenario can be utilized to achieve fast-decodability for K-user MIMO multiple-access channel (MAC) space-time block codes. The resulting codes in addition exhibit the conditional nonvanishing determinant property which, for its part, has been shown to be useful for achieving the optimal MAC-DMT.

Original languageEnglish
Article number7313045
Pages (from-to)1754-1767
Number of pages14
JournalIEEE Transactions on Wireless Communications
Volume15
Issue number3
DOIs
Publication statusPublished - 1 Mar 2016
MoE publication typeA1 Journal article-refereed

Keywords

  • Central simple algebras
  • distributed space-time block codes
  • fading channels
  • fast-decodability
  • lattices
  • multiple-access channel (MAC)
  • multiple-input multiple-output (MIMO)
  • relay channel
  • BLOCK-CODES
  • DIVISION-ALGEBRAS
  • FULL-DIVERSITY
  • CONSTRUCTIONS
  • COMPLEXITY
  • NETWORKS
  • DESIGN
  • STBCS

Cite this