期刊文献+

基于SPA算法的Turbo码译码

Decoding Turbo Codes Based on SPA Algorithm
下载PDF
导出
摘要 通过把Turbo码当作一种串行级联码进行处理,在改进编码框图和降低奇偶校验矩阵后,得到了一种改进的Turbo码.采用和积算法译码进行仿真,结果显示,该方法降低了译码的复杂度. Turbo Codes are studied as serially concatenated cedes in this paper. To change the structure of the turbo coder and decrease the density of the parity-check matrices of the codes, a novel turbo code is obtained. The simulation of these cqdes using sum-product algorithm show that the complexity of encoding is decreased.
出处 《重庆工学院学报(自然科学版)》 2008年第8期166-168,共3页 Journal of Chongqing Institute of Technology
关键词 TURBO码 SPA算法 仿真 turbo codes SPA algorithm simulation
  • 相关文献

参考文献4

  • 1[2]Sten Brink.Convergence behaviour of iteratively decoded parallel concatenated codes[J].IEEE Trans.Commun,2001,49(10):1727-1737.
  • 2[3]Kschischang F R,Frey B J,Loeliger H A.Factor graphs and sum-product algorithm[J].IEEE tram on information theory,2001,47(2):498-519.
  • 3[4]Jiang F.Time-varying and capacity-approaching codes.Ph[D].[S.I.]:Universuty of Nebraska-Lincoln,2006.
  • 4[5]Richardson T J,Urbanke R.Efficient encoding of low-den-sity parity-check codes[J].IEEE Trans.Inform,2001,47(2):638-656.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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