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

Fingerprint

Multiplexing
Fading channels
coding
Outages
Signal to noise ratio
communication
Communication
performance

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

Cite this

Approximately universal codes over slow-fading channels. / Tavildar, Saurabha; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 52, No. 7, 01.07.2006, p. 3233-3258.

Research output: Contribution to journalArticle

@article{f7d5a3761e764b1e92c46e117259a3be,
title = "Approximately universal codes over slow-fading channels",
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.",
keywords = "Compound channel, Diversity-multiplexing tradeoff, Fading channel, Multiple-input multiple-output (MIMO), Space-time codes, Universal codes",
author = "Saurabha Tavildar and Pramod Viswanath",
year = "2006",
month = "7",
day = "1",
doi = "10.1109/TIT.2006.876226",
language = "English (US)",
volume = "52",
pages = "3233--3258",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Approximately universal codes over slow-fading channels

AU - Tavildar, Saurabha

AU - Viswanath, Pramod

PY - 2006/7/1

Y1 - 2006/7/1

N2 - 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.

AB - 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.

KW - Compound channel

KW - Diversity-multiplexing tradeoff

KW - Fading channel

KW - Multiple-input multiple-output (MIMO)

KW - Space-time codes

KW - Universal codes

UR - http://www.scopus.com/inward/record.url?scp=33746911145&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746911145&partnerID=8YFLogxK

U2 - 10.1109/TIT.2006.876226

DO - 10.1109/TIT.2006.876226

M3 - Article

AN - SCOPUS:33746911145

VL - 52

SP - 3233

EP - 3258

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

ER -