A trace-back-free Viterbi decoder using a new survival path management algorithm

The problem of survival memory management of a Viterbi decoder is classically solved either by a power-hungry register-exchange implementation, or by a trace-back scheme with large latency. In this paper, we show that by introducing a novel matrix transformation operator to the algebraic foundation originally proposed in Fettweis (1995), we obtain a new survival-path-management algorithm that sorts the survival paths in parallel with the decoding of the information bits to eliminate long recursive trace-back operations. Furthermore, it avoids power and complexity problems associated with register exchange by only tracing and recording the changes of the survival path with a set of dynamic pointers. A prototype of the Viterbi decoder for the GSM TCH/FS system has been mapped into a Xilinx Virtex xcv400HQ240-6 operating at 23.6 MHz with a decoding throughput of 3.37 Mbit/s and 80 mW power consumption, a 43% increase over the same application based on StarCore SC140 DSP in terms of throughput per MHz.

[1]  Trieu-Kien Truong,et al.  A VLSI design for a trace-back Viterbi decoder , 1992, IEEE Trans. Commun..

[2]  Gerhard Fettweis,et al.  Algebraic survivor memory management design for Viterbi detectors , 1995, IEEE Trans. Commun..

[3]  E. Boutillon,et al.  Trace back techniques adapted to the surviving memory management in the M algorithm , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[4]  H. Suzuki,et al.  A 2-Mb/s 256-state 10-mW rate-1/3 Viterbi decoder , 2000, IEEE Journal of Solid-State Circuits.

[5]  Robin Braun,et al.  A generalised design technique for traceback survivor memory management in Viterbi decoders , 1997, Proceedings of the 1997 South African Symposium on Communications and Signal Processing. COMSIG '97.

[6]  E. Casseau,et al.  Architecture of a high-rate VLSI Viterbi decoder , 1996, Proceedings of Third International Conference on Electronics, Circuits, and Systems.

[7]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[8]  K. Hu,et al.  A Viterbi decoder memory management system using forward traceback and all-path traceback , 1999, 1999 Digest of Technical Papers. International Conference on Consumer Electronics (Cat. No.99CH36277).

[9]  P. Glenn Gulak,et al.  Architectural tradeoffs for survivor sequence memory management in Viterbi decoders , 1993, IEEE Trans. Commun..

[10]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.