期刊文献+

一种新的信噪比自适应Viterbi译码算法 被引量:3

New signal noise ratio adaptive Viterbi decoding algorithm
下载PDF
导出
摘要 Viterbi译码算法的复杂度会随着状态数的增加而增加,因此一般适用于约束长度较小的卷积码的译码。提出了一种新的信噪比自适应Viterbi译码改进算法,在每个接收时刻通过门限值选择幸存状态,从而进一步减小译码网格中的路径搜索范围,提高译码速度。仿真表明,本算法并不会降低译码性能,而在高信噪比、大状态数的应用条件下,与传统译码速度相比,可提高译码速度最高至15倍。 The complexity of Viterbi decoding algorithm will increase with the number of the states, so it is always used in decoding convolutional codes with little states. A new signal noise ratio adaptive Viterbi decoding algorithm is proposed. As it selects the survived states through setting threshold in every step, it reduces the searching area in the trellis of decoding and improves decoding speed. The simulation results show that the BER performance will not decrease, the decoding speed is increased maximally about 15 times than common algorithm in large-state-number application.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2005年第11期1950-1952,共3页 Systems Engineering and Electronics
关键词 维特比算法 信噪比 自适应门限 Viterbi algorithm signal noise ratio adaptive threshold
  • 相关文献

参考文献8

  • 1Fano R M. A heuristic discussion of probabilistic coding[J]. IEEE Trans. on Inform. Theory, 1963,9:64-74.
  • 2Viterbi A J. Error bounds for convolutional codes and an asyrnptotically optimum decoding algorithm [J]. IEEE Trans. on Inform Theory, 1967 : 260 - 269.
  • 3Jelinek F. Fast sequential decoding algorithm using a stack [J].IBM J, Res, 1969,13(11):675 - 685.
  • 4ProakisJohnG.数字通信(第三版)[M].北京:电子工业出版社,2001..
  • 5Viterbi A J. An intuitive justification and a implementation of the MAP decoder for convolutional codes[J]. IEEE J. Select Areas Commun. , 1998,16(2) : 277 - 287.
  • 6Lee L N. Real-time minimal-bit-error probability decoding of convolutional codes[J]. IEEE Trans. on Commun , 1974,22(2).
  • 7TommyOberg.调制、检测与编码[M].北京:电子工业出版社,2004..
  • 8Ma X, Zhang X, Yu H, et al. Optimal quantization for soft decision decoding revisited [A]. International Symposium on Information Theory and Its Applications [C]. Xi'an, 2002.

共引文献1

同被引文献35

  • 1高海兵,周驰,高亮.广义粒子群优化模型[J].计算机学报,2005,28(12):1980-1987. 被引量:102
  • 2彭万权,冯文江,陈林.乘积码基于相关运算的迭代译码[J].电路与系统学报,2006,11(4):26-30. 被引量:10
  • 3王新梅,肖国镇.纠错码-原理与方法[M].西安:西安电子科技大学出版社.1992.
  • 4GOLDBERG, DAVID E. Genetic Algorithms in Search. Optimization and Machine Learning[M]. Reading. MA: Addison-Wesley,1989.
  • 5CAVDAR T, GANGAL A. A new sequential decoding algorithm based on branch metric[J]. Wireless Personal Communications, 2007, 43(4): 1093-1100.
  • 6CHAN F C, HACCOUN D. Adaptive Viterbi decoding of convolutional codes over memoryless channels[J].IEEE Transactions On Communications, 1997, 45(11):1389-1400.
  • 7KENNEDY J, EBERHART R C. Particle swarm optimizations[A]. Proceedings of IEEE International Conference on Neutral Networks[C]. Perth, Australia, 1995.1942-1948.
  • 8KENNEDY J.The particle swarm: social adaptation of knowledge[A]. Proceedings of IEEE International Conference on Evolutionary Computation[C]. Apr 1997, pp:303 - 308.
  • 9PARK J, CHOI K, ALLSTOT D J. Parasitic-aware RF circuit design and optimization[J]. IEEE Transactions on Circuits and Systems I, 2004, 51(10): 1953-1966.
  • 10ZHANG X G, et al. Two-stage adaptive PMD compensation in a 10 Gbit/s optical communication system using particle swarm optimization algorithm[J]. Optics Communications, 2004,231(1-6): 233-242.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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