{"id":"https://openalex.org/W4414230864","doi":"https://doi.org/10.1109/istc65386.2025.11154636","title":"Optimizing Schedulers for Layered BP Decoding: From Code-Specific to Universal Decoding","display_name":"Optimizing Schedulers for Layered BP Decoding: From Code-Specific to Universal Decoding","publication_year":2025,"publication_date":"2025-08-18","ids":{"openalex":"https://openalex.org/W4414230864","doi":"https://doi.org/10.1109/istc65386.2025.11154636"},"language":"en","primary_location":{"id":"doi:10.1109/istc65386.2025.11154636","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","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/A5085682840","display_name":"Ahmed Elkelesh","orcid":"https://orcid.org/0000-0003-1711-0233"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahmed Elkelesh","raw_affiliation_strings":["Nokia Bell Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002562044","display_name":"Jonathan Ling","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan Ling","raw_affiliation_strings":["Nokia Bell Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"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.31177287,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8924000263214111,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8924000263214111,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.8446999788284302,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11034","display_name":"Digital Filter Design and Implementation","score":0.7508999705314636,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.781000018119812},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6617000102996826},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6182000041007996},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.49309998750686646},{"id":"https://openalex.org/keywords/hybrid-automatic-repeat-request","display_name":"Hybrid automatic repeat request","score":0.4830999970436096},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4781000018119812},{"id":"https://openalex.org/keywords/block-error-rate","display_name":"Block Error Rate","score":0.43869999051094055}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.781000018119812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6797000169754028},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6617000102996826},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5378999710083008},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.49309998750686646},{"id":"https://openalex.org/C118437007","wikidata":"https://www.wikidata.org/wiki/Q1017139","display_name":"Hybrid automatic repeat request","level":3,"score":0.4830999970436096},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4781000018119812},{"id":"https://openalex.org/C2776639698","wikidata":"https://www.wikidata.org/wiki/Q4927140","display_name":"Block Error Rate","level":3,"score":0.43869999051094055},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.428600013256073},{"id":"https://openalex.org/C56985126","wikidata":"https://www.wikidata.org/wiki/Q854039","display_name":"Rayleigh fading","level":4,"score":0.39559999108314514},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.3691999912261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3158000111579895},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.29910001158714294},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2946000099182129},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.28929999470710754},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2831000089645386},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.28029999136924744},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.27059999108314514},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc65386.2025.11154636","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1573665190","https://openalex.org/W2005692408","https://openalex.org/W2046967476","https://openalex.org/W2106045225","https://openalex.org/W2150498905","https://openalex.org/W2789254838","https://openalex.org/W2963204888","https://openalex.org/W3080329266","https://openalex.org/W3094383123","https://openalex.org/W4409357009"],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1,104],"that":[2,105],"optimized":[3,27],"message":[4],"update":[5],"scheduling":[6,28,51],"can":[7,93],"enhance":[8],"both":[9,87],"the":[10,14,53,106],"error-rate":[11,54],"performance":[12,55],"and":[13,32,75,89],"throughput":[15,37],"of":[16,20,46,56,70,80],"layered":[17],"BP":[18,30,44,100,126],"decoding":[19,31,45,121],"LDPC":[21,48,58,66],"codes.":[22,49],"As":[23],"an":[24],"exemplary":[25],"attempt,":[26],"accelerates":[29],"leads":[33],"to":[34,41,72,98,110],"approximately":[35],"2\u00d7":[36],"enhancement":[38],"when":[39,96],"compared":[40,97],"top-to-bottom":[42],"row-layered":[43,125],"5G":[47,65],"Furthermore,":[50],"enhances":[52],"short-length":[57,64],"codes":[59,114],"via":[60],"ensemble":[61],"decoding.":[62],"For":[63],"codes,":[67],"coding":[68],"gains":[69],"up":[71],"0.7":[73],"dB":[74,77],"1.6":[76],"at":[78],"BLER":[79],"10<sup":[81],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[82,84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u22123</sup>\u201310<sup":[83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u22124</sup>":[85],"for":[86],"AWGN":[88],"Rayleigh":[90],"fading":[91],"channels":[92],"be":[94],"achieved":[95],"conventional":[99],"decoders.":[101],"Additionally,":[102],"we":[103],"same":[107],"concept":[108],"applies":[109],"general":[111],"linear":[112],"block":[113],"(e.g.,":[115],"polar/RM":[116],"codes)":[117],"facilitating":[118],"a":[119],"unified":[120],"architecture":[122],"based":[123],"on":[124],"decoders":[127],"(\"one-silicon":[128],"fits":[129],"all\").":[130]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}