Results 171 to 180 of about 1,915 (216)

Two-Phase Globally Coupled Low-Density Parity Check Decoding Aided with Early Termination and Forced Convergence. [PDF]

Sensors (Basel)
Zhu K, Yang H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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-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   +1 more source

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

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   +1 more source

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   +1 more source

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   +1 more source

Multilevel coding with low-density parity-check component codes

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
We design multilevel coding (MLC) schemes with low-density parity-check (LDPC) codes as component codes at each level. We develop a method to analyze the performance of an LDPC code at any level as the codeword length goes to infinity, even if the equivalent binary-input component channels are not symmetric.
Jilei Hou, Paul H. Siegel, Laurence B. Milstein, Henry D. Pfister   +3 more
openaire   +1 more source

The semi-algebra low-density parity-check codes

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004
In this paper, the construction of semi-algebra Low-density parity-check (LDPC) code with an arbitrary block length is presented. The encoding circuit is based on the original semi-algebra design and users can have the choice of using the matrix pattern and various code rates to design for different communication applications. Especially, a novel girth
Yu Yi, Gi Yean Hwang, Moon Ho Lee
openaire   +1 more source