期刊文献+

LDPC码的编译码设计与研究 被引量:4

Design and Study of LDPC Codes in Encoding-Decoding
下载PDF
导出
摘要 LDPC码以其低复杂度的迭代译码算法和可逼近信道容量限而成为目前最佳的编码技术之一,首先介绍了LDPC码的性能和特点,并使用simulink建立仿真回路,分析不同类型校验矩阵的使用效果,得出使用非规则校验矩阵比规则校验矩阵拥有更低的误码率和更多的译码时间;然后,将LDPC编码译码技术应用到导航电文的设计中,通过仿真系统验证了其比传统导航电文更好的抗干扰能力;最后提出了针对导航电文设计的最佳编码长度,为导航电文的设计提供参考。 Low--density parity--check codes come to be one of the best coding technologies because of their low--complicity iterative de coding algorithm and capacity approaching performance. First, introduces the performance and characteristics of LDPC codes. Through the simulation circuit, we also analyze the effects using different parity check matrices, draw a conclusion that using irregular parity check ma- trice has lower bit error rate and higher decoding time than regular parity check matrice. Next, we apply LDPC in navigation message de- sign, verified its better ability in anti--jamming than traditional navigation message. And we bring up the best code length to provide refer- ence for navigation message design,
出处 《计算机测量与控制》 北大核心 2013年第3期728-731,共4页 Computer Measurement &Control
基金 国家高技术研究发展计划(863计划)课题(2011AA120503)
关键词 LDPC 编码 抗干扰 导航电文 LDPC encode anti--jamming navigation message
  • 相关文献

参考文献7

  • 1R G Gallager. Low Density Parity Check Code [D]. Cambridge, MA: Massachusetts Institude of Technology, 1960.
  • 2Mackay DJ C. Good error--correcting codes based on very sparse matrices [J]. IEEE Transactions on Information Theory, 1999, 3 (45): 399-431.
  • 3Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge--growth Tanner graphs [J], IEEE Trans. on In- fo. Theory, 2005, 51 (1): 386-398.
  • 4Luby M, Mitzenmacher M, SHOKRO1.LAHI A. Analysis of low density codes and improved designs using irregular graphs [A] // Proc 30'h Annu ACM Syrup Theory of Computing [C]. ACM, 1998: 249-258.
  • 5Luby M, Mitzenmacher m, Shokrollahi A. Improved low--density parity--check codes using irregular graphs and belief propagation [A] //Proc 1998 IEEE Int Symp Information Theroy [C]. Cam- bridge, MA: IEEE, 1998: 117.
  • 6Mackay D, Wilson S, Dayey M. Comparison of constructions of irregular gallager codes [J]. IEEE Trans Commun. 1999, 10 (47): 1449-1454.
  • 7李忠亮,夏国江.深空通信中LDPC码的编码算法及FPGA实现[J].计算机测量与控制,2011,19(5):1199-1202. 被引量:2

二级参考文献10

  • 1Andrews K, Divsalar D, Dolinar S, et al. The development of turbo and LDPC codes for deep--space applications [J]. IEEE Special Issue on Technical Advances in Deep- Space Communication and Tracking, 2007, 95: 2142-2156.
  • 2Gallager R G. Low Density Parity Check Codes[D].Cambridge, MA: MlTPress, 1963.
  • 3Mackay D. Good error correcting codes based on very sparse matrices [J].IEEETrans. Inf. Theory, 1999, 47. 399-431.
  • 4Andrews K, Divsalar D, Dolinar S, et al. Design and Standardization of Low-- Density Parity-- Check Codes for Space Applications [C].SpaceOps 2008 Conference, AIAA 2008 - 3211 : 1 - 12.
  • 5Thorpe J. Low Density Parity Check (LDPC) Codes Constructed from Protographs [R]. JPL INP, Progress Rep, 2003:42 - 154.
  • 6Li Z W, Chen L, Lin S, et al. Efficient encoding of quasi--cyclic low --density Parity--check Codes [J]. IEEE Trans. Commun, 2006 : 71-81.
  • 7Abbasfar A, Divsalar D, Yao Kung. Accumulate Repeat Accumulate Codes [C]. IEEE Globeeom 2004: 509- 513.
  • 8Divsalar D, Dolinar S, Jones C. Construction of Protograph LDPC Codes with Linear Minimum Distance [C]. IEEE ISIT, Seattle, USA, July, 2006:664-668.
  • 9Divsalar D, Dolinar S, Jones C. Low--rate LDPC codes with simple protograph structure [C]. IEEE ISIT, Adelaide, Australia, September, 2005: 1622- 1626.
  • 10连帅,闫利军,孙科.北斗2代卫星导航电文纠错校验设计与仿真[J].计算机测量与控制,2010,18(10):2344-2347. 被引量:8

共引文献1

同被引文献37

  • 1童胜,王鹏,王单,王新梅.LDPC码量化和积译码的高效实现[J].西安电子科技大学学报,2004,31(5):709-713. 被引量:13
  • 2GALLAGER R G. Low Density Parity Check Codes[J].IRETrans Inf Theory,1962,(1):21-28.
  • 3MACKAY D J C. Good Error-correcting Codes Based on Very Sparse Matrices[J].{H}IEEE Transactions on Information Theory,1999,(2):399-431.
  • 4PRABHAKAR A,NARAYANAN K. Pseudorandom Construction of Low-density Parity-check Codes Using Linear Congruential sequences[J].{H}IEEE Transactions on Communications,2002,(9):1389-1396.
  • 5HU X Y,ELEFTHERIOU E,ARNOLD D M. Progressive Edge Growth Tanner Graphs[A].{H}IEEE,2001.995-1001.
  • 6HU X Y,ELEFTHERIOU E,ARNOLD D M. Regular and Irregular Progressive Edge-growth Tanner Graphs[J].{H}IEEE Transactions on Information Theory,2005,(I):386-398.
  • 7H.Xiao and A.M.Banihashemi,GraphBased Message-Passing Schedules for Decoding LDPC Codes",IEEE Transactions on Communications,vol.52,no.12,pp.2098-2105,December 2004.
  • 8CCSDS 131.1-O-2,Low Density Parity Check Codes for Use in Near-Earth and Deep Space Applications,Orange Book,Issue 2,Washington D.C,USA,Sept,2007.
  • 9丁雨廷.LDPC码编译码原理及多码率编码研究[D].杭州电子科技大学,2014(09):10-23.
  • 10吴晓丽.多进制LDPC码的编译码算法及结构研究[D].西安电子科技大学,2011(03):24-27.

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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