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.
منابع مشابه
On Universal Ldpc Codes over Memoryless Symmetric Channels
A design of robust error-correcting codes that achieve reliable communication over various channels is of great theoretical and practical interest. Such codes are termed universal. This paper considers the universality of lowdensity parity-check (LDPC) code ensembles over families of memoryless binary-input output-symmetric (MBIOS) channels. Universality is considered both under belief-propagat...
متن کاملStructured root-LDPC codes and PEG-based techniques for block-fading channels
In this work, we propose structured root-low-density parity-check (LDPC) codes and design techniques for block-fading channels. In particular, quasi-cyclic root-LDPC codes, irregular repeat-accumulate root-LDPC codes and controlled doping root-LDPC codes based on progressive edge growth (PEG) techniques for block-fading channels are proposed. The proposed root-LDPC codes are both suitable for c...
متن کاملLow-density Parity-check Codes for Wireless Relay Networks
In wireless networks, it has always been a challenge to satisfy high traffic throughput demands, due to limited spectrum resources. In past decades, various techniques, including cooperative communications, have been developed to achieve higher communication rates. This thesis addresses the challenges imposed by cooperative wireless networks, in particular focusing on practical code constructio...
متن کاملDecoding LDPC Convolutional Codes on Markov Channels
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...
متن کاملSpatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the “threshold saturation” effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP)...
متن کامل