Effects of 2-D interleaving and low density parity check (LDPC) codes on burst errors

2007 ◽  
Author(s):  
Lakshmi D. Ramamoorthy ◽  
B. V. K. Vijaya Kumar
Keyword(s):  
Ldpc Codes ◽  
Low Density ◽  
Parity Check ◽  
Low Density Parity Check

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.

AN EXPLORATION OF NON-ASYMPTOTIC LOW-DENSITY, PARITY CHECK ERASURE CODES FOR WIDE-AREA STORAGE APPLICATIONS

2007 ◽  
Vol 17 (01) ◽  
pp. 103-123 ◽  
Author(s):  
JAMES S. PLANK ◽  
MICHAEL G. THOMASON
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Ldpc Codes ◽  
Peer To Peer ◽  
Erasure Codes ◽  
Low Density ◽  
Parity Check ◽  
Finite Systems ◽  
Low Density Parity Check ◽  
Distributed Storage Systems

As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low-Density Parity-Check (LDPC) codes have arisen as alternatives to standard erasure codes, such as Reed-Solomon codes, trading off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems. This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. The three main types of LDPC codes are detailed, and a huge variety of codes are generated, then analyzed using simulation. This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems.

Performance of IEEE 802.11n LDPC codes

2017 ◽  
Vol 11 (22) ◽  
pp. 1065-1073
Author(s):  
Yenny Alexandra Avendano Martinez ◽  
Octavio Jose Salcedo Parra ◽  
Giovanny Mauricio Tarazona Bermudez
Keyword(s):  
Error Detection ◽  
High Performance ◽  
Ldpc Codes ◽  
Low Density ◽  
Parity Check ◽  
Ieee 802.11N ◽  
Noise Environment ◽  
Low Density Parity Check ◽  
Parity Check Codes

LDPC (Low Density Parity Check Codes) is a set of algorithms that send, receive and correct in a noise environment, frames transmitted in a LAN environment. This article demonstrates the high performance of the LDPC in environments of noise, compared to the CRC error detection code highly currently implemented, in this way the efficiency of LDPC is shown specifically over the 802. 11n protocol.

Sign in / Sign up

Export Citation Format

Share Document