| 联合判决估计的Viterbi译码算法 |
| |
| 引用本文： | 罗义军,李劲,章东平. 联合判决估计的Viterbi译码算法[J]. 通信学报, 2004, 25(5): 45-52 |
| |
| 作者姓名： | 罗义军 李劲 章东平 |
| |
| 作者单位： | 清华大学,信息与通信工程博士后流动站,北京,100084 |
| |
| 摘 要： | 利用相邻几组判决数据之间的相互关系，对这几组数据进行联合判决估计，从而提两了Viterbi译码性能。从理论分析和仿真结果来看，当译码深度τ=2m左右时，译码性能相当于深度2τ传统算法的性能。此外，仿真表明参考状态的位置对性能影响不大。因此该算法在保证同等性能前提下，对留选路径存储的规模和功耗减少约20％，对回溯单元减少达30％。
|
| 关 键 词： | Viterbi译码 联合判决估计 低功耗设计 |
| 文章编号： | 1000-436X(2004)05-0045-08 |
| 修稿时间： | 2002-11-20 |
United-decision estimating Viterbi decoding algorithm |
| |
| LUO Yi-jun,LI Jing,ZHANG Dong-ping. United-decision estimating Viterbi decoding algorithm[J]. Journal on Communications, 2004, 25(5): 45-52 |
| |
| Authors: | LUO Yi-jun LI Jing ZHANG Dong-ping |
| |
| Abstract: | The modified Viterbi algorithm improves performance by united-decision estimating according to relation of several groups near data. On the basis of theoretic analysis and simulation result, decoding performance is equivalent to conventional algorithm of twice decoding depth if the decoding depth t is approximate to 2m. In the condition of equal decoding performance, the modified algorithm can reduce size and power consumption about 20% of SMU and 30% of TBU. |
| |
| Keywords: | Viterbi decoding united-decision estimate low power design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
