{"id":"https://openalex.org/W4416750813","doi":"https://doi.org/10.1109/sips66314.2025.11261293","title":"Reduced-Memory Fast-SC Decoding for Polar Codes With Parity Constraints","display_name":"Reduced-Memory Fast-SC Decoding for Polar Codes With Parity Constraints","publication_year":2025,"publication_date":"2025-11-01","ids":{"openalex":"https://openalex.org/W4416750813","doi":"https://doi.org/10.1109/sips66314.2025.11261293"},"language":null,"primary_location":{"id":"doi:10.1109/sips66314.2025.11261293","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips66314.2025.11261293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5083598415","display_name":"Tianbiao Yu","orcid":"https://orcid.org/0000-0002-6161-8838"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yu Tian","raw_affiliation_strings":["Southeast University,Lab of Efficient Architectures for Digital-communication and Signal-processing (LEADS) National Mobile Communications Research Laboratory,Nanjing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southeast University,Lab of Efficient Architectures for Digital-communication and Signal-processing (LEADS) National Mobile Communications Research Laboratory,Nanjing,China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030538379","display_name":"Huayi Zhou","orcid":"https://orcid.org/0000-0002-1745-4135"},"institutions":[{"id":"https://openalex.org/I4210155350","display_name":"Purple Mountain Laboratories","ror":"https://ror.org/04zcbk583","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210155350"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huayi Zhou","raw_affiliation_strings":["Purple Mountain Laboratories,Nanjing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purple Mountain Laboratories,Nanjing,China","institution_ids":["https://openalex.org/I4210155350"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100380082","display_name":"Chuan Zhang","orcid":"https://orcid.org/0000-0002-7736-6487"},"institutions":[{"id":"https://openalex.org/I4210155350","display_name":"Purple Mountain Laboratories","ror":"https://ror.org/04zcbk583","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210155350"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chuan Zhang","raw_affiliation_strings":["Purple Mountain Laboratories,Nanjing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purple Mountain Laboratories,Nanjing,China","institution_ids":["https://openalex.org/I4210155350"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43269445,"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":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9944000244140625,"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.9944000244140625,"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.0015999999595806003,"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.0007999999797903001,"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.8860999941825867},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6327999830245972},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5809999704360962},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.559499979019165},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4528999924659729},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.43369999527931213},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.42340001463890076}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8860999941825867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6556000113487244},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6327999830245972},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5809999704360962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5662999749183655},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.559499979019165},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4528999924659729},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.43369999527931213},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3253999948501587},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.30640000104904175},{"id":"https://openalex.org/C46637626","wikidata":"https://www.wikidata.org/wiki/Q6693015","display_name":"Low latency (capital markets)","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.2802000045776367},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2556999921798706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sips66314.2025.11261293","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips66314.2025.11261293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":10,"referenced_works":["https://openalex.org/W2003204237","https://openalex.org/W2150498905","https://openalex.org/W2290407458","https://openalex.org/W2595493241","https://openalex.org/W2750544224","https://openalex.org/W3133964355","https://openalex.org/W3158417549","https://openalex.org/W3196278328","https://openalex.org/W4312080373","https://openalex.org/W4387623924"],"related_works":[],"abstract_inverted_index":{"Successive":[0],"cancellation":[1],"(SC)":[2],"decoding":[3,10,18,45,74,84],"of":[4,51,92],"polar":[5,38],"codes":[6,39],"suffers":[7],"from":[8],"high":[9],"latency":[11,46,75,130],"due":[12],"to":[13,119,123],"its":[14],"sequential":[15],"nature.":[16],"Fast-SC":[17],"alleviates":[19],"this":[20],"by":[21,117],"identifying":[22],"special":[23,34],"nodes":[24],"that":[25,110],"enable":[26],"concurrent":[27],"multi-bit":[28],"decoding.":[29],"Recently,":[30],"a":[31,80],"more":[32],"general":[33],"node":[35],"for":[36,55,100],"high-rate":[37],"has":[40],"been":[41],"introduced,":[42],"offering":[43],"reduced":[44],"but":[47,68],"at":[48],"the":[49,88,98,111,124],"cost":[50],"substantial":[52],"memory":[53,66,115],"overhead":[54,67],"storing":[56],"precomputed":[57],"flipping":[58,61,101],"sets.":[59],"Alternative":[60],"set":[62,102],"generation":[63],"methods":[64],"eliminate":[65],"rely":[69],"on":[70,87],"iterative":[71],"procedures,":[72],"undermining":[73],"benefits.":[76],"This":[77],"paper":[78],"proposes":[79],"reduced-memory":[81],"fast-SC":[82],"(RMFSC)":[83],"method":[85],"based":[86],"inherent":[89],"parity":[90],"constraints":[91],"sequence":[93],"single-parity-check":[94],"(SSPC)":[95],"nodes,":[96],"without":[97],"need":[99],"storage.":[103],"Simulation":[104],"results":[105],"and":[106,131],"complexity":[107],"analysis":[108],"show":[109],"proposed":[112],"RM-FSC":[113],"reduces":[114],"requirements":[116],"up":[118],"$93.9":[120],"\\%$":[121],"compared":[122],"prior":[125],"arts,":[126],"while":[127],"preserving":[128],"low":[129],"incurring":[132],"only":[133],"negligible":[134],"performance":[135],"degradation.":[136]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-28T00:00:00"}