The construction algorithm of bipartite graphs for a type of capacity-approaching LDPC erasure codes

被引：0
|
作者：
Mu J.-J. [1 ,2 ,3 ]
Jiao X.-P. [1 ,2 ,3 ]
Cao X.-Z. [1 ]
机构：
[1] School of Computer Science and Technology, Xidian Univ.
[2] Key Lab. of Information Coding and Transmission, Southwest Jiaotong Univ.
[3] State Key Lab. of Integrated Service Networks, Xidian Univ.
来源：
Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | 2010年 / 37卷 / 04期
关键词：
Capacity-achieving sequence; Construction algorithm of bipartite graphs; Low-density parity-check codes; Tornado codes;
D O I：
10.3969/j.issn.1001-2400.2010.04.022
中图分类号：
学科分类号：
摘要：
Tornado code is an important kind of low-density parity-check codes. It is shown that the Heavy-Tail/Poisson sequence is capable of achieving the capacity of the binary erasure channel. The construction algorithm for random bipartite graphs in the design of Tornado codes is proposed in this paper. By analyzing the distribution of Heavy-Tail/Poisson degree sequences of Tornado codes, a parameter-selection rule used to design Tornado codes is presented. Simulation results show the correctness of the parameter-selection rule. The construction algorithm for random bipartite graphs and the parameter-selection rule presented will be helpful in the design and its engineering application of Tornado codes.
引用
收藏
页码：705 / 709
页数：4
相关论文
共 10 条
  • [1] Elias P., Coding for two noisy channels, Proc Third London Symp. Information Theory, pp. 61-76, (1955)
  • [2] Peng X.H., Erasure-control coding for distributed networks, IEE Proceedings Communications, 152, 6, pp. 1075-1080, (2005)
  • [3] Mu J., Performance analysis of regular low-density erasure codes, Chinese Journal of Electronics, 17, 2, pp. 377-380, (2008)
  • [4] Shokrollahi A., Capacity-achieving sequences, Codes, Systems and Graphical Models (IMA Volumes in Mathematics and Its Applications), pp. 153-166, (2000)
  • [5] Oswald P., Shokrollahi M.A., Capacity-achieving sequences for the erasure channel, IEEE Trans on Inform Theory, 48, 12, pp. 3017-3028, (2002)
  • [6] Richardson T., Shokrollahi A., Urbanke R., Design of capacity approaching irregular low-density parity-check codes, IEEE Trans on Inform Theory, 47, 2, pp. 619-637, (2001)
  • [7] Vellambi B.N., Fekri F., Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channel, IEEE Trans on Inform Theory, 53, 4, pp. 1510-1520, (2007)
  • [8] Luby M.G., Mitzenmacher M., Shokrollahi M.A., Et al., Efficient erasure correcting codes, IEEE Trans on Inform Theory, 47, 2, pp. 569-584, (2001)
  • [9] Chen R., Huang H., Du X., Et al., On the number of shortest cycles of tanner graphs, Journal of Xidian University, 35, 6, pp. 983-985, (2008)
  • [10] Woitaszek M., Tufo H.M., Tornado codes for MAID archival storage, Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007), pp. 221-226, (2007)
1