Results 221 to 230 of about 11,054,897 (265)

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
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

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-Lee-Density Parity-Check Codes

ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020
We introduce a new family of linear block codes over $\mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight.
Paolo Santini, Massimo Battaglioni, Franco Chiaraluce, Marco Baldi, Edoardo Persichetti   +4 more
openaire   +2 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, Jin Lu 0002, Haotian Zhang 0002   +2 more
openaire   +2 more sources

Design of Low-Density Parity-Check Codes

IEEE Vehicular Technology Magazine, 2011
This article provides an overview of the conflicting design tradeoffs of low-density parity-check (LDPC) codes and thus advocates a more holistic approach to their design for wireless channels. We reveal some of the intricate interdependencies of the LDPC code parameters and hence recommend designing codes that strike an attractive tradeoff concerning ...
Nicholas Bonello, Sheng Chen 0001, Lajos Hanzo   +2 more
openaire   +1 more source

Low-density parity-check accumulate codes

2010 International Symposium On Information Theory & Its Applications, 2010
This paper presents a class of high-rate codes called low-density parity-check accumulate (LDPCA) codes. The code design is the serial concatenation of an LDPC outer code and an accumulator with an interleaver. The iterative decoding for the LDPCA code design has complexity linear to the code length.
Chung-Li Wang, Shu Lin 0001
openaire   +2 more sources

The renaissance of gallager's low-density parity-check codes

IEEE Communications Magazine, 2003
LDPC codes were invented in 1960 by R. Gallager. They were largely ignored until the discovery of turbo codes in 1993. Since then, LDPC codes have experienced a renaissance and are now one of the most intensely studied areas in coding. In this article we review the basic structure of LDPC codes and the iterative algorithms that are used to decode them.
Richardson, T., Urbanke, R.
openaire   +2 more sources

An Introduction to Low-Density Parity-Check Codes

2002
In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasure channel. We will also give an application of these methods to reliable content delivery.
openaire   +2 more sources

Low Density Parity Check Codes

2016
Besides the turbo codes, there is one more class of linear block codes that makes possible to approach to the Shannon bound. These are Low Density Parity Check (LDPC) codes. They were proposed by Gallager [83]. In principle they have a sparse parity - check matrix.
Predrag Ivaniš, Dušan Drajić
openaire   +1 more source

Low-density parity-check codes

The purpose of this work is to study how to communicate reliably through a noisy communication channel. In particular, we focus on the low-density parity-check error-correcting codes, which were introduced by Robert Gallager in his PhD thesis in 1963.
  +6 more sources