Convergence Analysis of Iterative Threshold Decoding Process

2007 IEEE International Symposium on Signal Processing and Information Technology, 2007

Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algorithm on the Rayleigh fading channel. Results have shown that the slope of the bit-error rate (BER) curve is as steep as for the Gaussian channel. We also present a comparison between our results and those for convolutional turbo code in terms of BER performance.

2022 5th International Conference on Advanced Communication Technologies and Networking (CommNet)

The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product codes and parallel concatenated codes based on block codes. Numerical results on both AWGN and Rayleigh channels are provided. The performance of iterative decoding of parallel concatenated code (17633,8595) with rate 0.5 is only 1.8 dB away from the Shannon capacity limit at a BER of 10-5 .

setit.rnu.tn

Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algorithm on the Rayleigh fading channel. Results have shown that the slope of the bit-error rate (BER) curve is as steep as for the Gaussian channel. We also present a comparison between our results and those for convolutional turbo code in terms of BER performance.

IEEE Transactions on Information Theory, 2005

Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes and the number of iterations go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability b , but also the block (frame) error probability B , goes to zero as and go to infinity.

2013

In this paper we present a study of the impact of connection schemes on the performance of iterative decoding of Generalized Parallel Concatenated block (GPCB) constructed from one step majority logic decodable (OSMLD) codes and we propose a new connection scheme for decoding them. All iterative decoding connection schemes use a soft-input soft-output threshold decoding algorithm as a component decoder. Numerical result for GPCB codes transmitted over Additive White Gaussian Noise (AWGN) channel are provided. It will show that the proposed scheme is better than Hagenauer's scheme and Lucas's scheme [1] and slightly better than the Pyndiah's scheme.

Ieee Transactions on Communications, 2007

In this paper we present a study of the impact of connection schemes on the performance of iterative decoding of Generalized Parallel Concatenated block (GPCB) constructed from one step majority logic decodable (OSMLD) codes and we propose a new connection scheme for decoding them. All iterative decoding connection schemes use a soft-input soft-output threshold decoding algorithm as a component decoder. Numerical result for GPCB codes transmitted over Additive White Gaussian Noise (AWGN) channel are provided. It will show that the proposed scheme is better than Hagenauer's scheme and Lucas's scheme [1] and slightly better than the Pyndiah's scheme. Keywords—Generalized Parallel concatenated block codes, OSMLD codes, threshold decoding, iterative decoding scheme, and performance.

IEEE Transactions on Communications, 2000

The performance of iterative decoding algorithms for multi-step majority logic decodable (MSMLD) codes of intermediate length is investigated. We introduce a new bit-flipping algorithm that is able to decode these codes nearly as well as a maximum likelihood decoder on the binary symmetric channel. MSMLD codes decoded using bit-flipping algorithms can out-perform comparable BCH codes decoded using standard algebraic decoding algorithms, at least for high bit flip rates (or low and moderate signal to noise ratios).

In this paper, we study the convergence behaviour of a new SISO decoder that we have proposed recently in [1]. The exchange of extrinsic information is used to trace the decoding trajectory in the extrinsic information transfer Chart. That allows foreseeing the turbo cliff position. The influence of concatenated scheme as well as different constituent codes on the convergence behaviour is investigated for product and generalized serially and parallel concatenated codes. Simulation result shows that the thresholds obtained by EXIT chart and BER curves are almost the same.

JPL TDA Progress …, 1996