Approximately universal codes over slow-fading channels

Saurabha Tavildar, Pramod Viswanath

Research output: Contribution to journalArticle

Abstract

Performance of reliable communication over a coherent slow-fading multiple-input multiple-output (MIMO) channel at high signal-to-noise ratio (SNR) is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. This paper studies the problem of designing codes that optimally tradeoff the diversity and multiplexing gains. The main contribution is a precise characterization of codes that are universally tradeoff-optimal, i.e., they optimally tradeoff the diversity and multiplexing gains for every statistical characterization of the fading channel. This characterization is referred to as approximate universality; the approximation is in the connection between error probability and outage capacity with diversity and multiplexing gains, respectively. The characterization of approximate universality is then used to construct new coding schemes as well as to show optimality of several schemes proposed in the space-time coding literature.

Original languageEnglish (US)
Pages (from-to)3233-3258
Number of pages26
JournalIEEE Transactions on Information Theory
Volume52
Issue number7
DOIs
StatePublished - Jul 1 2006

Keywords

  • Compound channel
  • Diversity-multiplexing tradeoff
  • Fading channel
  • Multiple-input multiple-output (MIMO)
  • Space-time codes
  • Universal codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Approximately universal codes over slow-fading channels'. Together they form a unique fingerprint.

  • Cite this