期刊文献+

基于稀疏序列LDPC的多层码的迭代译码

Iterative decoding for sparse sequence LDPC-coded multilevel coding
下载PDF
导出
摘要 提出一种稀疏二进制序列构造的LDPC码作为分量码,译码采用串行迭代的多层码方案.每次串行迭代译码逐层进行,低层向高层传递译码软信息.采用该方案分别对8PSK和16QAM调制的多层码进行串行迭代译码和并行迭代译码的性能仿真.仿真结果表明:该方案的编码复杂度较低,相比于并行迭代译码,串行迭代译码简化了译码结构,且2种迭代译码算法复杂度相同;在AWGN信道和平坦瑞利衰落信道中,串行迭代译码的误比特性能优于并行迭代译码. A new MLC (multilevel coding ) scheme with sparse binary sequence constructed LDPC (low-density parity-check codes) as component codes and a serial iterative decoding algorithm is presented. Every level decoder works serially and soft decoding information is passed from lower levels to higher levels. In 8PSK and 16QAM modulated multilevel schemes, error performance of two different iterative decoding algorithms were compared. Simulation results show that this new MLC scheme can achieve low encoding complexity. Compared with parallel iterative decoding, serial iterative decoding simplifies decoder construction. Moreover, on AWGN (added white Gauss noise) channel and flat fading channel, serial iterative decoding algorithm can achieve better error performance than parallel iterative decoding algorithm with same computing complexity.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第2期194-197,共4页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金重大资助项目(60496311)
关键词 MLC 稀疏序列LDPC码 MSD 串行迭代译码 并行迭代译码 multilevel coding (MLC) sparse binary sequence low-density parity-check (SS_LDPC) codes multi-step decoding (MSD) serial iterative decoding (SID) parallel iterative decoding (PID)
  • 相关文献

参考文献9

  • 1Imai H, Hirakawa S. A new multilevel coding method using error correcting codes [J]. IEEE Trans Information Theory, 1977, 23(3) : 371 - 377.
  • 2Isaka M, Imai H. On the iterative decoding of multilevel codes[J]. IEEE Journal on Selected Areas in Communications, 2001, 19(5) : 935-943.
  • 3Gallager R G. Low-density parity-check codes [J]. IRE Transactions on Information Theory, 1962, 8( 1 ) :21 - 28.
  • 4Gallager R G. Low-density parity-check codes[D]. Cambridge,MA: MIT Press, 1963.
  • 5MacKay D J C, Neal R M. Near shannon limit performance of low density parity check codes [J].Electronics Letters, 1996, 32(18) : 1645.
  • 6MacKay D J C. Good error-correcting codes based on very sparse matrices[J]. IEEE Trans Information Theory, 1999,45(2) :399 - 431.
  • 7Narayanan K R, Li J. Bandwidth-efficient low-density parity-check coding using multilevel coding and iterative multistage decoding [C]//Proc 2nd Syrup Turbo Codes and Related Topics. Brest, France, 2000:165 - 168.
  • 8何善宝,赵春明,史志华,姜明.基于稀疏二进制序列的低密度奇偶校验码[J].通信学报,2005,26(6):81-86. 被引量:13
  • 9Wachsmann U, Fischer R F H, Huber J B. Multilevel codes: theoretical concepts and practical design rules [J].IEEE Trans Information Theory, 1999, 45 (9) : 1361 -1391.

二级参考文献20

  • 1何善宝,赵春明,姜明.LDPC码的一种循环差集构造方法[J].通信学报,2004,25(11):112-118. 被引量:11
  • 2GALLAGER R G. Low-density parity-check codes[J]. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
  • 3GALLAGER R G. Low-Density Parity-Check Codes [D]. Cambridge,MA: MIT Press, 1963.
  • 4MACKAY D J C, NEAL R M. Near Shannon limit performance of low-density parity-check codes [J]. Electronics Letters, 1996, 32 (18):1645-1646.
  • 5SIPSER M, SPIELMAN D.Expander codes [J]. IEEE Transactions on Information Theory, 1996, 42(6): 1710-1722.
  • 6WIBERG N. Codes and Decoding on General Graphs[D]. Linkoping University, Linkoping, Sweden, 1996.
  • 7MACKAY D J C. Good error-correcting codes based on very sparse matrices [J]. IEEE Trans Information Theory, 1999, 45 (2): 399-431.
  • 8HU Xiao-yu, ELEFTHERIOU E, ARNOLD D M. Progressive edge-growth tanner graphs [A]. IEEE Global Telecommunications Conference [C].2001, San Antonio, TX, USA, 2001. 995-1001.
  • 9DJCMacKay: online database of low-density parity-check codes [EB/OL].http://www.inference .phy. cam.ac.uk/mackay/codes/data.html.
  • 10CAMPELL O, MODHA D S, RAJAGOPALAN S. Designing LDPC codes using bit-filling [A]. IEEE International Conference on Communications[C]. 2001.155-59.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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