Replica horizontal-shuffled iterative decoding of low-density parity-check codes

doi:10.1016/S1005-8885(09)60522-7

中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (6): 32-40.doi: 10.1016/S1005-8885(09)60522-7

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

杨洋¹,黄建忠²,童胜²,王新梅¹

State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China

收稿日期:2010-05-10 修回日期:2010-07-18 出版日期:2010-12-30 发布日期:2010-12-06
通讯作者: 杨洋 E-mail: yy.xidian@gmail.com
基金资助:
973项目;国家自然基金课题;111基地项目

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China

Received:2010-05-10 Revised:2010-07-18 Online:2010-12-30 Published:2010-12-06
Contact: Yang YANG E-mail: yy.xidian@gmail.com
Supported by:
973 Project;the 111 Project

摘要/Abstract

摘要：

For practical considerations, it is essential to accelerate the convergence speed of the decoding algorithm used in an iterative decoding system. In this paper, replica versions of horizontal-shuffled decoding algorithms for low-density parity-check (LDPC) codes are proposed to improve the convergence speed of the original versions. The extrinsic information transfer (EXIT) chart technique is extended to the proposed algorithms to predict their convergence behavior. Both EXIT chart analysis and numerical results show that replica plain horizontal-shuffled (RPHS) decoding converges much faster than both plain horizontal-shuffled (PHS) decoding and the standard belief-propagation (BP) decoding. Furthermore, it is also revealed that replica group horizontal- shuffled (RGHS) decoding can increase the parallelism of RPHS decoding as well as preserve its high convergence speed if an equivalence condition is satisfied, and is thus suitable for hardware implementation.

关键词:

replica, shuffled decoding, LDPC codes, EXIT chart, convergence speed

Abstract:

Key words:

replica, shuffled decoding, LDPC codes, EXIT chart, convergence speed

中图分类号:

TN911.22

参考文献

1. Gallager R G. Low-density parity-check codes. Cambridge, MA, USA: MIT Press, 1963

2. MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes. Electronics Letters, 1996, 32(18): 1645-1646

3. Vila Casado A I, Griot M, Wesel R D. Informed dynamic scheduling for belief-propagation decoding of LDPC codes. Proceedings of the IEEE International Conference on Communications (ICC’07), Jun 24-28, 2007, Glasgow, UK. Piscataway, NJ, USA: IEEE, 2007: 932-937

4. Vila Casado A I, Griot M, Wesel R D. Improving LDPC decoders via informed dynamic scheduling. Proceedings of the IEEE 2007 Information Theory Workshop (ITW’07), Sep 2-6, 2007, Lake Tahoe, CA, USA. Piscataway, NJ, USA: IEEE, 2007: 208-213

5. Kim J H, Nam M Y, Song H Y, et al. Variable-to-check residual belief propagation for informed dynamic scheduling of LDPC Codes. Proceedings of the IEEE 2008 International Symposium on Information Theory and Its Applications (ISITA’08), Dec 7-10, 2008, Auckland, New Zealand. Piscataway, NJ, USA: IEEE, 2008: 1-4

6. Kim J H, Nam M Y, Song H Y. Variable-to-check residual belief propagation for LDPC codes. Electronics Letters, 2009, 45(2): 117-118

7. Mansour M M, Shanbhag N R. High-throughput LDPC decoders. IEEE Transactions on Very Large Scale Integration Systems, 2003, 11(6): 976-996

8. Zhang J, Fossorier M P C. Shuffled iterative decoding. IEEE Transactions on Communications, 2005, 53(2): 209-213

9. Tong S, Wang X M. A simple convergence comparison of Gallager codes under two message-passing schedules. IEEE Communications Letters, 2005, 9(3): 249-251

10. Sharon E, Litsyn S, Goldberger J. Efficient serial message-passing schedules for LDPC decoding. IEEE Transactions on Information Theory, 2007, 53(11): 4076-4091

11. Zhang J, Wang Y, Fossorier M P C, et al. Iterative decoding with replicas. IEEE Transactions on Information Theory, 2007, 53(5): 1644-1663

12. Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory, 2004, 50(8): 1788-1793

13. Brink S T. Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Transactions on Communications, 2001, 49(10): 1727-1737

14. Brink S T, Kramer G, Ashikhmin A. Design of low-density parity-check codes for modulation and detection. IEEE Transactions on Communications, 2004, 52(4): 670-678

15. Richardson T J, Shokrollahi A, Urbanke R. Design of capacity-approaching low-density parity-check codes. IEEE Transactions on Information Theory, 2001, 47(2): 619-637

16. Tüchler M, Hagenauer J. EXIT charts of irregular codes. Proceedings of the 36th Conference on Information Science and Systems (CISS’02), Mar 20-22, 2003, Princeton, NJ, USA. Piscataway, NJ, USA: IEEE, 2002: 6p

[1]	王帅 HONG Wei-jun PENG Biao 李书芳. Novel error resilient tag estimation for RFID system in interference scenarios [J]. Acta Metallurgica Sinica(English letters), 2013, 20(4): 116-121.
[2]	唐永生朱士信. Chinese product of constacyclic and cyclic codes over finite rings[J]. Acta Metallurgica Sinica(English letters), 2013, 20(3): 109-113.
[3]	张磊袁婷婷张欣杨大成. Combined simplified maximum likelihood and sphere decoding algorithm for MIMO system[J]. Acta Metallurgica Sinica(English letters), 2008, 15(2): 56-59.

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

本文评价