Results 311 to 320 of about 196,265 (325)

Constructing low-density parity-check codes

IEEE/AFCEA EUROCOMM 2000. Information Systems for Enhanced Public Safety and Security (Cat. No.00EX405), 2002
A low-density parity-check code (LDPCC) has been constructed for a block size of 10/sup 7/ that provides performance within 0.01 dB of Shannon's limit using iterative belief propagation (IBP) decoding. The LDPCC can be constructed for nearly any code rate and block size and encoding and IBP decoding is practical for many applications. We describe LDPCC
James W. Bond, H. Schmidt, Stefen Hui
openaire   +2 more sources

Enforcing maximum-transition-run code constraints and low-density parity-check decoding

IEEE transactions on magnetics, 2004
We present a novel algorithm for imposing the maximum-transition-run (MTR) code constraint in the decoding of low-density parity-check (LDPC) codes over a partial response channel. This algorithm provides a gain of about 0.2 dB.
R. Todd, J. R. Cruz
semanticscholar   +1 more source

On the Universality of Low-Density Parity-Check Block Codes

2020 54th Annual Conference on Information Sciences and Systems (CISS), 2020
An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this paper we investigate the universality of such sequences. We show that many existing capacity-achieving
Liu, Wei, Urbanke, Rudiger
openaire   +3 more sources

Efficient encoding of quasi-cyclic low-density parity-check codes

IEEE Transactions on Communications, 2005
Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes.
Zongwang Li, Lei Chen, L. Zeng, Shu Lin, W. Fong   +4 more
semanticscholar   +1 more source

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes

IEEE Transactions on Information Theory, 2003
We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. The analysis and optimization of the LDPC component codes for the MLC and BICM schemes are complicated because, in ...
J. Hou, P. Siegel, L. Milstein, H. Pfister   +3 more
semanticscholar   +1 more source

Low-Density Parity-Check Code Constructions

2014
Low-density parity-check (LDPC) codes are a class of linear block code capable of performing extremely close to the capacity of a channel as defined by Shannon. The purpose of this chapter is to provide an overview of the basic ideas, as well as the main results, in the field of LDPC code construction. No attempt could possibly be made to include every
PAOLINI, ENRICO, M. Flanagan
openaire   +1 more source

Rate-compatible punctured low-density parity-check codes with short block lengths

IEEE Transactions on Information Theory, 2006
We consider the problem of rate-compatible puncturing of low-density parity-check (LDPC) codes over additive white Gaussian noise (AWGN) channels. In previous work, it was shown that "good" puncturing distributions exist for LDPC codes but the code ...
Jeongseok Ha, Jaehong Kim, Demijan Klinc, S. McLaughlin   +3 more
semanticscholar   +1 more source

Low-Density Parity-Check (LDPC) Codes

2012
In this chapter, low-density parity-check (LDPC) codes, a class of powerful iteratively decodable error correcting codes, are introduced. The chapter first reviews some basic concepts and results in information theory such as Shannon’s channel capacity and channel coding theorem. It then overviews the Flash memory channel model.
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   +3 more sources

On Gallager's low-density parity-check codes

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We show that low-density parity-check codes are random-like (i.e. their weight distribution resembles that obtained in the average density by random coding), and comment on this result.
openaire   +2 more sources