{"id":"https://openalex.org/W1981534034","doi":"https://doi.org/10.1109/icc.2004.1313001","title":"A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes","display_name":"A FPGA implementation of a parallel Viterbi decoder for block cyclic and convolution codes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1981534034","doi":"https://doi.org/10.1109/icc.2004.1313001","mag":"1981534034"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1313001","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1313001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107826790","display_name":"J S Reeve","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"J.S. Reeve","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK","Sch. of Electron. & Comput. Sci., Southampton Univ., UK"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Southampton Univ., UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028231926","display_name":"K. Amarasinghe","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"K. Amarasinghe","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK","Sch. of Electron. & Comput. Sci., Southampton Univ., UK"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Southampton Univ., UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107826790"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":0.9243,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80911093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2596","last_page":"2599 Vol.5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.7973450422286987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7685201168060303},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6540210247039795},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.6041017770767212},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.5909730792045593},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.506817638874054},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5037652850151062},{"id":"https://openalex.org/keywords/gate-array","display_name":"Gate array","score":0.4952191412448883},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.49162155389785767},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.48916319012641907},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.43476828932762146},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.43145668506622314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3626349866390228},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.17637062072753906}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7973450422286987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7685201168060303},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6540210247039795},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6041017770767212},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.5909730792045593},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.506817638874054},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5037652850151062},{"id":"https://openalex.org/C114237110","wikidata":"https://www.wikidata.org/wiki/Q114901","display_name":"Gate array","level":3,"score":0.4952191412448883},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.49162155389785767},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.48916319012641907},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.43476828932762146},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.43145668506622314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3626349866390228},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.17637062072753906},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2004.1313001","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1313001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.soton.ac.uk:259027","is_oa":false,"landing_page_url":"https://eprints.soton.ac.uk/259027/1/paper.ps","pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1509342228","https://openalex.org/W1537824340","https://openalex.org/W1556443961","https://openalex.org/W1582258944","https://openalex.org/W1593683169","https://openalex.org/W1594652978","https://openalex.org/W1991133427","https://openalex.org/W2007572995","https://openalex.org/W2083774980","https://openalex.org/W2092021885","https://openalex.org/W3216147140","https://openalex.org/W6635098939","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W2102309991","https://openalex.org/W1795315578","https://openalex.org/W2373954783","https://openalex.org/W1843778016","https://openalex.org/W2921374214","https://openalex.org/W1915619113","https://openalex.org/W2165098971","https://openalex.org/W2167704123","https://openalex.org/W2544568790","https://openalex.org/W176266968"],"abstract_inverted_index":{"We":[0,94],"present":[1,96],"a":[2,22,55,64,97],"parallel":[3],"version":[4],"of":[5,28,74],"Viterbi's":[6],"decoding":[7],"procedure,":[8],"for":[9,39,52,77,100,106],"which":[10,59],"we":[11,60],"are":[12],"able":[13],"to":[14,30,87],"demonstrate":[15,70],"that":[16],"the":[17,26,34,71,75,102],"resultant":[18],"task":[19],"graph":[20],"has":[21],"restricted":[23],"complexity":[24],"in":[25,46],"number":[27],"communications":[29],"or":[31],"from":[32],"and":[33,69,91],"processor":[35,57],"cannot":[36],"exceed":[37],"4":[38],"BCH":[40,80],"codes.":[41,81,93,108],"The":[42,82],"resulting":[43],"algorithm":[44,76],"works":[45],"lock":[47],"step":[48],"making":[49],"it":[50],"suitable":[51],"implementation":[53],"on":[54,63],"systolic":[56],"array,":[58],"have":[61],"implemented":[62],"field":[65],"programmable":[66],"gate":[67],"array":[68],"perfect":[72],"scaling":[73],"two":[78],"exemplar":[79],"parallelisation":[83],"strategy":[84],"is":[85],"applicable":[86],"all":[88],"cyclic":[89],"codes":[90],"convolution":[92],"also":[95],"novel":[98],"method":[99],"generating":[101],"state":[103],"transition":[104],"diagrams":[105],"these":[107]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}