{"id":"https://openalex.org/W3046052497","doi":"https://doi.org/10.1109/icc40277.2020.9149405","title":"Quadratic Programming Decoder for Binary LDPC Codes via ADMM Technique with Linear Complexity","display_name":"Quadratic Programming Decoder for Binary LDPC Codes via ADMM Technique with Linear Complexity","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3046052497","doi":"https://doi.org/10.1109/icc40277.2020.9149405","mag":"3046052497"},"language":"en","primary_location":{"id":"doi:10.1109/icc40277.2020.9149405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9149405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","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/A5100773963","display_name":"Jing Bai","orcid":null},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jing Bai","raw_affiliation_strings":["State Key Laboratory of Integrated Services Networks, Xidian University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Services Networks, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635294","display_name":"Yongchao Wang","orcid":"https://orcid.org/0000-0002-0640-4140"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongchao Wang","raw_affiliation_strings":["State Key Laboratory of Integrated Services Networks, Xidian University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Services Networks, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100773963"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":0.1542,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.51237034,"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":"6"},"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.9980000257492065,"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.9887999892234802,"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.8105800747871399},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8012759685516357},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6278680562973022},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6180015206336975},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49575433135032654},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4945978820323944},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4835676848888397},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.47877728939056396},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.47511205077171326},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4710310101509094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45344099402427673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4250292479991913},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3921163082122803},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30216583609580994},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.15708836913108826},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1183217465877533}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8105800747871399},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8012759685516357},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6278680562973022},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6180015206336975},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49575433135032654},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4945978820323944},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4835676848888397},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.47877728939056396},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.47511205077171326},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4710310101509094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45344099402427673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4250292479991913},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3921163082122803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30216583609580994},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15708836913108826},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1183217465877533},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc40277.2020.9149405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9149405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W139795252","https://openalex.org/W1644601915","https://openalex.org/W1970755778","https://openalex.org/W2068582919","https://openalex.org/W2078633872","https://openalex.org/W2097981865","https://openalex.org/W2148673346","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2295652899","https://openalex.org/W2765645554","https://openalex.org/W2962732914","https://openalex.org/W2964118256","https://openalex.org/W2964299189","https://openalex.org/W2998795235","https://openalex.org/W4256264271","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2154603729","https://openalex.org/W2127999627","https://openalex.org/W2010879611","https://openalex.org/W2115785601"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,47,97,120],"develop":[4],"an":[5],"efficient":[6],"quadratic":[7,56],"programming":[8,81],"(QP)":[9],"decoding":[10,52,73,83,124,164,171],"algorithm":[11,68,87,102,129],"via":[12],"the":[13,38,49,59,66,70,77,93,100,104,113,117,123,145,154,160,167],"alternating":[14],"direction":[15],"method":[16],"of":[17,69,107,116,126,137,163],"multipliers":[18],"(ADMM)":[19],"technique":[20,61],"for":[21],"binary":[22],"low":[23],"density":[24],"parity":[25,40],"check":[26,41,94],"(LDPC)":[27],"codes.":[28],"Its":[29],"main":[30],"content":[31],"is":[32,62,133],"as":[33],"follows:":[34],"first,":[35],"through":[36],"transforming":[37],"three-variables":[39],"equation":[42],"to":[43,54,64],"its":[44],"equivalent":[45],"expression,":[46],"relax":[48],"maximum":[50],"likelihood":[51],"problem":[53],"a":[55],"program.":[57],"Second,":[58],"ADMM":[60],"exploited":[63],"design":[65],"solving":[67],"resulting":[71],"QP":[72,118,147],"model.":[74],"Compared":[75],"with":[76],"existing":[78],"ADMM-based":[79,169],"mathematical":[80],"(MP)":[82],"algorithms,":[84],"our":[85,127],"proposed":[86,101,128,146],"eliminates":[88],"complex":[89],"Euclidean":[90],"projection":[91],"onto":[92],"polytope.":[95],"Third,":[96],"prove":[98],"that":[99,122,144],"satisfies":[103],"favorable":[105],"property":[106],"all-zeros":[108],"assumption.":[109],"Moreover,":[110],"by":[111],"exploiting":[112],"inside":[114],"structure":[115],"model,":[119],"show":[121],"complexity":[125],"in":[130,135],"each":[131],"iteration":[132],"linear":[134],"terms":[136],"LDPC":[138],"code":[139],"length.":[140],"Simulation":[141],"results":[142],"demonstrate":[143],"decoder":[148,157],"attains":[149],"better":[150],"error-correction":[151],"performance":[152],"than":[153],"sum-product":[155],"BP":[156],"and":[158],"costs":[159],"least":[161],"amount":[162],"time":[165],"amongst":[166],"state-of-the-art":[168],"MP":[170],"algorithms.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}