Performance study on implementation of DVB-S2 low density parity check codes on additive white Gaussian noise channel and Rayleigh fading channel

2012 ◽  
Author(s):  
Hanady Hussien ◽  
Khaled Ali Shehata ◽  
Mohamed Khedr ◽  
Sherry Hareth
Keyword(s):  
Gaussian Noise ◽  
Fading Channel ◽  
Rayleigh Fading ◽  
Additive White Gaussian Noise ◽  
White Gaussian Noise ◽  
Low Density ◽  
Parity Check ◽  
Performance Study ◽  
Low Density Parity Check ◽  
Parity Check Codes

scholarly journals A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chakir Aqil ◽  
Ismail Akharraz ◽  
Abdelaziz Ahaitouf
Keyword(s):  
Gaussian Noise ◽  
Additive White Gaussian Noise ◽  
Ldpc Codes ◽  
Low Density ◽  
Parity Check ◽  
Coding Gain ◽  
Decoding Complexity ◽  
Low Density Parity Check ◽  
Awgn Channel ◽  
Infinite Loop

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low-Density Parity-Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.

scholarly journals The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes

2010 ◽  
Vol 2010 ◽  
pp. 1-17 ◽  
Author(s):  
Eric Psota ◽  
Lance C. Pérez
Keyword(s):  
Iterative Decoding ◽  
Additive White Gaussian Noise ◽  
Low Density ◽  
Parity Check ◽  
Trapping Sets ◽  
Absorbing Sets ◽  
Stopping Sets ◽  
Low Density Parity Check ◽  
Computation Trees ◽  
Parity Check Codes

The error mechanisms of iterative message-passing decoders for low-density parity-check codes are studied. A tutorial review is given of the various graphical structures, including trapping sets, stopping sets, and absorbing sets that are frequently used to characterize the errors observed in simulations of iterative decoding of low-density parity-check codes. The connections between trapping sets and deviations on computation trees are explored in depth using the notion ofproblematictrapping sets in order to bridge the experimental and analytic approaches to these error mechanisms. A new iterative algorithm for finding low-weight problematic trapping sets is presented and shown to be capable of identifying many trapping sets that are frequently observed during iterative decoding of low-density parity-check codes on the additive white Gaussian noise channel. Finally, a new method is given for characterizing the weight of deviations that result from problematic trapping sets.

scholarly journals Low Density Parity Check Codes Constructed from Hankel Matrices

2018 ◽  
Vol 3 ◽  
pp. 37-41
Author(s):  
Mohammed Amine Tehami ◽  
Ali Djebbari
Keyword(s):  
Channel Coding ◽  
Additive White Gaussian Noise ◽  
Hankel Matrix ◽  
Low Density ◽  
Parity Check ◽  
Hankel Matrices ◽  
Permutation Matrices ◽  
Low Density Parity Check ◽  
The Matrix ◽  
Parity Check Codes

In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4. To ensure that parity check bits can be recursively calculated with linear computational complexity, a dual-diagonal structure is applied to the parity check matrices of those codes. The proposed codes provide a very low encoding complexity and reduce the stored memory of the matrix H in which this matrix can be easily implemented comparing to others codes used in channel coding. The new LDPC codes are compared, by simulation, with uncoded bi-phase shift keying (BPSK). The result shows that the proposed codes perform very well over additive white Gaussian noise (AWGN) channels.

Sign in / Sign up

Export Citation Format

Share Document