{"id":"https://openalex.org/W2167227183","doi":"https://doi.org/10.1109/wts.2009.5068982","title":"Fast Parallel Weighted Bit Flipping decoding algorithm for LDPC codes","display_name":"Fast Parallel Weighted Bit Flipping decoding algorithm for LDPC codes","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2167227183","doi":"https://doi.org/10.1109/wts.2009.5068982","mag":"2167227183"},"language":"en","primary_location":{"id":"doi:10.1109/wts.2009.5068982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wts.2009.5068982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Wireless Telecommunications Symposium","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/A5031819829","display_name":"M. Vanek","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Vanek","raw_affiliation_strings":["Alcatel-Lucent, Bratislava, Slovakia"],"affiliations":[{"raw_affiliation_string":"Alcatel-Lucent, Bratislava, Slovakia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083217679","display_name":"Peter Farka\u0161","orcid":"https://orcid.org/0000-0003-2840-2442"},"institutions":[{"id":"https://openalex.org/I110757952","display_name":"Slovak University of Technology in Bratislava","ror":"https://ror.org/0561ghm58","country_code":"SK","type":"education","lineage":["https://openalex.org/I110757952"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"P. Farkas","raw_affiliation_strings":["Department of Telecommunications, Slovak University of Technology, Bratislava, Slovakia"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, Slovak University of Technology, Bratislava, Slovakia","institution_ids":["https://openalex.org/I110757952"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031819829"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66790555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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.9983999729156494,"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/T12029","display_name":"DNA and Biological Computing","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8632384538650513},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7235532999038696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.71922767162323},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6629886627197266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6618310809135437},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.6253221035003662},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5080313682556152},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.4828534722328186},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4813478887081146},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4780331552028656},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4134214222431183},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2048705518245697}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8632384538650513},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7235532999038696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.71922767162323},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6629886627197266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6618310809135437},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6253221035003662},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5080313682556152},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4828534722328186},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4813478887081146},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4780331552028656},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4134214222431183},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2048705518245697},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wts.2009.5068982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wts.2009.5068982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Wireless Telecommunications Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312330","display_name":"Slovensk\u00e1 Akad\u00e9mia Vied","ror":"https://ror.org/03h7qq074"},{"id":"https://openalex.org/F4320323641","display_name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","ror":"https://ror.org/044gwpv05"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W841358376","https://openalex.org/W1487545245","https://openalex.org/W2082815788","https://openalex.org/W2111991402","https://openalex.org/W2114869758","https://openalex.org/W2128765501","https://openalex.org/W2129005429","https://openalex.org/W2129031807","https://openalex.org/W2151852374","https://openalex.org/W2161084929","https://openalex.org/W2165439096","https://openalex.org/W6628932656"],"related_works":["https://openalex.org/W2361015587","https://openalex.org/W90969106","https://openalex.org/W2508865029","https://openalex.org/W2358182703","https://openalex.org/W2113526583","https://openalex.org/W2382690959","https://openalex.org/W3012554690","https://openalex.org/W2121408388","https://openalex.org/W2006115347","https://openalex.org/W2171839442"],"abstract_inverted_index":{"In":[0],"this":[1,122],"paper":[2],"a":[3],"fast":[4],"version":[5],"of":[6,26,44,51,121,130],"the":[7,23,27,33,45,49,76,81,100,126,131,134,141,147],"parallel":[8],"weighted":[9],"bit":[10],"flipping":[11],"LDPC":[12,52,83],"decoding":[13,101,132],"algorithm":[14,60],"(PWBF)":[15],"is":[16,30,112,137],"presented.":[17],"The":[18,58],"idea,":[19],"which":[20,72,108],"allowed":[21],"decreasing":[22],"computational":[24],"complexity":[25],"PWBF":[28],"method,":[29],"based":[31,63],"on":[32,38,64,140],"observation":[34],"that":[35,110,125],"in":[36,48,69,85,99,144],"dependency":[37],"signal":[39],"to":[40,80,87],"noise":[41],"ratio,":[42],"many":[43],"received":[46],"bits":[47,95],"codeword":[50],"code":[53,84],"could":[54],"be":[55],"without":[56],"error.":[57],"augmented":[59],"makes":[61],"tests":[62],"syndromes":[65],"and":[66,124],"symbol":[67],"involvement":[68],"parity":[70],"checks,":[71],"are":[73,106],"given":[74],"by":[75,119],"factor":[77],"graph":[78],"corresponding":[79],"chosen":[82],"order":[86],"define":[88],"so":[89],"called":[90],"guaranteed":[91,94],"bits.":[92],"These":[93],"do":[96],"not":[97,113],"participate":[98],"calculations":[102],"further.":[103],"Simulation":[104],"results":[105],"presented,":[107],"show":[109],"there":[111],"visible":[114],"any":[115],"significant":[116],"performance":[117],"deterioration":[118],"application":[120],"method":[123],"approximate":[127],"speed":[128],"up":[129],"for":[133],"tested":[135],"codes":[136],"about":[138],"25%":[139],"selected":[142],"hardware":[143],"comparison":[145],"with":[146],"known":[148],"PWBF.":[149]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}