期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

IRA码结构优化与高斯逼近分析 被引量：1

Analysis for Gaussian Approximation and Structure Optimization of IRA Codes
在线阅读 下载PDF
导出
摘要 码结构是决定IRA码性能的重要因素,因此利用高斯逼近对IRA码结构进行了优化。介绍了IRA码的图模型理论,给出了IRA码的Tanner图结构。分析了度为2的变量节点对码结构的影响。在AWGN信道下,基于给定的噪声方差,对IRA码的高斯逼近进行了研究,设计度分布多项式。基于高斯逼近原理设计出IRA码,并进行计算机仿真。仿真结果表明这类码相对于MacKay法构造的LDPC码能带来性能上的提高,并且具有良好的消息收敛特性。 Code structure is an important factor which affects performance of IRA codes. THe structure of IRA codes was optimized based on Gaussian approximation. The graph model theory of IRA codes was introduced, and the Tanner graph was presented. The impact of 2 degree to the structure of codes was analysed. Based on given noise variance, the Gaussian approximation of IRA codes was researched on AWGN channel, and the degree sequences was designed. IRA codes were designed based on Gaussian approximation and simulated by computer. Simulation results showed that the IRA codes have better performance than MacKay LDPC codes, and the convergence of message are well.
作者 黎新 傅强 文磊
机构地区 民航飞行技术与飞行安全科研基地 国防科技大学电子科学与工程学院
出处 《四川大学学报（工程科学版）》 EI CAS CSCD 北大核心 2007年第5期159-163,共5页 Journal of Sichuan University (Engineering Science Edition)
基金 国家自然科学基金民航联合基金资助项目(60572176)
关键词 IRA码 TANNER图 高斯逼近 度 IRA codes Tanner graph Gaussian approximation degree
分类号 TN911.22 [电子电信—通信与信息系统]
作者简介 黎新（1963-），男，副教授．研究方向：民航应用技术．
  • 相关文献

参考文献10

  • 1Jin H,Khaudekar A,McEliece R.Irregular repeat-accumulate codes[C]//Proc 2nd International Symposium on Turbo Codes and Related Tonics.Brest,France,2000,9:1-8.
  • 2Divsalar D,Jin H,McEliece R.Coding theorems for Turbolike codes[C]//Proceedings of the 36^th Annual Allerton Conference on Communication Control and Computing.Monticelo,IL,USA,1998,9:201-210.
  • 3European Telecommunication Standards Institute.EN 302 307 V1.1.1 2004-06.Digital Video Broadcasting (DVB); Second Generation Framing Structure,Channel Coding and Modulation Systems for Broadcasting,Interactive Services,News Gathering and Other Broadband Satellite Applications[S].
  • 4Tanner R M.A recursive approach to low complexity codes[J].IEEE Transactions on Information Theory,1981,27(5):533-547.
  • 5雷菁,文磊,傅强.基于串行消息传递机制的LDPC码译码算法研究[J].四川大学学报（自然科学版）,2006,43(4):790-795. 被引量：4
  • 6Yang M,Ryan W E.Li Yan.Design of efficiently encodable moderate-length high-rate irregular LDPC codes[J].IEEE Transactions on Communications,2004,52 (4):564-571.
  • 7高宏峰,许宗泽.RA码译码简化算法的研究[J].四川大学学报（工程科学版）,2004,36(4):107-110. 被引量：9
  • 8Chung Sae-Young,Richardson T J,Urbanke R L.Analysis of sum-product decoding of low-density parity-check codes using a gaussian approximation[J].IEEE Transactions on Information Theory,2001,47 (2):657-670.
  • 9Chung S Y.On the construction of some capacity-approaching coding schemes[D].Dept Elect Eng,Mass Inst Technol,Cambridge,MA,2000.
  • 10Richardson T J,Shokrollahi M A,Urbanke R L.Design of capacity-approaching irregular low-density parity-check codes[J].IEEE Trans on Inform Theory,2001,47(2):619-637.

二级参考文献17

  • 1[1]Berrou C, Glavieux A, Thitimajshima P.Near Shannon limit error-correction and decoding:Turbo codes[A].Proc. ICC'93[C],Geneva,1993.1064-10-70.
  • 2[2]Gallager R G. Low-density parity-check codes[M].Cambridge:MIT Press,1963.
  • 3[3]Luby M, Mitzenmacher M, Shokrollaha A,et al.Analysis of low-density codes and improved designs using irregular graphs[A].Proceedings of the 30th ACM Symposium on theory of computing[C].1998.249～258.
  • 4[4]Diversalar D, Doliner S,Pollara F.Iterative turbo decoder analysis based on density evolution[J].IEEE SAC 2001,19(5):891～907.
  • 5[5]Divsalar D, Jin H,McEliece R. Coding theorems for Turbo-like codes[A]. Proceedings of the 36th Annual Allerton Conference on Communication Control and Computing[C].1998,9:201～210.
  • 6[6]Jin Hui. Analysis and design of Turbo-like codes[D].California Institute of Technology,California,2001.
  • 7[7]Jin Hui,Khandekar A,McEliece R.Irregular repeat-accumulate codes[A].Proceedings 2nd International Symposium on Turbo codes and Related Topics.Brest[C],France,2000,9:1～8.
  • 8[8]Chung S Y,Richardson T J,Urbanke R. Analysis of sum-product decoding algorithm of low-density parity-check codes using a Gaussian Approximation[J]. IEEE Trans on Inf Theory, 2001,47(2):657～670.
  • 9Chung S Y, Fomey G D, Richardson Jr T J, et al. On the Design of Low-Density Parity-Check Codes within 0. 0045 dB of the Shannon limit[J]. IEEE Commun. Lett,2001,5(2) :58.
  • 10Fomey G D Jr. On iterative decoding and the two-way algorithm[J]. On Turbo Codes and Related Topics, 1997,12:15.

共引文献11

同被引文献2

引证文献1

四川大学学报（工程科学版）
2007年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
关于我们 | 版权声明 | 联系我们 | 帮助中心| 意见反馈
主办单位：上海市教育委员会
技术支持：重庆维普资讯有限公司
渝公网安备 50019002500403号
使用帮助 返回顶部