Error Exponents for Two Soft-Decision Decoding Algorithms of Reed–Muller Codes

2009 ◽  
Vol 55 (9) ◽  
pp. 4108-4118 ◽  
Author(s):  
Marat V. Burnashev ◽  
Ilya Dumer

The use of decoding algorithms allows us to retrieve information after transmitting it over a noisy communication channel. Soft decision decoding is powerful in concatenation schemes that use two or more levels of decoding. In our case, we make a concatenation between the Hartmann & Rudolph (HR) algorithm as symbol-by-symbol decoder and the chase-2 algorithm that is word-to-word decoding algorithm. In this paper, we propose to combine two decoding algorithms for constructing a new one with more efficiency and less complexity. This work consists firstly to use the HR with a reduced number of codewords of the dual code then the Chase-2 algorithm which exploits the output of PHR. The simulations results and the comparisons made show that the proposed decoding scheme guarantees very good performance with reduced temporal complexity.


2011 ◽  
Vol 271-273 ◽  
pp. 452-457
Author(s):  
Zhong Xun Wang ◽  
Fang Qiang Zhu ◽  
Li Liu ◽  
Juan Wang

In this paper, we introduce a new bit-flipping decoding algorithm for low-density parity-check codes based on loop detection mechanism, which is an extension to soft-decision decoding. This decoding algorithm's performance has been significantly improved by introducing a loop detection mechanism for the failed flipping bit and leading into the soft-decision about the reliability measure of the received symbols. Theoretical analysis shows that the complexity of this algorithm is lower. Some simulation results are given, which show that compared with other known kinds of bit-flipping decoding algorithms for LDPC codes, this new decoding on the additive white Gaussian noise channel offer excellent performance.


Sign in / Sign up

Export Citation Format

Share Document