AN EFFICIENT VITERBI DECODER
Creators
- 1. Research Scholar, R. V. Center for Cognitive Technologies, Bangalore, India
- 2. Director, R. V. Center for Cognitive Technologies, Bangalore, Karnataka, India
Description
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%.
Files
2112ijcsea09.pdf
Files
(1.4 MB)
Name | Size | Download all |
---|---|---|
md5:1e9040910a73d0695f7023f0e1491ec7
|
1.4 MB | Preview Download |