Results 141 to 150 of about 6,933 (191)

Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory, 2001
Summary: Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. In this paper, we consider the encoding problem for LDPC codes.
T J Richardson, Rüdiger Urbanke
exaly   +2 more sources

Low-Density Parity-Check Codes

2009
AbstractLow-density parity-check (LDPC) codes are among the most efficient error correcting codes in use. This chapter introduces an important family of LDPC ensembles, based on random factor graphs, and studies some of their basic properties. It focuses on performances under optimal decoding, when no constraint is imposed on the computational ...
Marc Mézard, Andrea Montanari
  +6 more sources

Low-Density Parity-Check codes [PDF]

open access: yes, 2010
Transmition of data over various communication systems is lossy, because of all the noise affecting the communication channel. One of the most useful ways to achieve reliable transmision are error correcting codes. Recently, low-density parity-check codes became very popular.
Kralj, Gregor
openaire   +3 more sources

Structured low-density parity-check codes

IEEE Signal Processing Magazine, 2004
This article describes the different methods to design regular low density parity-check (LDPC) codes with large girth. In graph terms, this corresponds to designing bipartite undirected regular graphs with large girth. Large girth speeds the convergence of iterative decoding and improves the performance at least in the high SNR range, by slowing down ...
José M. F. Moura   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy