The universality of LDPC codes on wireless channels

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.