| 一种Viterbi译码的改进算法 |
| |
| 引用本文： | 罗义军,李劲,章东平.一种Viterbi译码的改进算法[J].电路与系统学报,2003,8(6):122-124. |
| |
| 作者姓名： | 罗义军 李劲 章东平 |
| |
| 作者单位： | 浙江大学,信息与通信工程研究所,浙江,杭州,310027 |
| |
| 摘 要： | Viterbi译码是一种应用广泛的最大似然估计算法。本文利用相邻几组判决数据之间的相互关系，对这几组数据进行联合判决估计，从而提高了译码性能。从仿真结果来看，当译码深度不大时，译码性能得到明显的改善。因此该算法可以在保证同等性能前提下，减小硬件规模，降低功耗。
|
| 关 键 词： | Viterbi译码 联合判决估计 低功耗设计 |
| 文章编号： | 1007-0249(2003)06-0122-03 |
| 修稿时间： | 2002年7月31日 |
An Improved Viterbi Algorithm |
| |
| LUO Yi-jun,LI Jin,ZHANG Dong-ping.An Improved Viterbi Algorithm[J].Journal of Circuits and Systems,2003,8(6):122-124. |
| |
| Authors: | LUO Yi-jun LI Jin ZHANG Dong-ping |
| |
| Abstract: | The Viterbi algorithm is a widely used maximum likelihood estimating method. A modified algorithm is proposed to improve the decoding performance by united-decision estimation based on the relationship between adjacent groups of data. Simulation results indicate that using the proposed algorithm, decoding performance can be improved significantly for small decoding depth. That means, both hardware complexity and power dissipation can be reduced for same performance. |
| |
| Keywords: | Viterbi decoding united-decision estimate low power design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
