Title :
New optimal hard decoding of convolutional codes with reduced complexity
Author :
Dany, J.-C. ; Antoine, J. ; Husson, L. ; Paul, N. ; Wautier, A. ; Brouet, J.
Author_Institution :
Radio Dpt., Ecole Superieure d´´Electr., Gif-sur-Yvette, France
Abstract :
It is well known that convolutional codes can be optimally decoded by the Viterbi algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state-to-state iterations is unnecessary. Hence, under certain channel conditions, optimum performance is achievable with a sensible reduction in complexity.
Keywords :
Viterbi decoding; channel coding; computational complexity; convolutional codes; optimisation; Viterbi algorithm; convolutional codes; error vector; optimal hard decoding; reduced complexity; state-to-state iterations; Convolutional codes; Degradation; Equations; Error correction; Error correction codes; Iterative decoding; Maximum likelihood decoding; Maximum likelihood detection; Technological innovation; Viterbi algorithm;
Conference_Titel :
Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE
Conference_Location :
New Orleans, LA, USA
Print_ISBN :
0-7803-7700-1
DOI :
10.1109/WCNC.2003.1200362
