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

Full description

Saved in:
Bibliographic Details
Main Authors: Reeve, J.S., Amarasinghe, K.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Block codes
Coding, codes
Computer science
Convolution
Decoding
Demodulation
Exact sciences and technology
Field programmable gate arrays
Hamming distance
Information, signal and communications theory
Parallel algorithms
Shift registers
Signal and communications theory
Telecommunications and information theory
Viterbi algorithm
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2599 Vol.5
container_issue
container_start_page 2596
container_title
container_volume 5
creator Reeve, J.S.
Amarasinghe, K.
description 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.
doi_str_mv 10.1109/ICC.2004.1313001
format conference_proceeding
fullrecord <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_ieee_primary_1313001</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1313001</ieee_id><sourcerecordid>17525211</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-c6bdd61086379d2a27f1f01bf9ccd5099ce795b373eddd5050bd55f2b7fb6d963</originalsourceid><addsrcrecordid>eNpFkM1LAzEUxAMiqLV3wUsuHlvfSzab5lgW-wEFPagHLyWfEE03S3YV-t9bXcG5DLz5zTsMITcIc0RQ99ummTOAao4cOQCekSuQC-ALwTlckGnfv8NJlagQ60vytqSrp_WSxkOX_MG3gx5ibmkOVNNOF52ST_Q1Dr6YSJ232flCQy7UpGw_qD3aFC3VraM2t185ff7Wf7D-mpwHnXo__fMJeVk9PDeb2e5xvW2Wu1lkwIeZrY1zNcKi5lI5ppkMGABNUNY6AUpZL5UwXHLv3OkgwDghAjMymNqpmk_I3fi3073VKRTd2tjvuxIPuhz3KAUTDPHE3Y5c9N7_x-NM_BuvGV03</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Reeve, J.S. ; Amarasinghe, K.</creator><creatorcontrib>Reeve, J.S. ; Amarasinghe, K.</creatorcontrib><description>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.</description><identifier>ISBN: 0780385330</identifier><identifier>ISBN: 9780780385337</identifier><identifier>DOI: 10.1109/ICC.2004.1313001</identifier><language>eng</language><publisher>Piscataway, New Jersey: IEEE</publisher><subject>Applied sciences ; Block codes ; Coding, codes ; Computer science ; Convolution ; Decoding ; Demodulation ; Exact sciences and technology ; Field programmable gate arrays ; Hamming distance ; Information, signal and communications theory ; Parallel algorithms ; Shift registers ; Signal and communications theory ; Telecommunications and information theory ; Viterbi algorithm</subject><ispartof>2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004, Vol.5, p.2596-2599 Vol.5</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1313001$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1313001$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17525211$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Reeve, J.S.</creatorcontrib><creatorcontrib>Amarasinghe, K.</creatorcontrib><title>A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes</title><title>2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)</title><addtitle>ICC</addtitle><description>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.</description><subject>Applied sciences</subject><subject>Block codes</subject><subject>Coding, codes</subject><subject>Computer science</subject><subject>Convolution</subject><subject>Decoding</subject><subject>Demodulation</subject><subject>Exact sciences and technology</subject><subject>Field programmable gate arrays</subject><subject>Hamming distance</subject><subject>Information, signal and communications theory</subject><subject>Parallel algorithms</subject><subject>Shift registers</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Viterbi algorithm</subject><isbn>0780385330</isbn><isbn>9780780385337</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFkM1LAzEUxAMiqLV3wUsuHlvfSzab5lgW-wEFPagHLyWfEE03S3YV-t9bXcG5DLz5zTsMITcIc0RQ99ummTOAao4cOQCekSuQC-ALwTlckGnfv8NJlagQ60vytqSrp_WSxkOX_MG3gx5ibmkOVNNOF52ST_Q1Dr6YSJ232flCQy7UpGw_qD3aFC3VraM2t185ff7Wf7D-mpwHnXo__fMJeVk9PDeb2e5xvW2Wu1lkwIeZrY1zNcKi5lI5ppkMGABNUNY6AUpZL5UwXHLv3OkgwDghAjMymNqpmk_I3fi3073VKRTd2tjvuxIPuhz3KAUTDPHE3Y5c9N7_x-NM_BuvGV03</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Reeve, J.S.</creator><creator>Amarasinghe, K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes</title><author>Reeve, J.S. ; Amarasinghe, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-c6bdd61086379d2a27f1f01bf9ccd5099ce795b373eddd5050bd55f2b7fb6d963</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Block codes</topic><topic>Coding, codes</topic><topic>Computer science</topic><topic>Convolution</topic><topic>Decoding</topic><topic>Demodulation</topic><topic>Exact sciences and technology</topic><topic>Field programmable gate arrays</topic><topic>Hamming distance</topic><topic>Information, signal and communications theory</topic><topic>Parallel algorithms</topic><topic>Shift registers</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Viterbi algorithm</topic><toplevel>online_resources</toplevel><creatorcontrib>Reeve, J.S.</creatorcontrib><creatorcontrib>Amarasinghe, K.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Reeve, J.S.</au><au>Amarasinghe, K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes</atitle><btitle>2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)</btitle><stitle>ICC</stitle><date>2004</date><risdate>2004</risdate><volume>5</volume><spage>2596</spage><epage>2599 Vol.5</epage><pages>2596-2599 Vol.5</pages><isbn>0780385330</isbn><isbn>9780780385337</isbn><abstract>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.</abstract><cop>Piscataway, New Jersey</cop><pub>IEEE</pub><doi>10.1109/ICC.2004.1313001</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0780385330
ispartof 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004, Vol.5, p.2596-2599 Vol.5
issn
language eng
recordid cdi_ieee_primary_1313001
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Applied sciences
Block codes
Coding, codes
Computer science
Convolution
Decoding
Demodulation
Exact sciences and technology
Field programmable gate arrays
Hamming distance
Information, signal and communications theory
Parallel algorithms
Shift registers
Signal and communications theory
Telecommunications and information theory
Viterbi algorithm
title A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T07%3A00%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20FPGA%20implementation%20of%20a%20parallel%20Viterbi%20decoder%20for%20block%20cyclic%20and%20convolution%20codes&rft.btitle=2004%20IEEE%20International%20Conference%20on%20Communications%20(IEEE%20Cat.%20No.04CH37577)&rft.au=Reeve,%20J.S.&rft.date=2004&rft.volume=5&rft.spage=2596&rft.epage=2599%20Vol.5&rft.pages=2596-2599%20Vol.5&rft.isbn=0780385330&rft.isbn_list=9780780385337&rft_id=info:doi/10.1109/ICC.2004.1313001&rft_dat=%3Cpascalfrancis_6IE%3E17525211%3C/pascalfrancis_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i203t-c6bdd61086379d2a27f1f01bf9ccd5099ce795b373eddd5050bd55f2b7fb6d963%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1313001&rfr_iscdi=true