Approximately universal codes over slow-fading channels

DOI10.1109/TIT.2006.876226MaRDI QIDQ3547700zbMATH OpenFDO

Authors Saurabha Tavildar, P. Viswanath

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0512017

zbMATH Keywords

space-time codesmultiple-input multiple-output (MIMO)fading channeluniversal codesCompound channeldiversity-multiplexing tradeoff

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff the diversity and multiplexing gains. Our 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. We denote this characterization as one of approximate universality where 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.

Recommendations

• Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff
• Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
• Space-time block codes from orthogonal designs
• A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
• On the design of algebraic space-time codes for MIMO block-fading channels

Cited in

(3)

• On universally decodable matrices for space-time coding
• Higher genus universally decodable matrices (UDMG)
• Hierarchical erasure correction of linear codes

This page was built for publication: Approximately universal codes over slow-fading channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547700)