{"id":"https://openalex.org/W2921374214","doi":"https://doi.org/10.23919/isita.2018.8664365","title":"Error Performance Analysis of the K-best Viterbi Decoding Algorithm","display_name":"Error Performance Analysis of the K-best Viterbi Decoding Algorithm","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2921374214","doi":"https://doi.org/10.23919/isita.2018.8664365","mag":"2921374214"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664365","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5100601420","display_name":"Hideki Yoshikawa","orcid":"https://orcid.org/0000-0002-7389-8865"},"institutions":[{"id":"https://openalex.org/I310553","display_name":"Tohoku Gakuin University","ror":"https://ror.org/0504dfg48","country_code":"JP","type":"education","lineage":["https://openalex.org/I310553"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hideki Yoshikawa","raw_affiliation_strings":["Faculty of Engineering, Tohoku Gakuin University, Miyagi, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Tohoku Gakuin University, Miyagi, Japan","institution_ids":["https://openalex.org/I310553"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100601420"],"corresponding_institution_ids":["https://openalex.org/I310553"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17882405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"260"},"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.9994999766349792,"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/T11873","display_name":"PAPR reduction in OFDM","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.8955212831497192},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.8489104509353638},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8385891318321228},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.8280321955680847},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.818770170211792},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.7994496822357178},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7583180665969849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6928600072860718},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.637060284614563},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6118402481079102},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.46220847964286804},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4163419008255005},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3115009069442749},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1561533808708191}],"concepts":[{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.8955212831497192},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.8489104509353638},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8385891318321228},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.8280321955680847},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.818770170211792},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.7994496822357178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7583180665969849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6928600072860718},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.637060284614563},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6118402481079102},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.46220847964286804},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4163419008255005},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3115009069442749},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1561533808708191}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664365","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1915619113","https://openalex.org/W2042712440","https://openalex.org/W2079667625","https://openalex.org/W2117196681","https://openalex.org/W2122683098","https://openalex.org/W2152797116","https://openalex.org/W2158013335","https://openalex.org/W2573161648","https://openalex.org/W2580841442","https://openalex.org/W2583966141","https://openalex.org/W6640023185","https://openalex.org/W6732080234","https://openalex.org/W6732649937"],"related_works":["https://openalex.org/W3096277017","https://openalex.org/W2544568790","https://openalex.org/W1915619113","https://openalex.org/W2790444905","https://openalex.org/W4232476001","https://openalex.org/W2143297499","https://openalex.org/W2146383045","https://openalex.org/W2375912048","https://openalex.org/W1879414379","https://openalex.org/W2025673760"],"abstract_inverted_index":{"The":[0,23,55],"Viterbi":[1,25,67,98],"algorithm":[2,27,69,100],"is":[3,16,32,40,101],"widely":[4],"applied":[5],"for":[6,28,44,70,92,96],"the":[7,10,14,20,29,61,77,90],"decoding":[8,26,37,68,99],"of":[9,46,66,80,84],"convolutional":[11,30,71],"codes.":[12,72],"But":[13],"complexity":[15],"increase":[17],"rapidly":[18],"in":[19],"constraint":[21],"length.":[22],"K-best":[24,97],"codes":[31],"proposed":[33],"to":[34,42],"reduce":[35],"its":[36],"complexity.":[38],"This":[39,73],"expected":[41],"apply":[43],"Internet":[45],"Things(IoT)":[47],"devices":[48],"which":[49],"are":[50],"low-scale":[51],"and":[52],"low-power":[53],"hardwares.":[54],"author":[56],"have":[57],"already":[58],"shown":[59],"that":[60],"exact":[62],"bit":[63],"error":[64,93],"performance":[65,94],"analytical":[74],"technique":[75],"employs":[76],"iterative":[78],"calculation":[79],"probability":[81],"density":[82],"function":[83],"path":[85],"metrics.":[86],"In":[87],"this":[88],"paper,":[89],"application":[91],"analysis":[95],"demonstrated.":[102]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}