{"id":"https://openalex.org/W7128710081","doi":"https://doi.org/10.3390/e28020215","title":"RL-Based Parallel LDPC Decoding with Clustered Scheduling","display_name":"RL-Based Parallel LDPC Decoding with Clustered Scheduling","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7128710081","doi":"https://doi.org/10.3390/e28020215","pmid":"https://pubmed.ncbi.nlm.nih.gov/41751717"},"language":"en","primary_location":{"id":"doi:10.3390/e28020215","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e28020215","pdf_url":"https://www.mdpi.com/1099-4300/28/2/215/pdf?version=1770900763","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1099-4300/28/2/215/pdf?version=1770900763","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119373361","display_name":"Yusuf Ozkan","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yusuf Ozkan","raw_affiliation_strings":["Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA"],"raw_orcid":"https://orcid.org/0000-0001-9529-9866","affiliations":[{"raw_affiliation_string":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065207459","display_name":"Yauhen Yakimenka","orcid":"https://orcid.org/0000-0003-3030-2336"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yauhen Yakimenka","raw_affiliation_strings":["Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA"],"raw_orcid":"https://orcid.org/0000-0003-3030-2336","affiliations":[{"raw_affiliation_string":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020253937","display_name":"J\u00f6rg Kliewer","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Kliewer","raw_affiliation_strings":["Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA"],"raw_orcid":"https://orcid.org/0000-0003-0942-8006","affiliations":[{"raw_affiliation_string":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065207459"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2165},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2165},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15999536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"2","first_page":"215","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9768999814987183,"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.9768999814987183,"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/T13905","display_name":"Telecommunications and Broadcasting Technologies","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.002300000051036477,"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.7893999814987183},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6650000214576721},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6085000038146973},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5961999893188477},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5859000086784363},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.54830002784729},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5238999724388123},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41260001063346863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8030999898910522},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7893999814987183},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6650000214576721},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5961999893188477},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5859000086784363},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.54830002784729},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5238999724388123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49720001220703125},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3822999894618988},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35670000314712524},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.33550000190734863},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.2994000017642975},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26750001311302185},{"id":"https://openalex.org/C46637626","wikidata":"https://www.wikidata.org/wiki/Q6693015","display_name":"Low latency (capital markets)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/e28020215","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e28020215","pdf_url":"https://www.mdpi.com/1099-4300/28/2/215/pdf?version=1770900763","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},{"id":"pmid:41751717","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41751717","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy (Basel, Switzerland)","raw_type":null},{"id":"pmh:oai:doaj.org/article:9c87995c5d4441ce8439dcc7cef0cd28","is_oa":false,"landing_page_url":"https://doaj.org/article/9c87995c5d4441ce8439dcc7cef0cd28","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy, Vol 28, Iss 2, p 215 (2026)","raw_type":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:12939921","is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12939921/","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy (Basel)","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/e28020215","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e28020215","pdf_url":"https://www.mdpi.com/1099-4300/28/2/215/pdf?version=1770900763","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5166465640068054,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7128710081.pdf","grobid_xml":"https://content.openalex.org/works/W7128710081.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1973712217","https://openalex.org/W2096084217","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2134502194","https://openalex.org/W2138308684","https://openalex.org/W2164179402","https://openalex.org/W2292279193","https://openalex.org/W2547258704","https://openalex.org/W2564319974","https://openalex.org/W2789254838","https://openalex.org/W2963513394","https://openalex.org/W3124479229","https://openalex.org/W3153468095","https://openalex.org/W4214717370","https://openalex.org/W4296917810","https://openalex.org/W4384787527","https://openalex.org/W4387448614","https://openalex.org/W4402214937"],"related_works":[],"abstract_inverted_index":{"We":[0,117],"propose":[1,119],"a":[2,46],"reinforcement":[3],"learning":[4],"(RL)-based":[5],"decoding":[6,11,28,130,169,181],"framework":[7],"for":[8,143],"high-throughput":[9],"parallel":[10,164],"of":[12,41,81,98,100,114,163],"low-density":[13],"parity-check":[14],"(LDPC)":[15],"codes":[16,146],"using":[17],"clustered":[18],"scheduling.":[19],"Parallel":[20],"LDPC":[21,145,165],"decoders":[22],"must":[23],"balance":[24],"error-correction":[25],"performance":[26],"and":[27,67,131,171],"latency":[29,170],"while":[30,174],"avoiding":[31],"memory":[32],"conflicts.":[33],"To":[34,75],"address":[35],"this":[36],"trade-off,":[37],"we":[38,86],"construct":[39],"clusters":[40,66],"check":[42,102,115],"nodes":[43],"that":[44,124,155],"satisfy":[45],"two-edge":[47,126],"independence":[48,127],"property,":[49],"which":[50,91],"enables":[51],"conflict-free":[52],"row-parallel":[53],"belief":[54],"propagation.":[55],"An":[56],"RL":[57],"agent":[58],"is":[59,138],"trained":[60],"offline":[61],"to":[62,65,68,109,179],"assign":[63],"Q-values":[64,94,99],"prioritize":[69],"their":[70],"update":[71],"order":[72],"during":[73,129],"decoding.":[74],"overcome":[76],"the":[77,88,96,112,156,160],"exponential":[78,108],"storage":[79,105],"requirements":[80],"existing":[82],"RL-based":[83],"scheduling":[84],"methods,":[85],"introduce":[87],"Q-Sum":[89],"method,":[90],"approximates":[92],"cluster-level":[93],"as":[95],"sum":[97],"individual":[101],"nodes,":[103],"reducing":[104],"complexity":[106],"from":[107],"linear":[110],"in":[111],"number":[113],"nodes.":[116],"further":[118],"an":[120],"On-the-Fly":[121],"clustering":[122,137],"strategy":[123],"enforces":[125],"dynamically":[128],"provides":[132],"additional":[133],"flexibility":[134],"when":[135],"static":[136],"not":[139],"feasible.":[140],"Simulation":[141],"results":[142],"array-based":[144],"over":[147],"additive":[148],"white":[149],"Gaussian":[150],"noise":[151],"(AWGN)":[152],"channels":[153],"show":[154],"proposed":[157],"methods":[158],"improve":[159],"latency-versus-performance":[161],"trade-off":[162],"decoders,":[166],"achieving":[167],"lower":[168],"higher":[172],"throughput":[173],"maintaining":[175],"error":[176],"rates":[177],"comparable":[178],"state-of-the-art":[180],"methods.":[182]},"counts_by_year":[],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2026-02-13T00:00:00"}