期刊文献+

正则低密度纠删码的分析 被引量:5

Analysis of regular low-density erasure codes
下载PDF
导出
摘要 深入研究了基于正则度序列的低密度纠删码,通过对正则度序列的详细分析,提出了正则低密度纠删码可接受最大损失的一个结论.利用这一结论对(3,6)和(d,nd) 正则度分布给出了两阈值δ (3,6)与δ (d,nd)的关系(d≥3,n≥2).同时从理论上证明了基于(d,2d) 正则度序列的低密度纠删码都不是渐近最优码(d≥3),而且给出了这一结论的直观性解释和仿真结果.这些分析有助于低密度纠删码度序列的设计. A detailed study of low-density erasure codes based on regular sequences of degree distribution is made. By analyzing regular sequences of degree distribution in detail a result is presented on the maximum tolerable loss fraction for regular low-density erasure codes. By using this result the relationship of two thresholds δ* (3, 6) and δ* (d, nd) is given for (3,6) and (d, nd)-regular degree distributions (d≥3, n≥2). In the meantime, it is shown that low-density erasure codes based on (d, 2d)-regular sequences of degree distribution are not close to optimum from the theoretical point of view of theory. Moreover, the simulation and intuition are given as to why regular codes are not close to optimum. These analyses will be helpful in designing the sequences of degree distribution for low-density erasure codes.
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2003年第4期469-472,共4页 Journal of Xidian University
基金 国家自然科学基金资助项目(60272057) 重庆市/信息产业部移动通信技术重点实验室开放课题基金项目 陕西省自然科学基金资助项目(2002F01)
  • 相关文献

参考文献9

  • 1孙韶辉,慕建君,王新梅.低密度校验码研究及其新进展[J].西安电子科技大学学报,2001,28(3):393-397. 被引量:23
  • 2慕建君,贺玉成,王新梅.低密度纠删码稳定收敛条件的证明[J].电子学报,2002,30(4):530-532. 被引量:3
  • 3MacKay D J C, Neal R M. Near Shannon Limit Performance of Low-density Parity Check Codes[J]. Electron Lett, 1996, 32(6) : 1645-1646.
  • 4MacKay D J C, Neal R M, Good Error Correcting Codes Based on Very Sparse Matrices[A]. In Cryptography and Codings: 5th IMA Conf[C]. (Lecture Notes in Computer Science No 1025), Colin Boyd, Ed, Berlin, Germany: Springer, 1995, 100-111.
  • 5Chung S Y, Jr Forney G D, On the Design of Low-deasity Parity-check Codes Within 0.0045 dB of the Shannon Limit[J]. IEEE Comm Letters, 2001, 5(2): 58-60.
  • 6Luby M, Mitzenmacher M, Shokrollahi A, el al. Practical Loss-Resilient Codes[A]. Proc of the 29th ACM Symposium on Theory of Computing[C]. Texas: EI-Paso, 1997, 150-159.
  • 7Shokrollahi M A. New Sequences of Linear-time Erasure Codes Approaching the Channel Capacity[A]. In Proceedings of the 13th Conference on Applied Algebra, Error Correcting Codes and Cryptography: Vol 1719[C]. Berlin: Springer Veralg, 1999. 65-76.
  • 8Luby M, Mitzenmacher M, Shokrollahi A. Analysis of Random Processes Via And-Or Tree Evaluation[A]. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms[C]. San Francisco: [s.n.], 1998. 364-373.
  • 9Luby M. Habilitalionsschrift [DB/OL]. http://citeseer. nj. nec. com/419720. html, 2001-12-10,.

二级参考文献5

共引文献24

同被引文献30

  • 1Sanjay Ghemawat,Howard Gobioff,Shun-Tak Leung.The Google file system[M].Proc.of the 19th ACM SOSP.New York:ACM Press,2003:29-43.
  • 2Amazon.Amazon Simple Storage Service (S3)[EB/OL].http://www.amazon.com/s3,2010.
  • 3WICKER SB,BHARGAVA VK.Reed-Solomon Codes and Their Applications[M].New York:IEEE Press,1994.
  • 4Rizzo L.On the Feasibility of Software FEC[Z].Internal report University of Pisa,1997.
  • 5Blomer J,Mitzenmacher M,Shokrollahi A.An XOR-based erasure-resilient coding scheme,ICSI Technical Report,No.TR-95048[R].I995.
  • 6Gallager R G.Low-Density Parity-Cheek Codes[M].MIT Press,Cambridge,MA,1963.
  • 7Byers W,Luby M,Mitzenmacher M,et,al.A Digital Fountain Approach to Reliable Distribution of Bulk Data[Z].SIGCOMM,1998:56-67.
  • 8Divsalar D, Jin H, McEliece R J. Coding Theorems for "Turbo-like" Codes[DB/OL]. http://www.systems.caltech.edu/EE/Faculty/rjm/papers, 1998-09-21.
  • 9Gallager R G. Low-density Parity-check Codes[J]. IRE Trans on Inform Theory, 1962, 8(1): 21-28.
  • 10Gallager R G. Low Density Parity Check Codes[M]. Cambridge: MIT Press, 1963.

引证文献5

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部