Copyright © 2005 Elsevier B.V. All rights reserved.
A parallel Viterbi decoder for block cyclic and convolution codes
Received 25 June 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We present a parallel version of Viterbi's decoding procedure, for which we are able to demonstrate that the resultant task graph has restricted complexity in that the number of communications to or from any processor cannot exceed four for BCH codes. The resulting algorithm works in lock step making it suitable for implementation on a systolic processor array, which we have implemented on a field programmable gate array and have demonstrated the perfect scaling of the algorithm for two exemplar BCH codes. The parallelisation strategy is applicable to all cyclic codes and convolution codes. We also present a novel method for generating the state transition diagrams for these codes.
Keywords: Viterbi decoding; BCH codes; Field programmable gate array; Parallel algorithms






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






