期刊文献+

系统规则RA码在BEC信道下的性能界分析

Analysis of the bound performance of systematic regular RA codes in the BEC Channel
下载PDF
导出
摘要 介绍了系统规则RA码的构成原理,对系统规则RA码在二元删除信道中的性能进行了分析,给出了码率为1/2的系统规则RA码在二元删除信道的渐进性能,并对码的联合界性能进行了仿真.分析和仿真结果均说明,度的选取对于系统规则RA码的性能影响非常重要. This paper introduces the construction of systematic regular RA codes and makes a brief analysis of the bound of the systematic regular rate-1/2 RA codes for binary erasure channels. The asymptotical performance of such codes is given and the union bound is simulated. The analytical and simulation results show that the structure of the regular RA code plays a great role in the performance of the code.
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2008年第4期712-715,共4页 Journal of Xidian University
基金 国家自然基金资助(60572149 60532060 60573034) 国家自然基金委-广东省联合基金重点项目资助(U0635003) 重庆市/信息产业部移动通信技术重点实验室2007年开放课题基金资助
关键词 删除信道 系统规则RA码 zigzag码 联合界 erasure channel systematic regular RA code zigzag code union bound.
  • 相关文献

参考文献7

  • 1Elias P. Coding for two noisy channels[C]//Information Theory, Third London Symposium. London: Buttersworth's Scientific Publications, 1955:61-67.
  • 2慕建君,王鹏,王新梅.正则低密度纠删码的分析[J].西安电子科技大学学报,2003,30(4):469-472. 被引量:5
  • 3Jin H, Khandekar A, McEliece R J. Irregular Repeat-accumulate Codes[C]//Proc 2^nd International Symposium on Turbo Codes & Related Topics. France: IEEE, 2000: 1-8.
  • 4Luby M G, Mitzenmacher M, Shokrollahi M A, et al. Efficient Erasure Correcting Codes[J]. IEEE Trans on Information Theory, 2001, 47(2):569-58.
  • 5Li Ping, Huang X L, Phamdo Nam. Zigzag Codes and Concatenated Zigzag Codes[J]. IEEE Trans on Inform Theory, 2001, 47(2), 800-807.
  • 6Huang X L, Phamdo N, Li Ping. BER Bounds on Parallel Concatenated Single Parity Check Arrays and Zigzag Codes[C]//IEEE Globecom'99. Brazil: IEEE, 1999:2 436-2 440.
  • 7Abbasfar A, Divsalar D, Yao Kung. Accumulate Repeat Accumulate Codes[C]//IEEE Proc Of Globecom 2004. Dallas: IEEE, 2004: 509-513.

二级参考文献9

  • 1MacKay D J C, Neal R M. Near Shannon Limit Performance of Low-density Parity Check Codes[J]. Electron Lett, 1996, 32(6) : 1645-1646.
  • 2MacKay 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.
  • 3Chung 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.
  • 4Luby 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.
  • 5Shokrollahi 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.
  • 6Luby 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.
  • 7Luby M. Habilitalionsschrift [DB/OL]. http://citeseer. nj. nec. com/419720. html, 2001-12-10,.
  • 8孙韶辉,慕建君,王新梅.低密度校验码研究及其新进展[J].西安电子科技大学学报,2001,28(3):393-397. 被引量:23
  • 9慕建君,贺玉成,王新梅.低密度纠删码稳定收敛条件的证明[J].电子学报,2002,30(4):530-532. 被引量:3

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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