The University of Southampton
University of Southampton Institutional Repository

A FPGA Implementation of a Parallel Viterbi Decoder for Block Cyclic and Convolution Codes.

A FPGA Implementation of a Parallel Viterbi Decoder for Block Cyclic and Convolution Codes.
A FPGA Implementation of a Parallel Viterbi Decoder for Block Cyclic and Convolution Codes.
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 and 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.
Reeve, Jeffrey S
dd909010-7d44-44ea-83fe-a09e4d492618
Amarasinghe, Kosala
8df42214-345d-4403-ab07-dbd9765e0469
Reeve, Jeffrey S
dd909010-7d44-44ea-83fe-a09e4d492618
Amarasinghe, Kosala
8df42214-345d-4403-ab07-dbd9765e0469

Reeve, Jeffrey S and Amarasinghe, Kosala (2004) A FPGA Implementation of a Parallel Viterbi Decoder for Block Cyclic and Convolution Codes. At The IEEE International Conference on Communications. 20 - 24 Jun 2004.

Record type: Conference or Workshop Item (Paper)

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 and 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.

Postscript paper.ps - Other
Download (133kB)

More information

Published date: 2004
Additional Information: Event Dates: 20-24 June 2004
Venue - Dates: The IEEE International Conference on Communications, 2004-06-20 - 2004-06-24
Organisations: EEE

Identifiers

Local EPrints ID: 259027
URI: http://eprints.soton.ac.uk/id/eprint/259027
PURE UUID: 7d25319d-b612-4c65-8df4-8f86df08bf87

Catalogue record

Date deposited: 09 Mar 2004
Last modified: 18 Jul 2017 09:26

Export record

Contributors

Author: Jeffrey S Reeve
Author: Kosala Amarasinghe

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×