Universal trellis codes for diagonally layered space-time systems

Matache, A.; Wesel, Richard D.

doi:10.1109/tsp.2003.818159

Cited by 8 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore an approximately universal code over the parallel channel, such as the permutation code, when used as the streams of the D-BLAST architecture for the MIMO channel will be approximately universal for the MIMO channel. This approach of converting the MIMO channel into a parallel channel has also been used by Matache and Wesel in [4].…”

Section: The D-blast Architecturementioning

confidence: 99%

See 1 more Smart Citation

Approximately universal codes over slow-fading channels

Tavildar

Viswanath

2006

IEEE Trans. Inform. Theory

204

253

View full text Add to dashboard Cite

Performance of reliable communication over a coherent slow fading MIMO 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.

show abstract

Section: The D-blast Architecturementioning

confidence: 99%

“…These codes are robust to statistical channel modeling errors, hence their engineering appeal is clear. This approach of using compound channel viewpoint to construct robust codes for MIMO channels has also been taken in a series of works in [2,3,4].…”

Section: Introductionmentioning

confidence: 99%

Approximately universal codes over slow-fading channels

Tavildar

Viswanath

2006

IEEE Trans. Inform. Theory

204

253

View full text Add to dashboard Cite

show abstract

“…6], and [9, Fig. 3] where the erasure channels (singular channel for [3] and [9]) were more favorable channels. Once the input block length is on the order of 5000 bits, the bounds indicate that uniform behavior over all channels is a practical goal.…”

Section: Discussionmentioning

confidence: 99%

“…A natural application of the compound channel coding theorem is universal space-time code design as in [3], [9], [10].…”

Section: Definitionmentioning

confidence: 99%

A Study on Universal Codes With Finite Block Lengths

Shi

Wesel

2007

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the probability of error as the block length approaches infinity, with short block lengths the performance can differ considerably for individual channels. Simulation results show that universal performance can be a practical goal as the block lengths become large.Index Terms-Compound channel, random coding bound, sphere-packing bound (SPB), universal code.

show abstract

“…In particular, universal codes are presented as a solution to the tradeoff between diversity and multiplexing. Furthermore, they note that parallel universal codes may be transformed to MIMO universal codes via diagonal Bell Laboratories space-time (DBLAST), as was demonstrated by Matache in [16].…”

Section: Introductionmentioning

confidence: 93%

The Universal Operation of LDPC Codes Over Scalar Fading Channels

Jones

Tian²,

Villasenor³

et al. 2007

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-Root and Varaiya proved the existence of a code that can communicate reliably over any linear Gaussian channel for which the channel mutual information level exceeds the transmitted rate. This paper provides several examples of scalar (single-input single-output) fading channels and shows that on these channels the performance of low-density parity-check (LDPC) codes lies in close proximity to the performance limits identified by Root and Varaiya. Specifically, we consider periodic fading channels and partial-band jamming (PBJ) channels. A special case of periodic fading is the variation of signal-to-noise ratio across orthogonal frequency division modulation subchannels. The robustness of LDPC codes to periodic fading and PBJ across parameterizations of these different channels is demonstrated through the consistency of the required mutual information to provide a specified bit error rate. For the periodic fading case, the Gaussian approximation to density evolution has been adapted such that asymptotic threshold measures can be compared to simulated code performance in various periodic fading scenarios.

show abstract

Universal trellis codes for diagonally layered space-time systems

Cited by 8 publications

References 26 publications

Approximately universal codes over slow-fading channels

Approximately universal codes over slow-fading channels

A Study on Universal Codes With Finite Block Lengths

The Universal Operation of LDPC Codes Over Scalar Fading Channels

Contact Info

Product

Resources

About