{"id":"https://openalex.org/W2120667535","doi":"https://doi.org/10.1109/icc.2005.1494430","title":"Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution","display_name":"Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution","publication_year":2005,"publication_date":"2005-08-16","ids":{"openalex":"https://openalex.org/W2120667535","doi":"https://doi.org/10.1109/icc.2005.1494430","mag":"2120667535"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2005.1494430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2005.1494430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","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/A5060531157","display_name":"G. Richter","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"G. Richter","raw_affiliation_strings":["Department of TAIT, University of Ulm (EBS), Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Department of TAIT, University of Ulm (EBS), Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031644344","display_name":"G. Schmidt","orcid":"https://orcid.org/0000-0001-6852-7560"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G. Schmidt","raw_affiliation_strings":["Department of TAIT, University of Ulm (EBS), Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Department of TAIT, University of Ulm (EBS), Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045353828","display_name":"Martin Bossert","orcid":"https://orcid.org/0000-0002-3827-9065"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Bossert","raw_affiliation_strings":["Department of TAIT, University of Ulm (EBS), Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Department of TAIT, University of Ulm (EBS), Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111916654","display_name":"Elena Costa","orcid":null},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"E. Costa","raw_affiliation_strings":["Com MN PG NT RI4, Siemens AG, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Com MN PG NT RI4, Siemens AG, Munich, Germany","institution_ids":["https://openalex.org/I1325886976"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060531157"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":2.5955,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.91162001,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"1","issue":null,"first_page":"642","last_page":"646"},"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.9840999841690063,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8994131088256836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7513998746871948},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7060356736183167},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6357413530349731},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5534282326698303},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5470371246337891},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5363467931747437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5338374972343445},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4748133420944214},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4690077006816864},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45393407344818115},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4442586600780487},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.43788477778434753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38800710439682007},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2185792624950409}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8994131088256836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7513998746871948},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7060356736183167},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6357413530349731},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5534282326698303},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5470371246337891},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5363467931747437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5338374972343445},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4748133420944214},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4690077006816864},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45393407344818115},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4442586600780487},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.43788477778434753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38800710439682007},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2185792624950409},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2005.1494430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2005.1494430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1480577960","https://openalex.org/W1964402820","https://openalex.org/W2059718281","https://openalex.org/W2115104320","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2137699000","https://openalex.org/W2146694142","https://openalex.org/W2150624120","https://openalex.org/W2156938362","https://openalex.org/W4256648168","https://openalex.org/W4300188436","https://openalex.org/W6641560873","https://openalex.org/W7039217950"],"related_works":["https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2135229457","https://openalex.org/W2118148379","https://openalex.org/W2944806087","https://openalex.org/W2355675923","https://openalex.org/W2109519980","https://openalex.org/W1983324765","https://openalex.org/W1978153242","https://openalex.org/W4290466155"],"abstract_inverted_index":{"In":[0],"this":[1,65],"paper,":[2],"an":[3,35],"algorithm":[4],"for":[5,25,79],"low-density":[6],"parity-check":[7],"(LDPC)":[8],"codes":[9],"with":[10],"reduced":[11],"complexity":[12,16],"is":[13,18,56],"presented.":[14],"The":[15,40],"reduction":[17],"achieved":[19],"by":[20,48,63],"calculating":[21],"a":[22],"linear":[23,44],"function":[24,45],"updating":[26],"the":[27,43,61,69,73],"check":[28],"nodes":[29],"in":[30,60],"each":[31],"iteration,":[32],"instead":[33],"of":[34,42,72],"exponential":[36],"and":[37],"logarithmic":[38],"function.":[39],"parameters":[41],"are":[46],"optimized":[47],"density":[49],"evolution.":[50],"Simulation":[51],"results":[52],"show":[53],"that":[54],"there":[55],"nearly":[57],"no":[58],"loss":[59],"performance":[62],"using":[64],"approximation":[66],"compared":[67],"to":[68],"exact":[70],"calculation":[71],"belief":[74],"propagation":[75],"decoding":[76],"algorithm,":[77],"even":[78],"very":[80],"large":[81],"block":[82],"lengths.":[83]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}