By Topic

A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. S. Reeve ; Sch. of Electron. & Comput. Sci., Southampton Univ., UK ; K. Amarasinghe

We present a parallel version of Viterbi's decoding procedure, for which we are able to demonstrate that the resultant task graph has a restricted complexity in the number of communications to or from and the processor cannot exceed 4 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 demonstrate 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.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:5 )

Date of Conference:

20-24 June 2004