Results 251 to 260 of about 38,968 (301)

Significant Reduction Of Bit Error Rate in 5G-GFDM System Using Concatenated Turbo Code with Low Density Parity Check Code in Fading Channels

, 2018
Hocine Merah, Mokhtaria Mesri, Khaled Tahkoubit   +2 more
openalex   +1 more source

Data storage and retrieval with unnatural proteins expressed via E. coli. [PDF]

Nat Commun
Zhou Y, Ng CCA, Liu C, Tam WM, Lau FCM, Yao ZP.   +5 more
europepmc   +1 more source

Estimation of the Impulse Response of the AWGN Channel with ISI within an Iterative Equalization and Decoding System That Uses LDPC Codes. [PDF]

Entropy (Basel)
Cuc AM, Morgoș FL, Grava AM, Grava C.
europepmc   +1 more source

Optimized decoder for low-density parity check codes based on genetic algorithms

Hajar El Ouakili, Mohammed El Ghzaoui, Rachid El Alami   +2 more
openalex   +2 more sources

Non-Binary Low Density parity Check Codes

, 2016
Patrick Schulte
openalex   +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-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