Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Communications

Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels

I. Sutskover, S. Shamai

Published Nov 1, 2005• 1 citation
Publisher

Abstract

Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown-phase additive white Gaussian channel.

DOI
10.1109/tcomm.2005.858637

Related papers

Iterative decoding of low-density Parity-check codes over compound channels

I. Sutskover, Shlomo Shitz Shamai

We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, which is suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown phase additive white Gaussian channel.

IEEE Transactions on Communications•Feb 1, 2006•10 citations

Joint Iterative Decoding of LDPC Codes and Channels with Memory

Henry D. Pfister, Paul H. Siegel

Introduction Sequences of irregular low-density parity-check (LDPC) codes that achieve the capacity of the binary erasure channel (BEC) under iterative decoding were first constructed by Luby, et al. in [11]. This was followed by the work of Chung, et al., which provided evidence suggesting that sequences of iteratively decoded LDPC codes can also achieve the channel capacity of the binary-input additive white Gaussian noise (AWGN) channel [3]. Since then, density evolution (DE) [13] has been used to optimize irregular LDPC codes for a variety of memoryless channels (e.g., [6]), and the results suggest, for each channel, that sequences of iteratively decoded LDPC codes can indeed achieve the channel capacity. In fact, the discovery of a channel whose capacity cannot be approached by LDPC codes would be more surprising than a proof that iteratively decoded LDPC codes can achieve the capacity of any binary-input symmetric channel (BISC). The idea of decoding a code transmitted over a c

•Jan 1, 2007•4 citations

On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels

Amir Bennatan, David Burshtein

We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.

IEEE Transactions on Information Theory•Mar 1, 2004•136 citations

Joint Channel-State Estimation and Decoding of Low-Density Parity-Check Codes on the Two-State Noiseless/Useless BSC Block Interference Channel

Joint Channel-State Estimation and Decoding of Low-Density Parity-Check Codes on the Two-State Noiseless/Useless BSC Block Interference Channel We apply the density-evolution technique to determine the thresholds of low-density parity-check (LDPC) codes when the sum-product algorithm is employed to perform joint channel-state estimation and decoding. The channel considered is the two-state noiseless/useless binary symmetric channel (BSC) block interference channel, where a block of $h$ consecutive symbols shares the same channel state, which is either a noiseless BSC (crossover probability 0) or a useless BSC (crossover probability 1/2). The channel state is selected independently and at random from block to block, according to a known prior distribution. The threshold of the joint channel-state estimation/decoding scheme when used over such a channel is shown to be greatly superior to that of a decoder that makes no attempt to estimate the channel state. These results are also confirmed by simulation. The maximum-likelihood performance of LDPC codes when used over this channel is investigated. Lower bounds on the error exponents of regular LDPC codes, when maximum-likelihood decoded, are shown to be close to the random coding channel-error exponent when the LDPC variable node degree is high.

IEEE Transactions on Communications•Mar 1, 2005•0 citations

Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques

Hossein Pishro-Nik, Faramarz Fekri

This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R1and R2satisfying 0121to R2resulting in asymptotically good codes for all rates R1lesRlesR2. Specifically, this implies that rates arbitrarily close to one are achievable via puncturing. Bounds on the performance of punctured LDPC codes are also presented. It is also shown that punctured LDPC codes are as good as ordinary LDPC codes. For BEC and arbitrary positive numbers R121lesRlesR2is shown. Based on the above observations, a method is proposed to design good punctured LDPC codes over a broad range of rates. Finally, it is shown that the results of this paper may be used for the proof of the existence of the capacity-achieving LDPC codes over binary-input-output-symmetric memoryless channels

IEEE Transactions on Information Theory•Jan 23, 2007•98 citations

Low-Density Parity-Check Codes for Discretized Min-Sum Decoding

B. Smith, Frank R. Kschischang, Wei Yu

The performance of low-density parity-check (LDPC) codes transmitted over a memoryless binary-input continuous output additive white Gaussian noise (AWGN) channel and decoded with quantized min-sum decoding is strongly influenced by the decoder's quantization scheme. This paper presents an efficient algorithm that determines the best uniform scalar quantizer for a particular code. To maximize performance, it is necessary to determine degree distributions that best match the characteristics of the quantized min-sum decoder. Toward this end, an iterative optimization framework that jointly optimizes the degree distributions and the quantizer is presented

Biennial Symposium on Communications•Jul 10, 2006•9 citations
Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown-phase additive white Gaussian channel.
We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, which is suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown phase additive white Gaussian channel.
Introduction Sequences of irregular low-density parity-check (LDPC) codes that achieve the capacity of the binary erasure channel (BEC) under iterative decoding were first constructed by Luby, et al. in [11]. This was followed by the work of Chung, et al., which provided evidence suggesting that sequences of iteratively decoded LDPC codes can also achieve the channel capacity of the binary-input additive white Gaussian noise (AWGN) channel [3]. Since then, density evolution (DE) [13] has been used to optimize irregular LDPC codes for a variety of memoryless channels (e.g., [6]), and the results suggest, for each channel, that sequences of iteratively decoded LDPC codes can indeed achieve the channel capacity. In fact, the discovery of a channel whose capacity cannot be approached by LDPC codes would be more surprising than a proof that iteratively decoded LDPC codes can achieve the capacity of any binary-input symmetric channel (BISC). The idea of decoding a code transmitted over a c
We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.
Joint Channel-State Estimation and Decoding of Low-Density Parity-Check Codes on the Two-State Noiseless/Useless BSC Block Interference Channel We apply the density-evolution technique to determine the thresholds of low-density parity-check (LDPC) codes when the sum-product algorithm is employed to perform joint channel-state estimation and decoding. The channel considered is the two-state noiseless/useless binary symmetric channel (BSC) block interference channel, where a block of hhh consecutive symbols shares the same channel state, which is either a noiseless BSC (crossover probability 0) or a useless BSC (crossover probability 1/2). The channel state is selected independently and at random from block to block, according to a known prior distribution. The threshold of the joint channel-state estimation/decoding scheme when used over such a channel is shown to be greatly superior to that of a decoder that makes no attempt to estimate the channel state. These results are also confirmed by simulation. The maximum-likelihood performance of LDPC codes when used over this channel is investigated. Lower bounds on the error exponents of regular LDPC codes, when maximum-likelihood decoded, are shown to be close to the random coding channel-error exponent when the LDPC variable node degree is high.
This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R1and R2satisfying 0121to R2resulting in asymptotically good codes for all rates R1lesRlesR2. Specifically, this implies that rates arbitrarily close to one are achievable via puncturing. Bounds on the performance of punctured LDPC codes are also presented. It is also shown that punctured LDPC codes are as good as ordinary LDPC codes. For BEC and arbitrary positive numbers R121lesRlesR2is shown. Based on the above observations, a method is proposed to design good punctured LDPC codes over a broad range of rates. Finally, it is shown that the results of this paper may be used for the proof of the existence of the capacity-achieving LDPC codes over binary-input-output-symmetric memoryless channels
The performance of low-density parity-check (LDPC) codes transmitted over a memoryless binary-input continuous output additive white Gaussian noise (AWGN) channel and decoded with quantized min-sum decoding is strongly influenced by the decoder's quantization scheme. This paper presents an efficient algorithm that determines the best uniform scalar quantizer for a particular code. To maximize performance, it is necessary to determine degree distributions that best match the characteristics of the quantized min-sum decoder. Toward this end, an iterative optimization framework that jointly optimizes the degree distributions and the quantizer is presented