期刊文献+

CMMB标准中LDPC码的译码及定点仿真研究

Study of the LDPC Decoding and the Fixed-point Simulation in CMMB
下载PDF
导出
摘要 针对CMMB标准中的LDPC码进行了译码算法的研究,提出最小的改进算法,同时给出归一化最小和算法的定点仿真。定点仿真结果表明,输入8位量化,中间变量分别9位和10位量化,可获得与浮点相差很小的误码率性能。 In this paper, we research the decoding algorithms of the LDPC code in CMMB and propose an im- proved algorithm based on the Min-Sum algorithm. The simulation results indicate that the performance of the improved Min-Sum is much better than the MS algorithm and has a little degradation compared with the NMS algorithm in the case of relatively high SNR. And the improved algorithm is easier to be implemented. Moreover, the fixed-point simulation of the normalized rain-sum algorithm is also studied. The result shows that the BER performance only has a slight decline with the input 8 bit quantized and inner variable respectively 9 bit and 10 bit quantized. 6 bit quantization of the input and 8 bit quantization of the inner variable is also acceptable when the memory is sensitive.
出处 《信息化研究》 2011年第5期27-29,33,共4页 INFORMATIZATION RESEARCH
关键词 LDPC码 CMMB标准 译码 仿真 定点 LDPC code CMMB decoding simulation fixed-point
  • 相关文献

参考文献7

  • 1Gallager R G. Low-density parity-check codes [ J ]. IEEE Transactions on Information Theory. 1962.8 ( 1 ) : 21 - 28.
  • 2MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes [ J]. Electronics Letters, 1997, 33 (6) :457 - 458.
  • 3国家广播电影电视总局.GB206002—2006数字电视地面广播传输系统帧结构、信道编码和调制[s].北京:中国标准出版社,2006.
  • 4Kschischang F R, Frey B J, Loeliger H A. Factor Graphs and the Sum-Product Algorithm [ J 1. IEEE Transactions on Infor- mation Theory, 2001,47 ( 2 ) : 498 - 519.
  • 5魏明魁.LDPC码的一种改进的Min-Sum解码算法[J].中国电子商情(通信市场),2007(10):155-159. 被引量:1
  • 6The MathWorks, Inc. Fixed-Point Toolbox User's Guide [ EB/ OL]. U. S. : The MathWorks, Inc. , 2008. http : J/www. math- works, com/access/helpdesk/help/pdf _ doc/fixedpoint/FP- TUG. pdf.
  • 7蔡嵩,于奇,王玫.LDPC码量化译码仿真性能分析[J].舰船科学技术,2008,30(B11):112-115. 被引量:1

二级参考文献8

  • 1Gallager R G. Low-Density Parity-Check Codes[ D]. Cambridge, MA : MIT Press, 1963.
  • 2MacKay D J C. Good error correcting codes based on very sparse matrices[J]. IEEE Trans. Inform. Theory,1999, 45:399 -431.
  • 3MacKay D J C,Neal R M. Near Shannon limit performance of low-density parity-check codes [ J ]. Electron, 1996,32 : 1645 - 1646.
  • 4Richardson T J, Urbanke R. The capacity oflow-density parity-check codes under message-passing decoding [ J ]. IEEE Trans. Inform. Theory,2001,41.
  • 5Richardson T, Shokrollahi A,Urbanke R. Design ofcapaci- ty-approaching irregular low-density parity check codes [ J]. IEEE Trans. on Inform. Theory,2001,47:619 - 637.
  • 6Wiberg N. Codes and Decoding on General Graphs. Dissertation [ D ]. Sweden Linkoping University, 1996.
  • 7Salehi Chung J A, Wei F K. Optical orthogonal codes design, analysis and applications [ J]. IEEE Trans. Inform. Theory, 1989,35 ( 3 ) :595 - 604.
  • 8Gennian ge, Jianxing Yin. Constructions for optimal( v,4, 1 ) optical orthogonal codes[ J ]. IEEE trans on Information Theory ,2001,47 ( 11 ) :2998 - 3004.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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