DocumentCode :
3433284
Title :
Decoding of convolutional codes by Viterbi blind algorithm
Author :
Li, Yunxin ; Vucetic, Branka ; Sato, Yoichi
Author_Institution :
Sydney Univ., NSW, Australia
fYear :
1992
fDate :
16-20 Nov 1992
Firstpage :
877
Abstract :
For decoding of convolutional codes by the Viterbi algorithm, the knowledge of channel parameters on non-Gaussian channels is either essential or preferable. When the considered channel is fast time-varying, reliable and robust estimation of the channel parameters by the conventional decision-directed adaptive algorithms is hardly possible. In the present paper, the Viterbi algorithm is applied in a modified way. Firstly a new trellis diagram is constructed at the receiver side according to modified definitions of trellis state and branch. Secondly a new branch metric is defined so that its expression does not explicitly depend on the channel parameters. With these modifications, decoding can be achieved without the knowledge of channel parameters. This method provides a robust alternative for decoding of convolutional codes on fast fading (especially frequency-selective) channels where the estimation of channel parameters becomes more and more difficult
Keywords :
convolutional codes; decoding; telecommunication channels; trellis codes; Viterbi blind algorithm; branch metric; channel parameters; convolutional codes; decoding; fast fading channels; receiver side; trellis diagram; AWGN; Constellation diagram; Convolution; Convolutional codes; Decoding; Fading; Frequency; Robustness; Transmitters; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN :
0-7803-0803-4
Type :
conf
DOI :
10.1109/ICCS.1992.255137
Filename :
255137
Link To Document :
بازگشت