Approximately Universal Codes over Slow Fading Channels

Details Approximately Universal Codes over Slow Fading Channels Approximately Universal Codes over Slow Fading Channels

2005-12-05

arxiv.org/abs/cs/0512017v2

Computer Science

Information Theory

Revised version. Accepted for IEEE Transactions on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Approximately Universal Codes over Slow Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximately Universal Codes over Slow Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximately Universal Codes over Slow Fading Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697599