Memory-efficient and high-troughput decoding of quasi-cylic LDPC codes

IEEE Transactions on Communications

Volumn 57, Issue 4, 2009, Pages 879-883

  Dai, Yongmei ^a   Yan, Zhiyuan ^a   Chen, Ning ^a  

^a Lehigh University   (United States)

Author keywords

EXIT charts; LDPC; Quasi cyclic; Shuffled decoding; Sum product decoding; Turbo decoding

Indexed keywords

EXIT CHARTS; LDPC; QUASI-CYCLIC; SHUFFLED DECODING; SUM-PRODUCT DECODING; TURBO DECODING;

COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; GRAPHIC METHODS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; SIGNAL ENCODING; TRAVELING SALESMAN PROBLEM; TURBO CODES;

DECODING;

EID: 65649120443     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.04.060349     Document Type: Article

References (17)

1. R. G. Gallager, Low Density Parity Check Codes. MIT Press, 1963.
2. F.R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
3. M. M. Mansour and N. R. Shanbhag, "High throughput LDPC decoders," IEEE Trans. VLSI Systems, vol. 11, pp. 976-996, Dec. 2003.
4. H. Sankar and K. Narayanan, "Memory-efficient sum-product decoding of LDPC codes," IEEE Trans. Commun., vol. 52, pp. 1225-1230, Aug. 2004.
5. H. Kfir and I. Kanter, "Parallel versus sequential updating for belief propagation decoding," Physica A, vol. 330, pp. 259-270, Dec. 2003.
6. J. Zhang and M. P. C. Fossorier, "Shuffled belief propagation decoding," in Proc. Asilomar Conf. on Signals, Systems and Computers vol. 1, pp. 8-15, Nov. 2002.
7. P. Radosavljevic, A. de Baynast, and J. R. Cavallaro, "Optimized message passing schedules for LDPC decoding," in Proc. Asilomar Conf. on Signals, Systems and Computers, Nov. 2005.
8. Y. Mao and A. H. Banihashemi, "Decoding low-density parity-check codes with probability scheduling," IEEE Commun. Lett., vol. 5, pp. 414-416, Oct. 2001.
9. H. Xiao and A. H. Banihashemi, "Graph-based message-passing schedules for decoding LDPC codes," IEEE Trans. Commun., vol. 52, pp. 2098-2105, Dec. 2004.
10. A. Nouh and A. H. Banishemi, "Reliability-based schedule for bitflipping decoding of low-density parity-check codes," IEEE Trans. Commun., vol. 52, pp. 2038-2040, Dec. 2004.
11. E. Sharon, S. Litsyn, and J. Goldberger, "An efficient message-passing schedule for LDPC decoding," in Proc. Electrical and Electronics Engineer in Israel, pp. 223-226, Sept. 2004.
12. Y. Wang, J. Zhang, M. Fossorier, and J. S. Yedidia, "Reduced latency iterative decoding of LDPC codes," in Proc. Global Telecomun. Conf. (Globecom), vol. 3, pp. 1199-1204, Dec. 2005.
13. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inform. Theory, vol. 50, pp. 2966-2984, Dec. 2004.
14. Y. Chen and K. K. Parhi, "Overlapped message passing for quasi-cyclic low density parity check codes," IEEE Trans. Circuits and Systems vol. 51, pp. 1106-1113, June 2004.
15. Y. Dai, N. Chen, and Z. Yan, "Memory-efficient decoder architectures for quasi-cyclic LDPC codes," accepted and to appear in IEEE Trans. Circuits and Systems.
16. S. Tong and X. Wang, "A simple convergence comparison of Gallager codes under two message-passing schedules," IEEE Commun. Lett., vol. 9, pp. 249-251, Mar. 2005.
17. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, pp. 670-678, Apr. 2004.