{"id":"https://openalex.org/W2013040482","doi":"https://doi.org/10.1109/pimrc.2013.6666154","title":"Informed dynamic schedules for LDPC decoding using belief propagation","display_name":"Informed dynamic schedules for LDPC decoding using belief propagation","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2013040482","doi":"https://doi.org/10.1109/pimrc.2013.6666154","mag":"2013040482"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2013.6666154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2013.6666154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","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/A5041597479","display_name":"Huang\u2013Chang Lee","orcid":"https://orcid.org/0000-0002-1165-9383"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Huang-Chang Lee","raw_affiliation_strings":["Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C","Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048130890","display_name":"Yeong-Luh Ueng","orcid":"https://orcid.org/0000-0002-3438-0385"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yeong-Luh Ueng","raw_affiliation_strings":["Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C","Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":0.8049,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67637846,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"321","last_page":"325"},"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.9959999918937683,"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.995199978351593,"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.889371395111084},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8260040283203125},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.735287070274353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6569710373878479},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5475881099700928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5212967395782471},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.496947318315506},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4784265160560608},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46932002902030945},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.44853833317756653},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4454440176486969},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4205603301525116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3157272934913635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2317546308040619},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13634327054023743}],"concepts":[{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.889371395111084},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8260040283203125},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.735287070274353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6569710373878479},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5475881099700928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5212967395782471},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.496947318315506},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4784265160560608},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46932002902030945},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.44853833317756653},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4454440176486969},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4205603301525116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3157272934913635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2317546308040619},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13634327054023743},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc.2013.6666154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2013.6666154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","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":18,"referenced_works":["https://openalex.org/W1573665190","https://openalex.org/W1982757705","https://openalex.org/W1998958105","https://openalex.org/W2101147641","https://openalex.org/W2101922692","https://openalex.org/W2105236249","https://openalex.org/W2115461214","https://openalex.org/W2115850784","https://openalex.org/W2128765501","https://openalex.org/W2134502194","https://openalex.org/W2138308684","https://openalex.org/W2142321576","https://openalex.org/W2154356273","https://openalex.org/W2165104588","https://openalex.org/W2167447976","https://openalex.org/W2949747623","https://openalex.org/W6675326518","https://openalex.org/W6677453412"],"related_works":["https://openalex.org/W2885795561","https://openalex.org/W4307680413","https://openalex.org/W2963817320","https://openalex.org/W2011305240","https://openalex.org/W2493667298","https://openalex.org/W2101147641","https://openalex.org/W3080746295","https://openalex.org/W2511191118","https://openalex.org/W2356695932","https://openalex.org/W2336199159"],"abstract_inverted_index":{"After":[0],"the":[1,4,27,54,65,71,77,88,91,102,119,131,149],"publication":[2],"of":[3,68,73,90,121,127],"residual":[5],"belief-propagation":[6],"(RBP)":[7],"algorithm,":[8],"many":[9],"low-density":[10],"parity-check":[11],"(LDPC)":[12],"decoders":[13],"using":[14],"informed":[15],"dynamic":[16],"scheduling":[17],"(IDS)":[18],"have":[19],"been":[20],"investigated.":[21],"In":[22,50],"this":[23],"paper,":[24],"we":[25],"propose":[26],"twofold-RBP":[28],"(T-RBP)":[29],"decoder":[30,57],"that":[31,126],"combines":[32],"two":[33],"residuals.":[34],"Using":[35],"T-RBP,":[36,53],"significant":[37,106],"improvement":[38,135],"can":[39,115,136],"be":[40],"achieved":[41],"in":[42,61,76,108],"both":[43],"convergence":[44,47,132],"speed":[45],"and":[46,113,143],"error-rate":[48],"performance.":[49,109],"addition":[51],"to":[52,63,94],"simplified-RBP":[55],"(S-RBP)":[56],"is":[58],"also":[59,125],"proposed":[60,111],"order":[62],"reduce":[64],"complexity.":[66],"Instead":[67],"comparing":[69],"all":[70,74],"residuals":[72,89],"edges":[75,92],"code":[78],"graph,":[79],"as":[80],"with":[81],"previous":[82],"IDS":[83],"decoders,":[84],"S-RBP":[85,114],"only":[86,118],"compares":[87],"connected":[93],"a":[95,145],"single":[96],"check":[97],"node,":[98],"thus":[99],"dramatically":[100],"reduces":[101],"complexity":[103],"without":[104],"any":[105],"degradation":[107],"The":[110,134],"T-RBP":[112],"improve":[116],"not":[117],"performance":[120],"dedicated":[122],"codes,":[123,129],"but":[124],"punctured":[128,138],"especially":[130],"speed.":[133],"make":[137],"LDPC":[139],"codes":[140],"more":[141],"practical":[142],"becoming":[144],"competitive":[146],"candidate":[147],"for":[148],"rate":[150],"compatible":[151],"applications.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}