Viterbi Algorithm Performance Analysis for Different Constraint Length

Abstract

In digital communication system and signal processing, Viterbi algorithm is an optimal solution for error detection and correction. Viterbi algorithm finds the most likely closet sequence in distance to the received sequence of noisy symbol. Performance and hardware implementing complexity of Viterbi algorithm is mainly depend on constraint length. Larger constraint length requires more memory but provides lower Bit Error rate (BER) without increasing the signal power. In this paper, Viterbi algorithm is analyzed for BPSK modulated convolutional encoded data over AWGN channel on different constraint lengths. Trace back and Trace forward methods are also reviewed for better memory utilization and computational complexity.