{"id":"https://openalex.org/W4417508550","doi":"https://doi.org/10.1109/lwc.2025.3646218","title":"Simplified Viterbi-Like Successive-Cancellation Decoding Algorithm for Polar Codes","display_name":"Simplified Viterbi-Like Successive-Cancellation Decoding Algorithm for Polar Codes","publication_year":2025,"publication_date":"2025-12-19","ids":{"openalex":"https://openalex.org/W4417508550","doi":"https://doi.org/10.1109/lwc.2025.3646218"},"language":null,"primary_location":{"id":"doi:10.1109/lwc.2025.3646218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2025.3646218","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","raw_type":"journal-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/A5004613143","display_name":"Rui Guo","orcid":"https://orcid.org/0000-0003-2575-1903"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Rui Guo","raw_affiliation_strings":["School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100418037","display_name":"Yulin Wang","orcid":"https://orcid.org/0000-0002-1363-0234"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yulin Wang","raw_affiliation_strings":["School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120860756","display_name":"Xiyue Xue","orcid":"https://orcid.org/0009-0009-9538-3502"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiyue Xue","raw_affiliation_strings":["School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044332886","display_name":"Meilin He","orcid":"https://orcid.org/0000-0002-1615-8924"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meilin He","raw_affiliation_strings":["School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004613143"],"corresponding_institution_ids":["https://openalex.org/I50760025"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.45180378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":null,"first_page":"1165","last_page":"1169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9890999794006348,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9890999794006348,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.003800000064074993,"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/T11130","display_name":"Coding theory and cryptography","score":0.0020000000949949026,"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/decoding-methods","display_name":"Decoding methods","score":0.8266000151634216},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7160999774932861},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6984999775886536},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5942999720573425},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.570900022983551},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5594000220298767},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5353999733924866},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5063999891281128}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8266000151634216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7803999781608582},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7160999774932861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7120000123977661},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6984999775886536},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5942999720573425},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.570900022983551},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5594000220298767},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5353999733924866},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5063999891281128},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.49639999866485596},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.45809999108314514},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45660001039505005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.40529999136924744},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31679999828338623},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.3025999963283539},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.2971000075340271},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.2696000039577484}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lwc.2025.3646218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2025.3646218","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1401783407","display_name":null,"funder_award_id":"62371174","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G1864700820","display_name":null,"funder_award_id":"BS123456","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2106045225","https://openalex.org/W2783438090","https://openalex.org/W2963389341","https://openalex.org/W2975829198","https://openalex.org/W2997843324","https://openalex.org/W3082322395","https://openalex.org/W3088373859","https://openalex.org/W3119742982","https://openalex.org/W4205589647","https://openalex.org/W4286675746","https://openalex.org/W4367692525","https://openalex.org/W4390604279","https://openalex.org/W4391768746"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,98,106,120],"novel":[4],"Viterbi-Like":[5],"successive":[6,75],"cancellation":[7,76],"(VL-SC)":[8],"decoding":[9,77,141,160],"algorithm":[10,15,67],"for":[11,97],"polar":[12],"codes.":[13],"The":[14,65],"employs":[16],"the":[17,21,25,30,44,51,69,73,81,112,132,146,149],"bit":[18],"log-likelihood-ratio":[19],"as":[20],"\u201cpenalty":[22],"value\u201d":[23],"within":[24],"Viterbi":[26],"framework":[27],"to":[28,131],"determine":[29],"next":[31],"path":[32],"quickly,":[33],"especially":[34],"in":[35,72,122,152],"low":[36],"signal-to-noise":[37],"ratio":[38],"(SNR)":[39],"scenarios.":[40],"To":[41],"further":[42],"reduce":[43],"time":[45,123],"complexity,":[46],"an":[47],"enhanced":[48,66],"version":[49],"of":[50,84,101,108,148],"VL-SC":[52,55,113,115],"algorithm,":[53,137],"termed":[54],"with":[56,61,116],"Simplified":[57],"Inherit":[58],"Mechanism":[59],"(VL-SC":[60],"SIM)":[62],"is":[63],"presented.":[64],"uses":[68],"soft":[70],"information":[71],"initial":[74],"process":[78],"and":[79,105,114,127,155],"minimizes":[80],"computational":[82],"amount":[83],"specific":[85],"bits":[86],"by":[87,125],"inheriting":[88],"some":[89],"logarithmic":[90],"likelihood":[91],"ratios.":[92],"Simulation":[93],"results":[94,144],"demonstrate":[95],"that":[96],"code":[99],"length":[100],"N":[102],"=":[103,110,135],"512":[104],"rate":[107],"R":[109],"0.5,":[111],"SIM":[117],"algorithms":[118,151],"achieve":[119],"reduction":[121],"complexity":[124,154],"17%":[126],"23%,":[128],"respectively,":[129],"compared":[130],"SC-Flip":[133],"(T":[134],"4)":[136],"while":[138],"maintaining":[139],"similar":[140],"performance.":[142],"These":[143],"highlight":[145],"effectiveness":[147],"proposed":[150],"reducing":[153],"improving":[156],"efficiency":[157],"without":[158],"sacrificing":[159],"accuracy.":[161]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-19T00:00:00"}