The universality of LDPC codes on wireless channels

Authors:
Christopher Jones;Adina Matache;Tao Tian;John Villasenor;Richard Wesel
Affiliations:
Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Year:
2003

Citing 3
Cited 2

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory

Identical-capacity channel decomposition for design of universal LDPC codes

IEEE Transactions on Communications
Demultiplexer design for multi-edge type LDPC coded modulation

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Root and Variaya proved the existence of codes that can communicate reliably over any linear Gaussian channel for which the mutual information exceeds the information rate of the code. In this paper we demonstrate that properly designed Low-Density Parity-Check (LDPC) codes are such codes and that their performance lies in close proximity to the Root and Variaya capacity for the linear Gaussian vector channels (a.k.a. space-time channels). We also demonstrate the robustness of the codes on the partial-band jamming channel and in fast Rayleigh fading.