New space-time code constructions for two-user multiple access channels

Hsiao Feng Lu*, Roope Vehkalahti, Camilla Hollanti, Jyrki Lahtonen, Yi Hong, Emanuele Viterbo

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

17 Citations (Scopus)

Abstract

This paper addresses the problem of constructing multiuser multiple-input multiple-output (MU-MIMO) codes for two users. The users are assumed to be equipped with nt transmit antennas, and there are nr antennas available at the receiving end. A general scheme is proposed and shown to achieve the optimal diversity-multiplexing gain tradeoff (DMT). Moreover, an explicit construction for the special case of nr=2 and n r=2 is given, based on the optimization of the code shape and density. All the proposed constructions are based on cyclic division algebras and their orders and take advantage of the multi-block structure. Computer simulations show that both the proposed schemes yield codes with excellent performance improving upon the best previously known codes. Finally, it is shown that the previously proposed design criteria for DMT optimal MU-MIMO codes are sufficient but in general too strict and impossible to fulfill. Relaxed alternative design criteria are then proposed and shown to be still sufficient for achieving the multiple-access channel diversity-multiplexing tradeoff.

Original languageEnglish
Article number5370674
Pages (from-to)939-957
Number of pages19
JournalIEEE Journal of Selected Topics in Signal Processing
Volume3
Issue number6
DOIs
Publication statusPublished - Dec 2009
MoE publication typeA1 Journal article-refereed

Keywords

  • Cyclic division algebras (CDAs)
  • Diversity-multiplexing gain tradeoff (DMT)
  • Multiple access channel (MAC)
  • Multiple-input multiple-output (MIMO) channel
  • Space-Time block codes (STBCs)

Fingerprint Dive into the research topics of 'New space-time code constructions for two-user multiple access channels'. Together they form a unique fingerprint.

Cite this