Viterbi decoder architecture for interleaved convolutional code

Sn area efficient high speed Veterbi decoder architecture, which is based on the state-parallel architecture with register exchange path memory structure, for interleaved convolutional code is proposed By replacing each delay (or storage) element in state metrics memory (or path metrics memory) and path memory (or survival memory) with I delays, interleaved Viterbi decoder is obtained. The decoding speed of this decoder architecture is as fast as the operating clock speed. The latency of proposed interleaved Viterbi decoder is "decoding depth (DD) /spl times/ interleaving degree (I)', which is linearly increased with the interleaving degree I.

[1]  D.J. Van Wyk,et al.  Application of a burst-error-correction Viterbi algorithm to Q/sup 2/PSK on Rician fading channels , 1996, Proceedings of IEEE. AFRICON '96.

[2]  Dongfeng Yuan,et al.  Performance of the interleaved (2,1,7) convolutional codes in mobile image communication system , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[3]  Nevio Benvenuto,et al.  Performance of the Viterbi algorithm for interleaved convolutional codes , 1998 .

[4]  Kin-Yew Wong,et al.  Cell loss recovery using interleaved convolutional code for ATM networks , 2000 .

[5]  Dongfeng Yuan,et al.  Performance of the combination of interleaving and wavelet noise cancellation in mobile image transmission system , 2000, 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525).

[6]  Dongfeng Yuan,et al.  Application of wavelet noise cancellation and interleaving techniques in image transmission system over mobile fast-fading channels , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[7]  Christian Schlegel,et al.  A burst-error-correcting Viterbi algorithm , 1990, IEEE Trans. Commun..