{"id":"https://openalex.org/W4391496463","doi":"https://doi.org/10.1109/wcsp58612.2023.10404230","title":"An Adaptive Successive Cancellation Priority Decoder with Iteratively-increased Searching Width for Polar Codes","display_name":"An Adaptive Successive Cancellation Priority Decoder with Iteratively-increased Searching Width for Polar Codes","publication_year":2023,"publication_date":"2023-11-02","ids":{"openalex":"https://openalex.org/W4391496463","doi":"https://doi.org/10.1109/wcsp58612.2023.10404230"},"language":"en","primary_location":{"id":"doi:10.1109/wcsp58612.2023.10404230","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wcsp58612.2023.10404230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Wireless Communications and Signal Processing (WCSP)","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/A5002553168","display_name":"Di Guan","orcid":"https://orcid.org/0000-0003-0951-4297"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Di Guan","raw_affiliation_strings":["Beijing University of Post and Telecommunication,Key Laboratory of Universal Wireless Communications, Ministry of Education,Beijing,China,100876"],"affiliations":[{"raw_affiliation_string":"Beijing University of Post and Telecommunication,Key Laboratory of Universal Wireless Communications, Ministry of Education,Beijing,China,100876","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008455605","display_name":"Kai Niu","orcid":"https://orcid.org/0000-0002-8076-1867"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Niu","raw_affiliation_strings":["Beijing University of Post and Telecommunication,Key Laboratory of Universal Wireless Communications, Ministry of Education,Beijing,China,100876"],"affiliations":[{"raw_affiliation_string":"Beijing University of Post and Telecommunication,Key Laboratory of Universal Wireless Communications, Ministry of Education,Beijing,China,100876","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002553168"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23606092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"220","last_page":"225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9937000274658203,"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.9936000108718872,"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.883253812789917},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7452441453933716},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6978756189346313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6636759638786316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5840497016906738},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5211793780326843},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4533079266548157},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.14347341656684875},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10784298181533813},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.10685569047927856}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.883253812789917},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7452441453933716},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6978756189346313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6636759638786316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5840497016906738},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5211793780326843},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4533079266548157},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.14347341656684875},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10784298181533813},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.10685569047927856}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcsp58612.2023.10404230","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wcsp58612.2023.10404230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Wireless Communications and Signal Processing (WCSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W183754908","https://openalex.org/W1531728251","https://openalex.org/W1972808865","https://openalex.org/W1981735015","https://openalex.org/W2014443100","https://openalex.org/W2033234285","https://openalex.org/W2106045225","https://openalex.org/W2150498905","https://openalex.org/W2284321898","https://openalex.org/W2887598929","https://openalex.org/W2908041465"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2369600518","https://openalex.org/W2029144766","https://openalex.org/W2089275957","https://openalex.org/W2165241191","https://openalex.org/W2964031101"],"abstract_inverted_index":{"The":[0,128],"successive":[1,31],"cancellation":[2,32],"list":[3,21],"(SCL)":[4],"decoding":[5,18,35,45,82,93,114,159],"of":[6,42,137],"polar":[7],"codes":[8],"can":[9,132,155],"achieve":[10,156],"a":[11,96,125],"performance":[12,160],"close":[13],"to":[14,38,70,111],"the":[15,40,43,73,77,80,88,92,113,134,138,145,151,157,162,171],"maximum-likelihood":[16],"(ML)":[17],"while":[19,168],"large":[20],"size":[22],"results":[23,141],"in":[24],"high":[25],"computational":[26],"complexity.":[27,49,172],"To":[28],"this":[29,51],"end,":[30],"priority":[33,66,74],"(SCP)":[34],"is":[36,63,109],"proposed":[37,152],"reduce":[39,133],"complexity":[41,136],"SCL":[44,165],"with":[46,58,87,95],"acceptable":[47],"space":[48],"In":[50],"paper,":[52],"an":[53,105],"adaptive":[54,164],"SCP":[55],"(ADSCP)":[56],"decoder":[57,154,167],"iteratively":[59],"increased":[60],"searching":[61,90,98,147],"width":[62,99,148],"proposed.":[64],"Two":[65],"queues":[67],"are":[68,121],"applied":[69,110],"store":[71],"all":[72],"nodes":[75],"during":[76],"decoding.":[78],"When":[79],"correct":[81],"path":[83,119],"cannot":[84],"be":[85,102],"obtained":[86],"current":[89],"width,":[91],"continues":[94],"larger":[97],"rather":[100],"than":[101],"restarted.":[103],"Furthermore,":[104],"early":[106,129],"termination":[107,130],"criterion":[108,131],"quit":[112],"when":[115],"too":[116],"many":[117],"inefficient":[118],"extensions":[120],"performed":[122],"based":[123],"on":[124],"preset":[126],"threshold.":[127],"worst-case":[135],"decoder.":[139],"Simulation":[140],"show":[142],"that":[143],"given":[144],"same":[146,158],"(list":[149],"size),":[150],"ADSCP":[153],"as":[161],"conventional":[163],"(ADSCL)":[166],"significantly":[169],"reducing":[170]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}