Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes
作者： Ning Chen , Yongmei Dai , Zhiyuan Yan
关键词: Parallel computing 、 Quantization (signal processing) 、 Parity bit 、 Computer science 、 Decoding methods 、 Sum product decoding 、 Low-density parity-check code
摘要: In this paper, we propose partly parallel architectures based on optimal overlapped sum-product (OSP) decoding. To ensure high throughput and hardware utilization efficiency, parity check pipelined access to memory are utilized. Impacts of different node update algorithms quantization schemes studied. FPGA implementation our proposed for a (1536, 768) (3, 6)-regular QC LDPC code can achieve an estimated 61 Mbps decoding at SNR= 4.5 dB. Finally, noncoherent OSP decoder, which does not always satisfy the data dependency constraints, is that maximum gain 2 achieved all codes.
sci-hub.se 参考文章(11)
T. Zhang, Z. Wang, K.K. Parhi, On finite precision implementation of low density parity check codes decoder international symposium on circuits and systems. ,vol. 4, pp. 202- 205 ,(2001) , 10.1109/ISCAS.2001.922207
M.P.C. Fossorier, Quasicyclic low-density parity-check codes from circulant permutation matrices IEEE Transactions on Information Theory. ,vol. 50, pp. 1788- 1793 ,(2004) , 10.1109/TIT.2004.831841
R.M. Tanner, D. Sridhara, A. Sridharan, T.E. Fuja, D.J. Costello, LDPC block and convolutional codes based on circulant matrices IEEE Transactions on Information Theory. ,vol. 50, pp. 2966- 2984 ,(2004) , 10.1109/TIT.2004.838370
K. Shimizu, T. Ishikawa, N. Togawa, T. Ikenaga, S. Goto, Partially-parallel LDPC decoder based on high-efficiency message-passing algorithm international conference on computer design. pp. 503- 510 ,(2005) , 10.1109/ICCD.2005.83
Yongmei Dai, Zhiyuan Yan, Ning Chen, Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes IEEE Transactions on Very Large Scale Integration Systems. ,vol. 16, pp. 565- 578 ,(2008) , 10.1109/TVLSI.2008.917540
Y. Chen, K.K. Parhi, Overlapped message passing for quasi-cyclic low-density parity check codes IEEE Transactions on Circuits and Systems. ,vol. 51, pp. 1106- 1113 ,(2004) , 10.1109/TCSI.2004.826194
J. Chen, A. Dholakia, E. Eleftheriou, M.P.C. Fossorier, X.-Y. Hu, Reduced-complexity decoding of LDPC codes IEEE Transactions on Communications. ,vol. 53, pp. 1288- 1299 ,(2005) , 10.1109/TCOMM.2005.852852
J. Zhao, F. Zarkeshvari, A.H. Banihashemi, On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes IEEE Transactions on Communications. ,vol. 53, pp. 549- 554 ,(2005) , 10.1109/TCOMM.2004.836563
Yongmei Dai, Zhiyuan Yan, Coset-based quasi-cyclic LDPC codes for optimal overlapped message passing decoding signal processing systems. pp. 762- 767 ,(2005) , 10.1109/SIPS.2005.1579967
F.R. Kschischang, B.J. Frey, H.-A. Loeliger, Factor graphs and the sum-product algorithm IEEE Transactions on Information Theory. ,vol. 47, pp. 498- 519 ,(2001) , 10.1109/18.910572