Low complexity iterative decoding of product codes using a Generalized Array Code form of the Nordstrom-Robinson code

Author(s):  
Haesik Kim ◽  
Garik Markarian ◽  
Valdemar C. da Rocha
ETRI Journal ◽  
2010 ◽  
Vol 32 (4) ◽  
pp. 588-595 ◽  
Author(s):  
Haesik Kim ◽  
Garik Markarian ◽  
Valdemar C. da Rocha, Jr.

Electronics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 122
Author(s):  
Weigang Chen ◽  
Wenting Zhao ◽  
Hui Li ◽  
Suolei Dai ◽  
Changcai Han ◽  
...  

Low-density parity-check (LDPC) codes have the potential for applications in future high throughput optical communications due to their significant error correction capability and the parallel decoding. However, they are not able to satisfy the very low bit error rate (BER) requirement due to the error floor phenomenon. In this paper, we propose a low-complexity iterative decoding scheme for product codes consisting of very high rate outer codes and LDPC codes. The outer codes aim at eliminating the residual error floor of LDPC codes with quite low implementation costs. Furthermore, considering the long simulation time of computer simulation for evaluating very low BER, the hardware platform is built to accelerate the evaluation of the proposed iterative decoding methods. Simultaneously, the fixed-point effects of the decoding algorithms are also be evaluated. The experimental results show that the iterative decoding of the product codes can achieve a quite low bit error rate. The evaluation using field programmable gate array (FPGA) also proves that product codes with LDPC codes and high-rate algebraic codes can achieve a good trade-off between complexity and throughput.


2021 ◽  
Vol 18 (1) ◽  
pp. 49-60
Author(s):  
Weigang Chen ◽  
Ting Wang ◽  
Changeai Han ◽  
Jinsheng Yang

Sign in / Sign up

Export Citation Format

Share Document