利用有限资源实现高速Viterbi解码

The Implementation of High - speed Viterbi Decode Based on Finite Resource

文中提供一种分组方法简单,兼顾连线复杂性与存储空间有限性的Viterbi解码方法,并提出三种处理方法,可以依据实际情况选定所需的处理结构。

In this paper, we present a simple approach of partitioning the N trellis states to P groups in Viterbi decoder, which compatible with interconnection complexity and area saving, and three scheme is proposed, you can choose any of them in your need.