{"id":"https://openalex.org/W4205797157","doi":"https://doi.org/10.1109/icct52962.2021.9657936","title":"An Improved Simplified Soft Cancellation Decoding Algorithm for Polar Codes Based on Frozen Bit Check","display_name":"An Improved Simplified Soft Cancellation Decoding Algorithm for Polar Codes Based on Frozen Bit Check","publication_year":2021,"publication_date":"2021-10-13","ids":{"openalex":"https://openalex.org/W4205797157","doi":"https://doi.org/10.1109/icct52962.2021.9657936"},"language":"en","primary_location":{"id":"doi:10.1109/icct52962.2021.9657936","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct52962.2021.9657936","pdf_url":null,"source":{"id":"https://openalex.org/S4363607878","display_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","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/A5102713832","display_name":"Mingyu Cai","orcid":"https://orcid.org/0000-0003-4686-5299"},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mingyu Cai","raw_affiliation_strings":["School of Information and Engineering Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Information and Engineering Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100359976","display_name":"Shufeng Li","orcid":"https://orcid.org/0000-0002-4837-1412"},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shufeng Li","raw_affiliation_strings":["School of Information and Engineering Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Information and Engineering Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100745764","display_name":"Zhicheng Liu","orcid":"https://orcid.org/0000-0001-7543-1946"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhicheng Liu","raw_affiliation_strings":["Guangdong South New Media Co., Ltd., Guangdong, China"],"affiliations":[{"raw_affiliation_string":"Guangdong South New Media Co., Ltd., Guangdong, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102713832"],"corresponding_institution_ids":["https://openalex.org/I75689368"],"apc_list":null,"apc_paid":null,"fwci":1.232,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75740234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9911999702453613,"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/decoding-methods","display_name":"Decoding methods","score":0.9123473763465881},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7367866039276123},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7268092036247253},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7118072509765625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7006978392601013},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5777496695518494},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4847573935985565},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4844486713409424},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4705268144607544},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3279551565647125},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.23778104782104492},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.09216740727424622}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.9123473763465881},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7367866039276123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7268092036247253},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7118072509765625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7006978392601013},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5777496695518494},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4847573935985565},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4844486713409424},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4705268144607544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3279551565647125},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.23778104782104492},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.09216740727424622}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icct52962.2021.9657936","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct52962.2021.9657936","pdf_url":null,"source":{"id":"https://openalex.org/S4363607878","display_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7723333905","display_name":null,"funder_award_id":"CUC210B032","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W183754908","https://openalex.org/W1522378257","https://openalex.org/W1814189632","https://openalex.org/W2003204237","https://openalex.org/W2048698796","https://openalex.org/W2051270424","https://openalex.org/W2056384400","https://openalex.org/W2106045225","https://openalex.org/W2113237846","https://openalex.org/W2126931301","https://openalex.org/W2150498905","https://openalex.org/W2164368671","https://openalex.org/W2890538755","https://openalex.org/W2963280471","https://openalex.org/W3104643471","https://openalex.org/W6631272215"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2118148379","https://openalex.org/W1978153242","https://openalex.org/W2159021452","https://openalex.org/W2167340446"],"abstract_inverted_index":{"Polar":[0],"codes":[1],"can":[2,116,133,147],"approach":[3],"the":[4,16,31,82,88,97,107,124],"Shannon":[5],"limit":[6],"with":[7,152,159],"arbitrary":[8],"binary-input":[9],"discrete":[10],"memoryless":[11],"channels.":[12],"As":[13],"one":[14],"of":[15,84],"most":[17],"advanced":[18],"soft-output":[19],"algorithms,":[20],"soft":[21,114],"cancellation":[22],"decoding":[23,28,62,72,85,104,146],"(SCAN)":[24],"has":[25],"a":[26,43],"better":[27],"performance":[29,155],"than":[30],"hard-output":[32],"algorithm,":[33],"such":[34],"as":[35],"conventional":[36],"successive-cancellation":[37],"(SC)":[38],"decoding.":[39,139,162],"However,":[40],"it":[41],"suffers":[42],"relative":[44],"high-complexity":[45],"and":[46],"low-throughput":[47],"due":[48],"to":[49,69,80,102,105],"iterative":[50],"computation.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55,132],"propose":[56],"an":[57,135],"improved":[58],"simplified":[59],"SCAN":[60,103,138,161],"(ISSCAN)":[61],"based":[63,128],"on":[64,129],"frozen":[65],"bit":[66],"check":[67],"(FBC)":[68],"further":[70],"reduce":[71],"complexity.":[73],"Two":[74],"new":[75],"special":[76],"nodes":[77,122],"are":[78,93],"proposed":[79,130,144],"simplify":[81,106],"traversal":[83],"tree.":[86],"Then":[87],"corresponding":[89],"message":[90,108],"passing":[91,109],"rules":[92],"also":[94,117],"derived.":[95],"Moreover,":[96],"FBC":[98,125],"method":[99],"is":[100],"extended":[101],"for":[110,121],"ordinary":[111],"nodes.":[112],"The":[113],"information":[115],"be":[118],"updated":[119],"directly":[120],"satisfying":[123],"condition.":[126],"Therefore,":[127],"method,":[131],"obtain":[134],"excellent":[136],"low-complexity":[137],"Simulation":[140],"results":[141],"show":[142],"that":[143],"ISSCAN":[145],"save":[148],"computational":[149],"complexity":[150],"significantly":[151],"negligible":[153],"error":[154],"loss":[156],"when":[157],"comparing":[158],"traditional":[160]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}