期刊文献+

一种低复杂度LDPC码提前结束迭代准则

A Low-complexity Early Stopping Criterion for LDPC Decoding
在线阅读 下载PDF
导出
摘要 采用直接观察校验子S中非零元素个数的方法来确定LDPC译码器迭代译码的收敛情况,提出了一种低复杂度的提前结束迭代准则.在不需要经过复杂的计算便可确定迭代译码的收敛情况,从而可以根据系统的实际需要实现性能和平均迭代次数的折衷.在CMMB标准下,对800×9216个LDPC码字仿真表明该准则能在很小的性能损失的情况下很大程度地降低平均迭代次数.与现有的几种经典的提前结束迭代准则相比该准则具有性能良好、低复杂度和硬件消耗少的特点. A low-complexity early stopping criterion has been developed by directly observing the number of non-zeros in the check matrix during each iteration of LDPC decoder. Instead of a great number of complex computations, the new approach needs only a few simple operations. Simulation results of 800×9 216 LDPC codes in CMMB system proved that the proposed approach could greatly reduce the average iteration numbers with only a few performance degradations. Compared with the classic criterions, the proposed criterion has low complexity, little performance degradation and only little hardware consumption.
出处 《微电子学与计算机》 CSCD 北大核心 2010年第5期50-52,56,共4页 Microelectronics & Computer
关键词 LDPC码 提前结束迭代准则 LDPC early stopping criterion
  • 相关文献

参考文献6

  • 1徐华.LDPC码相关技术研究[J].微电子学与计算机,2005,22(3):178-180. 被引量:8
  • 2Lin C C, Lin K L, Chung C C,et al. A 3.33 Gb/s (1200, 720) low-density parity check code decoder[C]//Proc. ESSCIRC. European, 2005:211-214.
  • 3European Telecommunications Standards Institude (ETSI). Digital video broadcasting (DVB) second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications; TM 2860r1 DVI3S2-74r8[S]. European Telecom Munieations Standard In- stitute.
  • 4Brack T, Alles M, Kienle F, et al. A synthesizable IP core for WIMAX 802. 16E LDPC code decoding[ C]//Proc. IEEE 17th Int. Syrup. Personal, Indoor and Mobile Radio Communications. Helsinki, 2006:1 - 5.
  • 5Hagenauer J, Offer E, Papke L. Iterative decoding of binary block and convolutional codes[J]. IEEE Trans. Inform. Theory, 1996(42) :429 - 449.
  • 6Shao R Y, Lin S, Fossorier M P C. Two simple stopping criteria for turbo decoding [ J ]. IEEE Trans. Commun., 1999(47) : 1117 - 1120.

二级参考文献11

  • 1R G Gallager. Low Density Parity Check Codes[J]. IRE Trans. Inform. Theory, IT-8, Jan. 1962: 21~28.
  • 2C Berrou, A Glavieux, P Thitimajshima. Near Shannon Limit Error-Correcting Coding and Decoding : Turbo Codes [C]. Proc. IEEE ICC'93, Geneva, Switzerland , May 1993.
  • 3D J C MacKay and R N Neal. Near Shannon limit performance of low density parity check codes [J]. IEEE Electronic Letters, Aug. 1996,32: 1645~1646.
  • 4S Y Chung, et al. On the Design of Low Density Parity Check Codes within 0.0045 dB of the Shannon Limit [J].IEEE Commun. Letters, Feb. 2001,5: 58~60.
  • 5R Michael Tanner. A Recursive Approach to Low Coplexity Codes. IEEE Trans. On InformationTheory,September,1981,IT-27(5): 533~547.
  • 6M Sipser, D A Spielman. Expander Codes[J]. IEEE Transactions on Information Theory, November 1996, 42 (6):1710~1722.
  • 7T J Richardson and R L Urbanke. Efficient Encoding of Low-Density Parity-Check Codes[J]. IEEE Trans. Inform.Theory, Feb. 2001,47(2): 638~656.
  • 8T Richardson and R Urbanke. The Capacity of Low-density Parity Check Codes under Message-passing Decoding[J]. IEEE Trans. Inform. Theory, Feb. 2001, vol.47: 599~618.
  • 9D Burshtein and G Miller. Expander Graph Arguments for Message-Passing Algotithms[J]. IEEE Trans. Inform. Theory, Feb. 2001,47(2): 782~790.
  • 10S Y Chung, T J Richardson, and R Urbanke. Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes using a Gaussian Approximation[J]. IEEE Transactions on Information Theory, Feb. 2001,47(2): 657~670.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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