文章基本信息

标题：An Efficient Viterbi Decoder
本地全文：下载
作者：K. S. Arunlal ; S.A.Hariprasad
期刊名称：International Journal of Computer Science, Engineering and Applications (IJCSEA)
印刷版ISSN：2231-0088
电子版ISSN：2230-9616
出版年度：2012
卷号：2
期号：1
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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%.
关键词：Constraint length; Path metric; Trellis diagram; Code rate; Euclidean distance; hamming distance;interleavers.