Results 261 to 270 of about 38,968 (301)
Some of the next articles are maybe not open access.
Multilevel coding with low-density parity-check component codes
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002We 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 +3 more
openaire +1 more source
An Introduction to Low-Density Parity-Check Codes
2002In 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
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
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 +2 more sources
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
The semi-algebra low-density parity-check codes
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004In 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