{"id":"https://openalex.org/W2156177599","doi":"https://doi.org/10.1109/isit.2004.1365527","title":"A simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency","display_name":"A simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2156177599","doi":"https://doi.org/10.1109/isit.2004.1365527","mag":"2156177599"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5100819191","display_name":"Yu Liao","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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yu Liao","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109149767","display_name":"Christophe Kieffer","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Kieffer","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, MN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100819191"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18326655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"490","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":1.0,"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":1.0,"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.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9980000257492065,"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/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.8250526785850525},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7703772187232971},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.7250877618789673},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7127002477645874},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6640796661376953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6603384017944336},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6443212628364563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6108967065811157},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5721800923347473},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5337480306625366},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5097803473472595},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5076667070388794},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.43575426936149597},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.4226810336112976}],"concepts":[{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.8250526785850525},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7703772187232971},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.7250877618789673},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7127002477645874},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6640796661376953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6603384017944336},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6443212628364563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6108967065811157},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5721800923347473},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5337480306625366},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5097803473472595},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5076667070388794},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.43575426936149597},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.4226810336112976}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2053484954","https://openalex.org/W2130515157"],"related_works":["https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W2377186915","https://openalex.org/W2247418595","https://openalex.org/W1866038923","https://openalex.org/W1976480044","https://openalex.org/W2010879611","https://openalex.org/W2996270337","https://openalex.org/W2153574137","https://openalex.org/W2987449952"],"abstract_inverted_index":{"A":[0],"highly":[1],"parallel":[2,56],"maximum":[3],"a":[4,37,47,60],"posteriori":[5],"(MAP)":[6],"decoding":[7,41,44,51,57,110],"algorithm":[8,58],"is":[9],"proposed":[10,55],"for":[11],"high":[12,69],"code":[13],"rate,":[14],"R":[15],"=":[16],"(n-1)/":[17],"n":[18],",":[19],"ordinary":[20,71],"(nonpunctured)":[21],"convolutional":[22,29,72],"codes":[23,65,96],"using":[24],"trellises":[25],"of":[26,33,40,50,62,68,94,114],"reciprocal":[27],"dual":[28],"codes.":[30,116],"The":[31],"advantages":[32],"this":[34],"approach":[35],"include":[36],"substantial":[38,48],"reduction":[39],"latency":[42],"and":[43,46,86,97],"complexity,":[45],"increase":[49],"throughput.":[52],"Applying":[53],"the":[54],"to":[59,92],"class":[61],"serial":[63],"concatenation":[64],"that":[66,93,113],"consist":[67],"rate":[70,84,89],"codes,":[73,103],"over":[74],"additive":[75],"white":[76],"Gaussian":[77],"noise":[78],"(AWGN)":[79],"channels,":[80],"good":[81],"bit":[82],"error":[83,88],"(BER)":[85],"block":[87],"performance,":[90],"comparable":[91],"turbo":[95],"low":[98],"density":[99],"parity":[100],"check":[101],"(LDPC)":[102],"can":[104],"be":[105],"obtained":[106],"with":[107],"smaller":[108],"overall":[109],"complexity":[111],"than":[112],"LDPC":[115]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}