Project Name: Viterbi Decoder


Viterbi Algorithm has been a legendary decoding algorithm for Convolutional Codes. It was found by Andrew J. Viterbi which was published on his paper "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," in IEEE Transactions on Information Theory, Volume IT-13, April 1967. Research and development then increasing to find more better and more eficient code generator for the Convolutional Codes and the architectural implementation of the Viterbi Algorithm.

Viterbi Algorithm is well used to find a maximally-likelihood decoded bits from a convolutional coded transmitted bits which transmission channel is interferenced by heavy noise such as Additive White Noise Gaussian (AWGN). Enough redundancies are added to combat the impairment of the transmission channel. As a result, Viterbi Algorithm could get an amazing low decoded Bit Error Rate (BER) compared to uncoded transmitted bits, showed by its BER to Eb/No graphical property. This performance could be parameterized by the Constraint Length (K) and Code Rate (R) of the Convolutional Encoder. And yes, we have trade offs around speed, area, and power while trying to implement the Viterbi Algorithm in a real hardware (full/semi custom VLSI).

Very short explanation on Viterbi Algorithm written by Zalfany could be found here. Find more on the Link Section

Current Status





Next Steps


Software & Tools

Author & Maintainer:

Mailing list: