Weighted Levenshtein distance based Viterbi algorithm using bit framing tree (BFT) method
K. Yadav, H. Goyal, Bharat Kumar Khatri · IET Conference Publications · 2009
Viterbi algorithm is widely used as a decoding scheme for convolutional and turbo codes. In this paper, a modified Viterbi algorithm based on WLD using bit framing tree is proposed as an efficient depuncturing and decoding scheme. The algorithm is implemented using the tree concept for correct bit framing. The Breadth First Search is employed to compute the survivor path using Add Compare and Select (ACS) operations. The proposed scheme reduces the computational complexity and is highly robust. The performance of the proposed scheme is analyzed using the mathematical analysis and computer simulations considering the deletion channel (puncturing model) to find the permissible range of the decoding bit error probability. (6 pages)