{"id":"https://openalex.org/W2064494308","doi":"https://doi.org/10.1109/icc.2004.1312549","title":"Low complexity algorithm for the decoding of convolutional codes of any rate","display_name":"Low complexity algorithm for the decoding of convolutional codes of any rate","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2064494308","doi":"https://doi.org/10.1109/icc.2004.1312549","mag":"2064494308"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312549","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":"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/A5044937566","display_name":"J.-C. Dany","orcid":null},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J.-C. Dany","raw_affiliation_strings":["Radio Department, SUPELEC, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radio Department, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036403159","display_name":"J. Antoine","orcid":null},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J. Antoine","raw_affiliation_strings":["Radio Department, SUPELEC, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radio Department, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028357817","display_name":"L. Husson","orcid":null},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L. Husson","raw_affiliation_strings":["Radio Department, SUPELEC, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radio Department, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056859232","display_name":"A. Wautier","orcid":null},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Wautier","raw_affiliation_strings":["Radio Department, SUPELEC, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radio Department, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086505464","display_name":"Nicolas Paul","orcid":"https://orcid.org/0000-0003-2228-3980"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Paul","raw_affiliation_strings":["Alcatel Research and Innovation, ALCATEL, Marcoussis, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alcatel Research and Innovation, ALCATEL, Marcoussis, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033498845","display_name":"J. Brouet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Brouet","raw_affiliation_strings":["Alcatel Research and Innovation, ALCATEL, Marcoussis, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alcatel Research and Innovation, ALCATEL, Marcoussis, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4137,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.58387906,"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":"547","last_page":"551 Vol.1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8921552896499634},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7513558864593506},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7355019450187683},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7276157140731812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7065043449401855},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.6950919032096863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6937242746353149},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6783785820007324},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5482726693153381},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5400794744491577},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5277909636497498},{"id":"https://openalex.org/keywords/word-error-rate","display_name":"Word error rate","score":0.5269102454185486},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.49718692898750305},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3737322688102722},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.28058964014053345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20648324489593506},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.20073801279067993}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8921552896499634},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7513558864593506},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7355019450187683},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7276157140731812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7065043449401855},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.6950919032096863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6937242746353149},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6783785820007324},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5482726693153381},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5400794744491577},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5277909636497498},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.5269102454185486},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.49718692898750305},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3737322688102722},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.28058964014053345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20648324489593506},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.20073801279067993},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icc.2004.1312549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312549","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:CiteSeerX.psu:10.1.1.1012.4805","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1012.4805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.ust.hk/%7Eeejinjie/research_files/viterbi_files/Low%20complexity%20algorithm%20for%20the%20decoding%20of%20convolutional%20codes%20of%20any%20rate.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.5008","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.5008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.supelec.fr/ecole/radio/Low_complexity_decoding_any_rate_ICC04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W2029405851","https://openalex.org/W2064759901","https://openalex.org/W2122683098","https://openalex.org/W2142384583","https://openalex.org/W2152011388","https://openalex.org/W2153810958","https://openalex.org/W2182112064","https://openalex.org/W6632090173","https://openalex.org/W7028394351"],"related_works":["https://openalex.org/W1843778016","https://openalex.org/W2921374214","https://openalex.org/W3194244515","https://openalex.org/W1915619113","https://openalex.org/W2165098971","https://openalex.org/W2167704123","https://openalex.org/W2544568790","https://openalex.org/W176266968","https://openalex.org/W2134727924","https://openalex.org/W99853930"],"abstract_inverted_index":{"It":[0],"is":[1,23,35,54,77,84,126],"well":[2],"known":[3],"that":[4],"convolutional":[5,41],"codes":[6,50],"can":[7],"be":[8],"optimally":[9],"decoded":[10],"by":[11],"using":[12],"the":[13,21,27,32,60,65,94,96,98,119],"Viterbi":[14],"algorithm":[15],"(VA).":[16],"A":[17],"decoding":[18],"technique":[19],"where":[20],"VA":[22],"applied":[24],"to":[25,49,74,82],"identify":[26],"error":[28],"vector":[29],"rather":[30],"than":[31,109],"information":[33],"message":[34],"proposed.":[36],"We":[37],"previously":[38],"focused":[39],"on":[40],"coders":[42],"of":[43,51,63,68,72,90,121],"rate":[44,53],"1/2":[45],".":[46],"The":[47,92],"method":[48],"any":[52],"generalized":[55],"and":[56],"shows":[57],"that,":[58],"with":[59,86],"proposed":[61],"type":[62],"decoding,":[64],"exhaustive":[66],"computation":[67,120],"a":[69,87,112],"vast":[70],"majority":[71],"state":[73,75],"iterations":[76],"unnecessary.":[78],"Hence,":[79],"performance":[80],"close":[81],"optimum":[83],"achievable":[85],"significant":[88],"reduction":[89,101,115],"complexity.":[91,103],"higher":[93],"SNR,":[95],"greater":[97,108],"improvement":[99],"for":[100,106,118],"in":[102,116],"For":[104],"instance,":[105],"SNR":[107],"3":[110],"dB,":[111],"five":[113],"fold":[114],"complexity":[117],"ACS":[122],"(add":[123],"compare":[124],"select)":[125],"achieved.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}