A parallel Viterbi decoder for block cyclic and convolution codes

by: JS Reeve, K Amarasinghe

Signal Processing, Vol. 86, No. 2. (February 2006), pp. 273-278.

View FullText article

DOI, ScienceDirect

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

dcastro

Find related articles with these CiteULike tags

block, code, convolutional, cyclic, decoder, viterbi

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.

@article{citeulike:2067690, 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.}, author = {Reeve, J. S. and Amarasinghe, K. }, citeulike-article-id = {2067690}, doi = {10.1016/j.sigpro.2005.05.016}, journal = {Signal Processing}, keywords = {block, code, convolutional, cyclic, decoder, viterbi}, month = {February}, number = {2}, pages = {273--278}, posted-at = {2007-12-06 16:56:39}, priority = {2}, title = {A parallel Viterbi decoder for block cyclic and convolution codes}, url = {http://dx.doi.org/10.1016/j.sigpro.2005.05.016}, volume = {86}, year = {2006} }

RIS record

TY - JOUR ID - citeulike:2067690 L3 - citeulike-article-id:2067690 TI - A parallel Viterbi decoder for block cyclic and convolution codes JF - Signal Processing VL - 86 IS - 2 SP - 273 EP - 278 N2 - 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. KW - block KW - code KW - convolutional KW - cyclic KW - decoder KW - viterbi AU - Reeve, JS AU - Amarasinghe, K PY - 2006/02// UR - http://dx.doi.org/10.1016/j.sigpro.2005.05.016 ER -

RIS BibTeX