Controlled start-up stochastic decoding of LDPC codes
Controlled start-up stochastic decoding of LDPC codes
复制标题
DOI：
10.1109/newcas.2013.6573662
复制
发表时间：
2013-06
期刊：
影响因子：
--
通讯作者：
M. Maamoun;R. Bradai;A. Naderi;R. Beguenane;M. Sawan
中科院分区：
文献类型：
--
作者：
M. Maamoun;R. Bradai;A. Naderi;R. Beguenane;M. Sawan
本文提出了一种新的、功能强大的低密度奇偶校验（LDPC）随机译码算法，称为受控启动随机（CSS）译码，以实现完全并行的LDPC译码器。该算法使用了一个聪明的起点计算方法，以提高收敛性，以及减少延迟的解码过程中，没有显着的硬件复杂性成本。使用这种随机方法，在低信噪比（SNR）区域，短LDPC码可以优于固定点最先进的（2048，1723）LDPC码。为了验证所提算法的性能，在Xilinx Virtex-6 VLX 240 T现场可编程门阵列器件上实现了一个（48，24）LDPC码，并与CSS方法进行了比较。新的算法提供了一个解码速度快7倍，误码率（BER）在E3/N 0 =4.5 dB好百倍。此外，对于（2048，1723）LDPC码，该算法的误码率分别低于E3/N 0 = 3.9dB和Eb/N 0 = 4.3dB，优于6比特偏移最小和算法（OMSA）和6比特和积算法（SPA）。实验结果表明，该算法是第一个在硬件复杂度较低的情况下，性能优于OMSA和SPA算法的随机算法。
This paper concerns a new and powerful Low-Density Parity-Check (LDPC) stochastic decoding algorithm, called Controlled Start-up Stochastic (CSS) decoding, to implement fully parallel LDPC decoders. The proposed algorithm uses a clever starting point computing method to improve the convergence as well as to reduce the latency of the decoding process, without a significant hardware complexity cost. Using this stochastic method, in low signal-to-noise ratio (SNR) region, a short LDPC code can outperforms the fixed point state-of-the-art (2048, 1723) LDPC code. To validate the performance of the proposed algorithm, a (48, 24) LDPC code are implemented on Xilinx Virtex-6 VLX240T field programmable gate array device, with and without the CSS method. The new algorithm provides a decoding speed seven times faster and a Bit Error Rate (BER) hundred times better at E3/N0=4.5 dB. In addition, the results provide a BER better than the 6 bits offset min-sum algorithm (OMSA) and better than the 6 bits sum-product algorithm (SPA) for the (2048, 1723) LDPC code, below E3/N0=3.9 dB and Eb/N0=4.3 dB respectively. The obtained results show that, the proposed algorithm is the first stochastic algorithm which can outperform the OMSA and SPA algorithms, with less hardware complexity.