{"id":"https://openalex.org/W4415368772","doi":"https://doi.org/10.1109/isit63088.2025.11195547","title":"Low-Complexity PSCL Decoding of Polar Codes","display_name":"Low-Complexity PSCL Decoding of Polar Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368772","doi":"https://doi.org/10.1109/isit63088.2025.11195547"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5079749249","display_name":"Xinyuanmeng Yao","orcid":"https://orcid.org/0000-0003-3981-4661"},"institutions":[{"id":"https://openalex.org/I159389169","display_name":"Ningbo University of Technology","ror":"https://ror.org/037dym702","country_code":"CN","type":"education","lineage":["https://openalex.org/I159389169"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinyuanmeng Yao","raw_affiliation_strings":["School of Cyber Science and Engineering, Ningbo University of Technology,Ningbo,China"],"affiliations":[{"raw_affiliation_string":"School of Cyber Science and Engineering, Ningbo University of Technology,Ningbo,China","institution_ids":["https://openalex.org/I159389169"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052840428","display_name":"Xiao Ma","orcid":"https://orcid.org/0000-0003-3877-5023"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Ma","raw_affiliation_strings":["School of Computer Science and Engineering, Sun Yat-sen University,Guangdong Key Laboratory of Information Security Technology,Guangzhou,China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University,Guangdong Key Laboratory of Information Security Technology,Guangzhou,China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079749249"],"corresponding_institution_ids":["https://openalex.org/I159389169"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34600516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9779999852180481,"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.9779999852180481,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9700000286102295,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9642999768257141,"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.8715999722480774},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8159999847412109},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7893000245094299},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.5270000100135803},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5238999724388123},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.48649999499320984},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.48030000925064087}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8715999722480774},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8159999847412109},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7893000245094299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6294000148773193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6115000247955322},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.5270000100135803},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.48649999499320984},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.48030000925064087},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4268999993801117},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.3758000135421753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29760000109672546},{"id":"https://openalex.org/C46637626","wikidata":"https://www.wikidata.org/wiki/Q6693015","display_name":"Low latency (capital markets)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2806999981403351},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.28040000796318054},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3673891818","display_name":null,"funder_award_id":"2021YFA1000500","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2003204237","https://openalex.org/W2028139933","https://openalex.org/W2033234285","https://openalex.org/W2051270424","https://openalex.org/W2106045225","https://openalex.org/W2134750166","https://openalex.org/W2150498905","https://openalex.org/W2228116382","https://openalex.org/W2554527937","https://openalex.org/W2601496744","https://openalex.org/W2750544224","https://openalex.org/W2805436034","https://openalex.org/W2913275315","https://openalex.org/W2923621805","https://openalex.org/W2963809011","https://openalex.org/W2964031101","https://openalex.org/W3030940639","https://openalex.org/W3146859493","https://openalex.org/W3196329771","https://openalex.org/W4323896563","https://openalex.org/W4388240182","https://openalex.org/W4401692309"],"related_works":[],"abstract_inverted_index":{"Successive":[0],"cancellation":[1],"list":[2,103,133],"(SCL)":[3],"decoding":[4,30,36,59,82,115],"enables":[5],"polar":[6,67,150],"codes":[7,151],"to":[8,46,138],"deliver":[9],"satisfactory":[10],"performance":[11],"in":[12,56,112],"finite-length":[13],"scenarios":[14],"but":[15],"it":[16],"comes":[17],"with":[18,61],"high":[19],"latency":[20,63],"and":[21,64,93,128,164,170],"complexity.":[22],"To":[23,69],"reduce":[24],"latency,":[25],"a":[26,34,91,102,109],"partitioned":[27],"SCL":[28],"(PSCL)":[29],"algorithm,":[31],"implemented":[32],"over":[33],"PSCL":[35,53,81,114,158],"tree,":[37],"can":[38],"be":[39],"utilized.":[40],"In":[41],"this":[42],"work,":[43],"we":[44,72,107],"aim":[45],"lower":[47],"down":[48],"the":[49,52,80,88,94,99,113,125,130,142,155,161,165,174],"complexity":[50,65,163,167],"of":[51,79,90,101,104,134],"decoding,":[54],"resulting":[55],"an":[57],"efficient":[58],"algorithm":[60],"low":[62],"for":[66,86,97],"codes.":[68],"achieve":[70],"this,":[71],"define":[73],"two":[74],"metrics":[75],"at":[76],"each":[77],"level":[78],"tree.":[83],"One":[84],"is":[85,96,136],"evaluating":[87,98],"reliability":[89,100],"path":[92],"other":[95],"paths.":[105],"Then,":[106],"propose":[108],"double-threshold":[110],"strategy":[111],"process":[116],"where":[117],"unreliable":[118],"valid":[119],"paths":[120,135],"are":[121,152,168],"pruned":[122],"based":[123,140],"on":[124,141],"first":[126],"metric,":[127],"then":[129],"smallest":[131],"reliable":[132],"selected":[137],"continue":[139],"second":[143],"metric.":[144],"Simulation":[145],"results":[146],"demonstrate":[147],"that":[148],"when":[149],"decoded":[153],"using":[154],"proposed":[156],"low-complexity":[157],"decoder,":[159],"both":[160],"sorting":[162],"computational":[166],"reduced":[169],"significantly":[171],"decrease":[172],"as":[173],"signal-to-noise":[175],"ratio":[176],"(SNR)":[177],"increases.":[178]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}