Chinese Control Conference (CCC)

FPGA Implementation Scheme of Mixed Logarithmic Domain FFT-BP Decoding Algorithm Based on Non-Binary LDPC Codes

Ziyong Wang, Jiahui Meng, Deng Zhibin, Liang Zhang, Jingpeng Gao

Published Jul 1, 2018• 1 citation

Abstract

In this paper, an improved decoding algorithm for Non-binary low density parity check (NB-LDPC) codes with low decoding complexity and suitable for field-programmable gate array (FPGA) implementation is proposed, which is a mixed logarithmic domain FFT-BP decoding algorithm (Mixed Log-FFT-BP) for the problem of high complexity of the existing decoding algorithms for Non-binary LDPC codes. The algorithm combines the traditional Log-BP algorithm with the FFT-BP algorithm, and simplifies the update of the check nodes in the iterative decoding process. A large number of convolution operations are converted into multiplication operations in frequency domain by using FFT transform and IFFT transform. The multiplication of the original FFT-BP algorithm is converted into the addition and look-up table operations in the logarithmic domain. Then, the logarithm of the probability information is directly solved, so that it can be decoded in the logarithmic domain, which saves the computation of the log likelihood ratio, and then reduces the complexity. Simulation results show that under the additive Gauss white noise channel, when the bit error rate is 10-5, compared with BP algorithm, Log-Bp algorithm and FFT-BP algorithm, the performance of Mixed Log-FFT-BP algorithm is not decreased, and all of them remain within the range of 0.1-0.2dB.

DOI: 10.23919/chicc.2018.8483120

Related papers

An Improved Decoding Algorithm of Non binary LDPC Code

Haili Hong, Zhuo Kai Sun

An improved decoding algorithm is presented in order to solve the problem of inconvenient for hardware implementation in decoding algorithm for non-binary LDPC codes based on the FFT-BP algorithm. The innovation of the new algorithm is the importing of the logarithmic operations, which will transform multiplication operations to addition operations in the logarithmic domains. Thus the presented algorithm has the advantages of the reduced complexity and the more convenient hardware implementation. A simulation is made using regular non binary LDPC codes under White Gaussian Noise channel based on GF(4). The result shows that the decoding complexity is much more reduced with the performance decrease by about 0.07 dB when BER( Bit Error Rate )is 10-4.

International Conference of Information Technology, Computer Engineering and Management SciencesSep 1, 20114 citations

Performance Analysis of High-rate Non-binary LDPC Codes Under AWGN Channels

Jie Bao

To solve the problem of high computational complexity and inconvenient for hardware implementation in original decoding algorithm for non-binary LDPC codes,two simplified decoding algorithms are introduced for nonbinary LDPC codes: the fast Fourier transform belief propagation(FFT-BP) decoding algorithm and the Log-domain belief propagation(Log-BP) decoding algorithm. The performance comparison between two different decoding algorithms for LDPC Codes over GF(q) is investigated at high code rates(1/2~1) over AWGN channel.The performance curves show that by the decreasing of code rate,both coding gains and the distances from Shannon limit increase with the two algorithms,which means that non-binary LDPC Codes are suit for applications at high rates.Meanwhile it is shown that Log-BP decoding algorithm may contribute a considerable improvement in computational complexity at the cost of sacrificing some performance, which is important for Log-BP decoding algorithm to be applied in hardware implementation.

Journal of Chongqing University. English EditionJan 1, 20070 citations

Decoder FPGA Implementation

Wojciech Sułek

The non-binary Low Density Parity Check (LDPC) codes over Galois Fields GF(q = 2 p ) have evolved from the binary LDPC codes that are today an industry standard for channel coding. The performance of short block length codes is significantly higher for non-binary LDPC, at the cost of increased decoding complexity. The efficient decoder hardware implementation is still a challenging task. Most of the recently proposed hardware realizations are ASIC-oriented as they employ multiplierless computation units. This article concerns a different decoder design approach that is specifically intended for an FPGA implementation. The reformulated mixed-domain FFT-BP decoding algorithm is applied that does not exclude the multiplication units. This allows mapping a part of the algorithm to the multiplier cores embedded in an FPGA. In this article we concentrate on the important issue of the proper selection of the numeric precision employed. We present the partially parallel extension of the mixed-domain decoder that operates for the structured codes. Then we carefully analyze the finite precision effects on the decoding performance. By simulation and synthesis results we show that it is advantageous to segment the decoder dataflow into 3 parts with different precision. The provided results also facilitate the precision selection for maximum performance or for some performance- complexity tradeoff. Index Terms—Error correcting codes, LDPC codes, Non- binary codes, Iterative decoder, Hardware decoder

Jan 1, 20150 citations

Research on encoding and decoding algorithms of non-binary LDPC code and FPGA implementation

Zhongxun Wang, Baojun Liu, Min Zhang +1 more

Low density parity check (LDPC) code is a kind of linear block code with excellent performance which is proposed by Dr. Gallager. It overcomes the shortcomings of other error correcting codes and it is the nearest channel code from Shannon limit at the present discover. The decoding algorithms of L DPC code can reduce the decoding delay by the parallel decoding structure, so this has caused great concern in many fields. In recent years more and more scholars begin to study LDPC code, this makes the coding and decoding algorithms of LDPC code improved continuously. LDPC code has been widely used in many fields such as optical fiber communication, digital watermarking, underwater communication and deep space communication because of its excellent performance. Non-binary LDPC code has better performance compared with binary LDPC code. In this paper, FFT-BP decoding algorithm of non-binary LDPC code is studied, and on this basis, we proposed an improved FFT-BP algorithm. The improved decoding algorithm can effectively reduce the average iteration number. Finally, we achieved encode and decode algorithm of non-binary LDPC code with FPGA.

Journal of Computational Methods in Sciences and EngineeringAug 20, 20191 citation

Performance Advantage of Non-binary LDPC Codes At High Code Rate under AWGN Channel

Long Ma, Lin Wang, Jianwen Zhang

Two different decoding algorithms for non-binary LDPC codes: the fast Fourier transform belief propagation (FFT-BP) decoding algorithm and the Log-domain belief propagation (Log-BP) decoding algorithm are introduced in this paper. Their performance advantage of two different decoding algorithms for LDPC Codes over GF(q) is investigated at high code rates (1/2~1) over AWGN channel. The performance curves show that with the decreasing of code rate, both coding gains and the distances from Shannon limit increase under the two algorithms, which means for non- binary LDPC Codes to be suitable for applications at high rates. Meanwhile it is shown that Log-BP decoding algorithm may contribute a considerable saving in computational complexity at the cost of sacrifice small performance, which is important for Log-BP decoding algorithm to be applied in hardware implementation.

IEEE International Conference on Communication Technology (ICCT)Nov 1, 20066 citations

Fourier domain decoding algorithm of non-binary LDPC codes for parallel implementation

Kenta Kasai, K. Sakaniwa

For decoding non-binary low-density parity-check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worse, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.

IEEE International Conference on Acoustics Speech and Signal ProcessingMay 1, 20114 citations