ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Signal Processing
Volume 86, Issue 2, February 2006, Pages 273-278
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (197 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.sigpro.2005.05.016    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

A parallel Viterbi decoder for block cyclic and convolution codes

J.S. ReeveCorresponding Author Contact Information, E-mail The Corresponding Author and K. Amarasinghe

Department of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, UK

Received 25 June 2003; 
revised 25 January 2005; 
accepted 16 May 2005. 
Available online 13 July 2005.

Purchase the full-text article



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

Article Outline

1. Introduction
2. The sequential Viterbi algorithm as a state transition machine
3. The parallel Viterbi algorithm
4. The field programmable gate array (FPGA) implementation
5. Results and conclusion
References








Signal Processing
Volume 86, Issue 2, February 2006, Pages 273-278
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.