Results 1 - 10 of 346

Design of capacity-approaching irregular low-density parity-check codes

by Thomas J. Richardson, M. Amin Shokrollahi, Rüdiger L. Urbanke - IEEE TRANS. INFORM. THEORY , 2001
"... We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract - Cited by 588 (6 self) - Add to MetaCart
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming

Iterative (turbo) soft interference cancellation and decoding for coded CDMA

by Xiaodong Wang, H. Vincent Poor - IEEE Trans. Commun , 1999
"... Abstract — The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuse ..."
Abstract - Cited by 456 (18 self) - Add to MetaCart
multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive softoutput decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each

Reduced-Complexity Decoding of LDPC Codes

by Jinghu Chen, Ajay Dholakia, Evangelos Eleftheriou, Marc P. C. Fossorier, Xiao-yu Hu , 2005
"... Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthe ..."
Abstract - Cited by 102 (2 self) - Add to MetaCart
Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described

Fettweis, “Comparison of LDPC block and LDPC convolutional codes based on their decoding latency

by Najeeb Ul Hassan, Michael Lentmaier, Gerhard P. Fettweis - in Proc. Int. Symp. Turbo Codes Iterative Inf. Process., Gothenburg, Sweden , 2012
"... Abstract—We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract—We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation

LDPC block and convolutional codes based on circulant matrices

by R. Michael Tanner, Deepak Sridhara, Arvind Sridharan, Thomas E. Fuja, Daniel J. Costello - IEEE TRANS. INFORM. THEORY , 2004
"... A class of algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes and their convolutional counterparts is presented. The QC codes are described by sparse parity-check matrices comprised of blocks of circulant matrices. The sparse parity-check representation allows for prac ..."
Abstract - Cited by 93 (8 self) - Add to MetaCart
LDPC codes for short to moderate block lengths. The performance of the LDPC convolutional codes is superior to that of the QC codes on which they are based; this performance is the limiting performance obtained by increasing the circulant size of the base QC code. Finally, a continuous decoding

High-Throughput LDPC decoders

by Mohammad M. Mansour, Naresh R. Shanbhag, Senior Member - IEEE Trans. on Very Large Scale Integration Systems , 2003
"... Abstract—A high-throughput memory-efficient decoder architecture for low-density parity-check (LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture benefits from various optimizations performed at three levels of abstraction in system design—namely LDPC code design, de ..."
Abstract - Cited by 107 (1 self) - Add to MetaCart
Abstract—A high-throughput memory-efficient decoder architecture for low-density parity-check (LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture benefits from various optimizations performed at three levels of abstraction in system design—namely LDPC code design

Low-power VLSI decoder architectures for LDPC codes

by Mohammad M Mansour , Naresh R Shanbhag - in Low Power Electronics and Design, 2002. ISLPED02. Proceedings of the 2002 International Symposium on , 2002
"... ABSTRACT Iterative decoding of low-density parity check codes (LDPC) using the message-passing algorithm have proved to be extraordinarily effective compared to conventional maximumlikelihood decoding. However, the lack of any structural regularity in these essentially random codes is a major chall ..."
Abstract - Cited by 30 (4 self) - Add to MetaCart
challenge for building a practical low-power LDPC decoder. In this paper, we jointly design the code and the decoder to induce the structural regularity needed for a reduced-complexity parallel decoder architecture. This interconnect-driven code design approach eliminates the need for a complex

Low-density parity-check codes based on finite geometries: A rediscovery and new results

by Yu Kou, Shu Lin, Marc P. C. Fossorier - IEEE Trans. Inform. Theory , 2001
"... This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and thei ..."
Abstract - Cited by 186 (8 self) - Add to MetaCart
and their Tanner graphs have girth T. Finite-geometry LDPC codes can be decoded in various ways, ranging from low to high decoding complexity and from reasonably good to very good performance. They perform very well with iterative decoding. Furthermore, they can be put in either cyclic or quasi-cyclic form

Efficient Encoding of Low-Density Parity-Check Codes

by Thomas J. Richardson, Rüdiger L. Urbanke , 2001
"... 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 ..."
Abstract - Cited by 183 (3 self) - Add to MetaCart
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

Design of Generalized LDPC Codes and their Decoders

by Shadi Abu-surra, Gianluigi Liva, William E. Ryan
"... Abstract — We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nod ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract — We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC
Results 1 - 10 of 346