An Efficient Viterbi Decoder

Abstract

Convolutional encoding with Viterbi decoding is a good forward error correction technique suitable for channels affected by noise degradation. Fangled Viterbi decoders are variants of Viterbi decoder (VD) which decodes quicker and takes less memory with no error detection capability. Modified fangled takes it a step further by gaining one bit error correction and detection capability at the cost of doubling the computational complexity and processing time. A new efficient fangled Viterbi algorithm is proposed in this paper with less complexity and processing time along with 2 bit error correction capabilities. For 1 bit error correction for 14 bit input data, when compared with Modified fangled Viterbi decoder, computational complexity has come down by 36-43% and processing delay was halved. For a 2 bit error correction, when compared with Modified fangled decoder computational complexity decreased by 22-36%.

Linking of Cell Tracks using Segmentation

“…The following and connecting of cell tracks has unmistakably said in [2], that depends on Viterbi algorithmic program. The Viterbi algorithmic program is in [3].…”

Forward Error Correction Convolutional Codes for RTAs' Networks: An Overview

“…In general, binary convolutional decoding algorithms can work well with a single bit transmission error and hardly with spaced multiple bits transmission errors in a data block [43]. However, decoding binary convolutional codes is a difficult task especially when burst errors occur in a data block [18], [44].…”

“…Unlike Stack algorithm in a stack overflow, Viterbi algorithm maintains all the paths which are likely to be winning survival paths [33]. An increase in m improves error correction capabilities of binary convolutional codes [43], [7]. However, it should be noted that Viterbi Algorithm has m as an exponent factor on its decoding computational complexity, hence the maximum practical limit of length of K is 10 [41].…”