A Soft-Decision Recursive Decoding Algorithm Using Iterative Bounded-Distance Decoding for u|u+v Codes

2014 ◽  
Vol E97.A (4) ◽  
pp. 996-1000
Author(s):  
Hitoshi TOKUSHIGE
Keyword(s):  
Soft Decision ◽  
Decoding Algorithm ◽  
Bounded Distance

Nonbinary Low-Density Parity Check Decoding Algorithm Research-Based Majority Logic Decoding

2020 ◽  
Vol 34 (12) ◽  
pp. 2058016
Author(s):  
Zhong-xun Wang ◽  
Yang Xi ◽  
Zhan-kai Bao
Keyword(s):  
Error Correction ◽  
Iterative Decoding ◽  
Hamming Distance ◽  
Low Density ◽  
Parity Check ◽  
Soft Decision ◽  
Decoding Algorithm ◽  
Majority Logic ◽  
Low Density Parity Check ◽  
Majority Logic Decoding

In the nonbinary low-density parity check (NB-LDPC) codes decoding algorithms, the iterative hard reliability based on majority logic decoding (IHRB-MLGD) algorithm has poor error correction performance. The essential reason is that the hard information is used in the initialization and iterative processes. For the problem of partial loss of information, when the reliability is assigned during initialization, the error correction performance is improved by modifying the assignment of reliability at initialization. The initialization process is determined by the probability of occurrence of the number of erroneous bits in the symbol and the Hamming distance. In addition, the IHRB-MLGD decoding algorithm uses the hard decision in the iterative decoding process. The improved algorithm adds soft decision information in the iterative process, which improves the error correction performance while only slightly increasing the decoding complexity, and improves the reliability accumulation process which makes the algorithm more stable. The simulation results indicate that the proposed algorithm has a better decoding performance than IHRB algorithm.

Sign in / Sign up

Export Citation Format

Share Document