{"id":"https://openalex.org/W2765645554","doi":"https://doi.org/10.1109/lcomm.2017.2766223","title":"An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes","display_name":"An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes","publication_year":2017,"publication_date":"2017-10-25","ids":{"openalex":"https://openalex.org/W2765645554","doi":"https://doi.org/10.1109/lcomm.2017.2766223","mag":"2765645554"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2017.2766223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2766223","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-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/A5011754663","display_name":"Haoyuan Wei","orcid":"https://orcid.org/0000-0001-6195-2126"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Haoyuan Wei","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046274917","display_name":"Amir H. Banihashemi","orcid":"https://orcid.org/0000-0003-0685-5256"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amir H. Banihashemi","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011754663"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":4.9728,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.95896315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"22","issue":"1","first_page":"29","last_page":"32"},"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.9998000264167786,"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.9980999827384949,"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/algorithm","display_name":"Algorithm","score":0.6697064638137817},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.637500524520874},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5690646767616272},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5629558563232422},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.48253390192985535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4805651009082794},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.45546257495880127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4433862268924713},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4348946213722229},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.41399645805358887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18260863423347473},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11625394225120544}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6697064638137817},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.637500524520874},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5690646767616272},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5629558563232422},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.48253390192985535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4805651009082794},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.45546257495880127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4433862268924713},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4348946213722229},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.41399645805358887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18260863423347473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11625394225120544}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2017.2766223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2766223","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W139795252","https://openalex.org/W1644601915","https://openalex.org/W1995786820","https://openalex.org/W2035810992","https://openalex.org/W2068582919","https://openalex.org/W2148673346","https://openalex.org/W2164278908","https://openalex.org/W2169134868","https://openalex.org/W2288938106","https://openalex.org/W2339398410","https://openalex.org/W2404268825","https://openalex.org/W2561204040","https://openalex.org/W2581567427","https://openalex.org/W3098358453","https://openalex.org/W3098702051","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2507185596","https://openalex.org/W1493684871","https://openalex.org/W4286224459","https://openalex.org/W2047069332","https://openalex.org/W2886567582","https://openalex.org/W4289703404","https://openalex.org/W4387265813"],"abstract_inverted_index":{"Alternating":[0],"direction":[1],"method":[2],"of":[3,13,20,28,54,92],"multipliers":[4],"(ADMM)":[5],"is":[6,22],"a":[7,29,33,40,78],"popular":[8],"technique":[9],"for":[10,38,68],"linear-programming":[11],"decoding":[12],"low-density":[14],"parity-check":[15,34,72],"codes.":[16],"The":[17,74],"computational":[18],"complexity":[19,81,91],"ADMM":[21],"dominated":[23],"by":[24],"the":[25,50,55,71,84,89],"Euclidean":[26],"projection":[27,41,69],"real-valued":[30],"vector":[31],"onto":[32,70],"polytope.":[35,73],"Existing":[36],"algorithms":[37],"such":[39],"all":[42],"require":[43],"sorting":[44,66],"operations,":[45],"which":[46],"happen":[47],"to":[48],"be":[49],"most":[51],"complex":[52],"part":[53],"projection.":[56],"In":[57],"this":[58],"letter,":[59],"we":[60],"propose":[61],"an":[62],"iterative":[63],"algorithm,":[64],"without":[65],"operation,":[67],"proposed":[75],"algorithm":[76],"has":[77],"worst":[79],"case":[80],"linear":[82],"in":[83],"input":[85],"dimension":[86],"compared":[87],"with":[88],"super-linear":[90],"existing":[93],"algorithms.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}