{"id":"https://openalex.org/W2102649265","doi":"https://doi.org/10.1109/sips.2008.4671752","title":"Minimal complexity low-latency architectures for Viterbi decoders","display_name":"Minimal complexity low-latency architectures for Viterbi decoders","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W2102649265","doi":"https://doi.org/10.1109/sips.2008.4671752","mag":"2102649265"},"language":"en","primary_location":{"id":"doi:10.1109/sips.2008.4671752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2008.4671752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Workshop on Signal Processing Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5060936278","display_name":"Renfei Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renfei Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Twin-Cities, Minneapolis, MN, USA","Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Twin-Cities, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007884053","display_name":"Keshab K. Parhi","orcid":"https://orcid.org/0000-0001-6543-2793"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keshab K. Parhi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Twin-Cities, Minneapolis, MN, USA","Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Twin-Cities, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9489,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69816368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9990000128746033,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.9010311365127563},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.8121399879455566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7181002497673035},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.5843267440795898},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.537828266620636},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5295423269271851},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.484333872795105},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.48123741149902344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47928231954574585},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4189518094062805},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40649887919425964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37640687823295593},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.34674713015556335}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.9010311365127563},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.8121399879455566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7181002497673035},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.5843267440795898},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.537828266620636},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5295423269271851},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.484333872795105},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.48123741149902344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47928231954574585},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4189518094062805},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40649887919425964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37640687823295593},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.34674713015556335},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sips.2008.4671752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2008.4671752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Workshop on Signal Processing Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1501488688","https://openalex.org/W1527784934","https://openalex.org/W1991133427","https://openalex.org/W2018434868","https://openalex.org/W2025801271","https://openalex.org/W2117435751","https://openalex.org/W2129633426","https://openalex.org/W2160140225","https://openalex.org/W2165988944","https://openalex.org/W2789218021"],"related_works":["https://openalex.org/W2153873100","https://openalex.org/W2241520515","https://openalex.org/W2147640366","https://openalex.org/W2139866533","https://openalex.org/W2120870373","https://openalex.org/W2104535194","https://openalex.org/W2565661620","https://openalex.org/W2019689624","https://openalex.org/W2540435636","https://openalex.org/W2387789146"],"abstract_inverted_index":{"For":[0,66],"Viterbi":[1,68],"decoders,":[2],"high":[3],"throughput":[4],"rate":[5],"is":[6,17,39,97,110,123,130,147,185],"achieved":[7],"by":[8,163,170],"applying":[9],"look-ahead":[10,63],"techniques":[11,23],"in":[12,35,91],"the":[13,18,43,62,88,107,156,161,168,176,190],"add-compare-select":[14],"unit,":[15],"which":[16,38,114],"system":[19],"speed":[20],"bottleneck.":[21],"Look-ahead":[22],"combine":[24],"multiple":[25,149],"binary":[26],"trellis":[27,33],"steps":[28],"into":[29],"one":[30],"equivalent":[31],"complex":[32],"step":[34],"time":[36],"sequence,":[37],"referred":[40],"to":[41,61,80,138,165,172],"as":[42],"branch":[44,93],"metrics":[45,78],"precomputation":[46],"(BMP)":[47],"unit.":[48],"The":[49,125,152],"complexity":[50,120,162],"and":[51,57,74,83,100,121,167],"latency":[52,122,169],"of":[53,127,150],"BMP":[54],"increase":[55],"exponentially":[56],"linearly":[58],"with":[59,70,118],"respect":[60],"levels,":[64],"respectively.":[65],"a":[67,101,115,139],"decoder":[69],"constraint":[71],"length":[72],"K":[73],"M-step":[75],"look-ahead,":[76],"2M+K-1branch":[77],"need":[79],"be":[81,181],"computed":[82],"compared.":[84],"In":[85,174],"this":[86],"paper,":[87],"computational":[89],"redundancy":[90],"existing":[92],"metric":[94],"computation":[95],"approaches":[96,158],"first":[98],"recognized,":[99],"general":[102],"mathematical":[103],"model":[104],"for":[105,144],"describing":[106],"approach":[108,117,136],"space":[109],"built,":[111],"based":[112],"on":[113],"new":[116],"minimal":[119,191],"proposed.":[124],"proof":[126],"its":[128],"optimality":[129],"also":[131,180],"given.":[132],"This":[133],"highly":[134],"efficient":[135],"leads":[137],"novel":[140],"overall":[141],"optimal":[142],"architecture":[143,178],"M":[145,184],"that":[146,155],"any":[148,186],"K.":[151],"results":[153],"show":[154],"proposed":[157,177],"can":[159,179],"reduce":[160],"up":[164,171],"45.65%":[166],"72.50%.":[173],"addition,":[175],"applied":[182],"when":[183],"value":[187],"while":[188],"achieving":[189],"complexity.":[192]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}