{"id":"https://openalex.org/W2021390232","doi":"https://doi.org/10.1109/vetecf.2011.6092834","title":"A Generalization of Residual Belief Propagation for Flexible Reduced Complexity LDPC Decoding","display_name":"A Generalization of Residual Belief Propagation for Flexible Reduced Complexity LDPC Decoding","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2021390232","doi":"https://doi.org/10.1109/vetecf.2011.6092834","mag":"2021390232"},"language":"en","primary_location":{"id":"doi:10.1109/vetecf.2011.6092834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vetecf.2011.6092834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Vehicular Technology Conference (VTC Fall)","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/A5029768883","display_name":"Moritz Beermann","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Moritz Beermann","raw_affiliation_strings":["Institute of Communication Systems and Data Processing, RWTH Aachen University, Germany","Inst. of Comm. Syst. & Data Process., RWTH Aachen Univ., Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Communication Systems and Data Processing, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Inst. of Comm. Syst. & Data Process., RWTH Aachen Univ., Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015405966","display_name":"Peter Vary","orcid":"https://orcid.org/0000-0002-5213-1825"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Vary","raw_affiliation_strings":["Institute of Communication Systems and Data Processing, RWTH Aachen University, Germany","Inst. of Comm. Syst. & Data Process., RWTH Aachen Univ., Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Communication Systems and Data Processing, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Inst. of Comm. Syst. & Data Process., RWTH Aachen Univ., Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029768883"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.3644,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.63273102,"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":"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":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.9991999864578247,"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.9965000152587891,"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/decoding-methods","display_name":"Decoding methods","score":0.8932480812072754},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7669837474822998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7511736154556274},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.7418742179870605},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6020858287811279},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5921710729598999},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5833860039710999},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.5815454125404358},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5784816741943359},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.540604829788208},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5327646136283875},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5128986835479736},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4131714403629303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28155797719955444},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.23939692974090576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17192435264587402},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.08407962322235107}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8932480812072754},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7669837474822998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7511736154556274},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.7418742179870605},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6020858287811279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5921710729598999},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5833860039710999},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.5815454125404358},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5784816741943359},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.540604829788208},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5327646136283875},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5128986835479736},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4131714403629303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28155797719955444},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.23939692974090576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17192435264587402},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.08407962322235107},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/vetecf.2011.6092834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vetecf.2011.6092834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.rwth-aachen.de:128276","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/128276","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2011 IEEE Vehicular Technology Conference (VTC Fall 2011) : San Francisco, California, USA, 5 - 8 September 2011 ; [co-located with the Fourth IEEE International Symposium on Wireless Vehicular Communications (IEEE WiVeC 2011)] / [IEEE Vehicular Technology Society]. - Vol.: 1-3<br/>2011 IEEE Vehicular Technology Conference, VTC Fall 2011, San Francisco, CA, USA, 2011-09-05 - 2011-09-08<br/>4. IEEE International Symposium on Wireless Vehicular Communications, IEEE WiVeC 2011,","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1518608438","https://openalex.org/W1525888637","https://openalex.org/W1858795531","https://openalex.org/W2046091144","https://openalex.org/W2101147641","https://openalex.org/W2123530431","https://openalex.org/W2128765501","https://openalex.org/W2134502194","https://openalex.org/W2135764410","https://openalex.org/W2137028337","https://openalex.org/W2138308684","https://openalex.org/W2159080219","https://openalex.org/W2949747623","https://openalex.org/W4285719527","https://openalex.org/W6628810906","https://openalex.org/W6631424144","https://openalex.org/W6675326518"],"related_works":["https://openalex.org/W2011305240","https://openalex.org/W2885795561","https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2594313860","https://openalex.org/W2118148379","https://openalex.org/W1978153242","https://openalex.org/W4290466155","https://openalex.org/W2167340446","https://openalex.org/W2159021452"],"abstract_inverted_index":{"Beside":[0],"the":[1,35,59,66,105,108,131,136,148],"well":[2],"known":[3,157],"iterative":[4],"Belief":[5],"Propagation":[6],"algorithm":[7],"several":[8],"alternative":[9],"decoding":[10,49,60,85,115,122],"schemes":[11],"for":[12,104,126],"Low-Density":[13],"Parity-Check":[14],"(LDPC)":[15],"codes":[16],"providing":[17,47],"better":[18],"performance":[19,154],"in":[20,34,45,113,143],"terms":[21],"of":[22,97,107,130,155],"residual":[23],"error":[24,152],"rate,":[25],"convergence":[26,68,149],"speed":[27,150],"or":[28],"computational":[29,99],"complexity":[30,100,138],"have":[31],"been":[32,43],"developed":[33],"last":[36],"years.":[37],"Recently,":[38],"Informed":[39],"Dynamic":[40],"Scheduling":[41],"has":[42],"proposed":[44],"[1]":[46],"different":[48],"strategies":[50,123],"that":[51,65,101,124],"dynamically":[52],"decide":[53],"which":[54],"messages":[55,109],"are":[56,90],"passed":[57],"throughout":[58],"process.":[61],"It":[62],"was":[63],"shown":[64],"overall":[67],"can":[69,78],"be":[70,79,111],"sped":[71],"up":[72],"considerably":[73],"and":[74,134,142,151],"also":[75],"more":[76],"errors":[77],"corrected":[80],"compared":[81],"to":[82,110],"other":[83],"(non-dynamic)":[84],"strategies.":[86],"However,":[87],"these":[88],"improvements":[89],"somehow":[91],"overshadowed":[92],"by":[93],"a":[94,127],"significant":[95],"amount":[96],"additional":[98,137],"is":[102],"needed":[103],"selection":[106],"updated":[112],"each":[114],"step.":[116],"We":[117],"propose":[118],"two":[119],"novel":[120],"dynamic":[121,158],"allow":[125],"flexible":[128],"adaptation":[129],"decoder's":[132],"dynamics":[133],"reduce":[135],"remarkably":[139],"while":[140],"maintaining,":[141],"some":[144],"cases":[145],"even":[146],"exceeding,":[147],"rate":[153],"currently":[156],"schedules.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}