{"id":"https://openalex.org/W2560585234","doi":"https://doi.org/10.1109/tcomm.2016.2637913","title":"Edge-Based Dynamic Scheduling for Belief-Propagation Decoding of LDPC and RS Codes","display_name":"Edge-Based Dynamic Scheduling for Belief-Propagation Decoding of LDPC and RS Codes","publication_year":2016,"publication_date":"2016-12-09","ids":{"openalex":"https://openalex.org/W2560585234","doi":"https://doi.org/10.1109/tcomm.2016.2637913","mag":"2560585234"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2016.2637913","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2016.2637913","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-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/A5040835240","display_name":"Chaudhry Adnan Aslam","orcid":"https://orcid.org/0000-0002-3063-3015"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Chaudhry Adnan Aslam","raw_affiliation_strings":["School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100763983","display_name":"Yong Liang Guan","orcid":"https://orcid.org/0000-0002-9757-630X"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yong Liang Guan","raw_affiliation_strings":["School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042415594","display_name":"Kui Cai","orcid":"https://orcid.org/0000-0003-2059-0071"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kui Cai","raw_affiliation_strings":["Science and Math Cluster, Singapore University of Technology and Design, Singapore"],"raw_orcid":"https://orcid.org/0000-0003-2059-0071","affiliations":[{"raw_affiliation_string":"Science and Math Cluster, Singapore University of Technology and Design, Singapore","institution_ids":["https://openalex.org/I152815399"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.683,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.9390059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"65","issue":"2","first_page":"525","last_page":"535"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9980999827384949,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.863509476184845},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7286968231201172},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.7227030396461487},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7035840749740601},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.620136022567749},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5747516751289368},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5177075862884521},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5103303790092468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34296104311943054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2612593173980713},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.18044108152389526},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12619158625602722}],"concepts":[{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.863509476184845},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7286968231201172},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.7227030396461487},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7035840749740601},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.620136022567749},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5747516751289368},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5177075862884521},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5103303790092468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34296104311943054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2612593173980713},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.18044108152389526},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12619158625602722},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2016.2637913","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2016.2637913","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W111201873","https://openalex.org/W1484692004","https://openalex.org/W1573665190","https://openalex.org/W1578113668","https://openalex.org/W1594652978","https://openalex.org/W1595118189","https://openalex.org/W1624259157","https://openalex.org/W1964402820","https://openalex.org/W1967281166","https://openalex.org/W1972042806","https://openalex.org/W1975761036","https://openalex.org/W1982757705","https://openalex.org/W2016582816","https://openalex.org/W2033303932","https://openalex.org/W2038267747","https://openalex.org/W2039719447","https://openalex.org/W2077814477","https://openalex.org/W2094383388","https://openalex.org/W2118148379","https://openalex.org/W2123530431","https://openalex.org/W2125332127","https://openalex.org/W2126419525","https://openalex.org/W2128765501","https://openalex.org/W2132538409","https://openalex.org/W2134502194","https://openalex.org/W2151296558","https://openalex.org/W2154458747","https://openalex.org/W2333373141","https://openalex.org/W2461009244","https://openalex.org/W4256264271","https://openalex.org/W4285719527","https://openalex.org/W6604580497","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W1968533815","https://openalex.org/W2808439818","https://openalex.org/W2885795561","https://openalex.org/W4315777848","https://openalex.org/W2521082822","https://openalex.org/W2030180258","https://openalex.org/W4303096056","https://openalex.org/W4282958949","https://openalex.org/W3080746295","https://openalex.org/W2101147641"],"abstract_inverted_index":{"This":[0,63],"paper":[1],"presents":[2],"two":[3],"low-complexity":[4],"edge-based":[5,124],"scheduling":[6],"schemes,":[7],"referred":[8],"to":[9,103],"as":[10,71],"the":[11,17,32,35,40,56,60,65,86,94,105,122,127,137,144],"e-Flooding":[12],"and":[13,24,45,112],"e-Shuffled":[14],"schedules,":[15,140],"for":[16],"belief-propagation":[18],"(BP)":[19],"decoding":[20,66,82,129],"of":[21,34,43,59,68,76,88,96],"low-density":[22],"parity-check":[23],"Reed-Solomon":[25],"codes.":[26],"The":[27],"proposed":[28,123],"schedules":[29,125],"selectively":[30],"update":[31,51],"edges":[33,58],"code":[36,61],"graph":[37,99],"based":[38],"on":[39],"run-time":[41],"reliability":[42],"variable":[44,111],"check":[46,113],"nodes.":[47,114],"Specifically,":[48],"new":[49],"message":[50,77,89,107],"is":[52,79,119],"propagated":[53],"exclusively":[54],"along":[55],"unreliable":[57],"graph.":[62],"reduces":[64],"complexity":[67,130],"BP":[69,106,128,139],"algorithm":[70],"only":[72],"a":[73],"partial":[74],"set":[75],"updates":[78,90],"computed":[80],"per":[81],"iteration.":[83],"Besides,":[84],"restricting":[85],"flow":[87],"may":[91],"also":[92],"precludes":[93],"occurrence":[95],"some":[97],"short":[98],"cycles,":[100],"which":[101],"helps":[102],"preserve":[104],"independence":[108],"at":[109,147],"certain":[110],"Using":[115],"numerical":[116],"simulations,":[117],"it":[118],"shown":[120],"that":[121],"reduce":[126],"by":[131],"more":[132],"than":[133],"90%":[134],"compared":[135],"with":[136],"prior-art":[138],"while":[141],"simultaneously":[142],"improving":[143],"error-rate":[145],"performance,":[146],"medium-to-high":[148],"signal-to-noise":[149],"ratio":[150],"over":[151],"additive":[152],"white":[153],"Gaussian":[154],"noise":[155],"channel.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}