{"id":"https://openalex.org/W2177712126","doi":"https://doi.org/10.1109/pimrc.2015.7343339","title":"Modified forced convergence decoding of LDPC codes with optimized decoder parameters","display_name":"Modified forced convergence decoding of LDPC codes with optimized decoder parameters","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W2177712126","doi":"https://doi.org/10.1109/pimrc.2015.7343339","mag":"2177712126"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2015.7343339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2015.7343339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lup.lub.lu.se/record/8146368","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022858053","display_name":"Muris Sarajli\u0107","orcid":"https://orcid.org/0000-0001-5107-8164"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Muris Sarajlic","raw_affiliation_strings":["Department of Electrical and Information Technology, Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Technology, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100322345","display_name":"Liang Liu","orcid":"https://orcid.org/0000-0001-9491-8821"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Liang Liu","raw_affiliation_strings":["Department of Electrical and Information Technology, Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Technology, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045195961","display_name":"Ove Edfors","orcid":"https://orcid.org/0000-0001-5966-8468"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ove Edfors","raw_affiliation_strings":["Department of Electrical and Information Technology, Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Technology, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7013,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75970972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"445"},"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.9994999766349792,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.98580002784729,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7714626789093018},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7283967733383179},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7164536714553833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6935702562332153},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6540514826774597},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6495382189750671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5818927884101868},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5129949450492859},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4306287467479706},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4267022907733917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37100112438201904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3515762686729431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2344544231891632},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.06016591191291809}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7714626789093018},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7283967733383179},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7164536714553833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6935702562332153},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6540514826774597},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6495382189750671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5818927884101868},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5129949450492859},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4306287467479706},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4267022907733917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37100112438201904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3515762686729431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2344544231891632},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.06016591191291809},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pimrc.2015.7343339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2015.7343339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:1265d495-0c70-4a03-bf41-26682c2f7f65","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/8146368","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:1265d495-0c70-4a03-bf41-26682c2f7f65","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/8146368","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W111201873","https://openalex.org/W1518608438","https://openalex.org/W1573665190","https://openalex.org/W1593002741","https://openalex.org/W1983902738","https://openalex.org/W2009797711","https://openalex.org/W2101131904","https://openalex.org/W2124289529","https://openalex.org/W2127370988","https://openalex.org/W2128452997","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2161310544","https://openalex.org/W4230881547","https://openalex.org/W4300188436","https://openalex.org/W6604580497","https://openalex.org/W6635470055"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W2479327835","https://openalex.org/W4205295586","https://openalex.org/W2110972223","https://openalex.org/W2163036861","https://openalex.org/W2090054304","https://openalex.org/W98604564"],"abstract_inverted_index":{"Reducing":[0],"the":[1,28,43,51,56,95],"complexity":[2,26,54,100],"of":[3,24,55,102,108],"decoding":[4],"algorithms":[5],"for":[6,13,59,82],"LDPC":[7,92],"codes":[8,93],"is":[9],"an":[10],"important":[11],"prerequisite":[12],"their":[14],"practical":[15],"implementation.":[16],"In":[17],"this":[18,36,84],"work":[19],"we":[20],"propose":[21],"a":[22,68,75,105],"reduction":[23,101,107],"computational":[25],"targeting":[27],"highly":[29],"reliable":[30],"codeword":[31],"bits":[32],"and":[33,72,104],"show":[34,49],"that":[35],"approach":[37],"can":[38,63],"be":[39,64],"seamlessly":[40],"merged":[41],"with":[42],"forced":[44],"convergence":[45],"scheme.":[46],"We":[47],"also":[48],"how":[50],"minimum":[52],"achievable":[53],"resulting":[57],"scheme":[58],"given":[60],"performance":[61],"constraints":[62],"found":[65],"by":[66],"solving":[67,83],"constrained":[69],"optimization":[70],"problem,":[71],"successfully":[73],"apply":[74],"gradient-descent":[76],"based":[77],"stochastic":[78],"approximation":[79],"(SA)":[80],"method":[81],"problem.":[85],"The":[86],"proposed":[87],"methods":[88],"are":[89],"tested":[90],"on":[91],"from":[94],"IEEE":[96],"802.11n":[97],"standard.":[98],"Computational":[99],"55%":[103],"75%":[106],"memory":[109],"access":[110],"have":[111],"been":[112],"observed.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}