Results 181 to 190 of about 1,915 (216)
Some of the next articles are maybe not open access.
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
Low Density Parity Check Codes
2016Besides 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
Architecture-aware low-density parity-check codes
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03., 2003A high-throughput memory-efficient decoder architecture for architecture-aware low-density parity-check (LDPC) codes is proposed based on a novel turbo-decoding algorithm. The architecture benefits from various optimizations at the code-design, decoding algorithm, and decoder architecture levels. The interconnect complexity and memory overhead problems
Mohammad M. Mansour, Naresh R. Shanbhag
openaire +1 more source
Low-Density Parity-Check Codes
1963This is a complete presentation of all important theoretical and experimental work done on low-density codes. Low-density coding is one of the three techniques thus far developed for efficient communication over noisy channels with an arbitrarily low probability of error. A principal result of information theory is that if properly coded information is
openaire +1 more source
Low-Density Parity-Check Codes for ATSC 3.0
IEEE Transactions on Broadcasting, 2016In this paper, we introduce the overview and detailed structure of low-density parity-check (LDPC) codes, which are adopted for the physical layer standard of Advanced Television Systems Committee (ATSC) 3.0. As one of the features to mitigate channel errors efficiently, LDPC codes are used as a main part of forward error correction scheme within the ...
Kyung-Joong Kim 0002 +7 more
openaire +1 more source
Low Density Parity Check Codes
2014The Tanner graph is described. A girth in the Tanner graph is equivalent to a short cycle of 1- symbols in the parity check matrix. The condition called row-column constraint is introduced, in order to allow practical decoding procedures. They are based on the sum-product algorithm, which is briefly outlined.
openaire +2 more sources
Iterative encoding of low-density parity-check codes
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2004Motivated by the potential to reuse the decoder architecture, and thus reduce circuit space, we explore the use of iterative encoding techniques which are based upon the graphical representation of the code. We design codes by identifying associated encoder convergence constraints and also eliminating some well known undesirable properties for sum ...
David Haley +2 more
openaire +1 more source
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory, 2006We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative ...
Changyan Di +2 more
openaire +1 more source
Low Density Parity Check Codes
2020A linear code with a check matrix in which each column has few non-zero entries is called a low density parity check code or, for brevity, an LDPC code. These codes were introduced in the 1960s by Gallager who proved that probabilistic constructions of such matrices produce asymptotically good linear codes. Moreover, he observed that LDPC codes perform
openaire +1 more source
Low Density Parity Check Codes
2015Low density parity check (LDPC) codes are forward error-correction codes, invented by Robert Gallager in his MIT Ph.D. dissertation, 1960. The LDPC codes are ignored for long time due to their high computational complexity and domination of highly structured algebraic block and convolutional codes for forward error correction.
openaire +1 more source