DocumentCode
2280812
Title
ML decoding for convolutional code for short codeword of short constraint length and alternate use of block code
Author
Al Zaman, A. ; Khan, Mohammad Ashraf Ali ; Sultana, Sabera ; Islam, S. M Taohidul
Author_Institution
Dept. of ECE, Tennessee Univ., Knoxville, TN
fYear
2007
fDate
22-25 March 2007
Firstpage
187
Lastpage
190
Abstract
This paper primarily deals with the error correction for the error correcting code, convolutional code. Viterbi decoding algorithm is the well known algorithm to decode convolutional code. Some of its limitations are overcome by the proposed algorithm in (Saifullah and Al-Mamun, 2004). This paper shows the improvement made by maximum likelihood (ML) decoding in simple form over the Viterbi algorithm and the proposed algorithm in (Saifullah and Al-Mamun, 2004) for short codeword and constraint length because of its low complexity. With this ML decoding, alternate use of block and convolutional code saves receiver´s decoding power as well as computational complexity.
Keywords
Viterbi decoding; block codes; convolutional codes; error correction codes; maximum likelihood decoding; Viterbi decoding algorithm; block code; constraint length; convolutional code; error correcting code; maximum likelihood decoding; short codeword; Block codes; Computational complexity; Convolutional codes; Error correction; Error correction codes; Hamming distance; High definition video; Maximum likelihood decoding; Probability; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
SoutheastCon, 2007. Proceedings. IEEE
Conference_Location
Richmond, VA
Print_ISBN
1-4244-1029-0
Electronic_ISBN
1-4244-1029-0
Type
conf
DOI
10.1109/SECON.2007.342882
Filename
4147412
Link To Document