{"id":"https://openalex.org/W2561204040","doi":"https://doi.org/10.1109/lcomm.2016.2643629","title":"Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes","display_name":"Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes","publication_year":2016,"publication_date":"2016-12-22","ids":{"openalex":"https://openalex.org/W2561204040","doi":"https://doi.org/10.1109/lcomm.2016.2643629","mag":"2561204040"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2016.2643629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2643629","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/A5009993882","display_name":"Xiaopeng Jiao","orcid":"https://orcid.org/0000-0002-1484-9844"},"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":"Xiaopeng Jiao","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University, Xi\u2019an, 710071","School of Computer Science and Technology, Xidian University, Xi'an, 710071"],"raw_orcid":"https://orcid.org/0000-0002-1484-9844","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi\u2019an, 710071","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi'an, 710071","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102793572","display_name":"Jianjun Mu","orcid":"https://orcid.org/0000-0002-8504-9705"},"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":"Jianjun Mu","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University, Xi\u2019an, 710071","School of Computer Science and Technology, Xidian University, Xi'an, 710071"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi\u2019an, 710071","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi'an, 710071","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","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":false,"raw_author_name":"Haoyuan Wei","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada"],"raw_orcid":null,"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":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9544,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.92202184,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"21","issue":"3","first_page":"472","last_page":"475"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9919000267982483,"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/computer-science","display_name":"Computer science","score":0.7122939229011536},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6941075325012207},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5866648554801941},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5334423184394836},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.5014035701751709},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.47683873772621155},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44390997290611267},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4146997630596161},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39208245277404785},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3903360366821289},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3827369809150696},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3212682604789734},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2602814733982086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22392866015434265},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18875572085380554}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7122939229011536},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6941075325012207},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5866648554801941},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5334423184394836},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.5014035701751709},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.47683873772621155},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44390997290611267},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4146997630596161},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39208245277404785},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3903360366821289},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3827369809150696},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3212682604789734},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2602814733982086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22392866015434265},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18875572085380554}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2016.2643629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2643629","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":[{"id":"https://openalex.org/G805714510","display_name":"\u9762\u5411\u95ea\u901f\u5b58\u50a8\u7cfb\u7edf\u7684\u7f16\u8bd1\u7801\u6280\u672f\u7814\u7a76","funder_award_id":"61271004","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8169344941","display_name":"\u57fa\u4e8e\u4ea4\u66ff\u65b9\u5411\u4e58\u5b50\u6cd5\u7684\u9ad8\u6548\u8bd1\u7801\u7406\u8bba\u4e0e\u7b97\u6cd5\u7814\u7a76","funder_award_id":"61471286","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W139795252","https://openalex.org/W1573665190","https://openalex.org/W1966336366","https://openalex.org/W1967281166","https://openalex.org/W1972042806","https://openalex.org/W1982757705","https://openalex.org/W1995786820","https://openalex.org/W2035810992","https://openalex.org/W2068582919","https://openalex.org/W2101922692","https://openalex.org/W2126419525","https://openalex.org/W2132538409","https://openalex.org/W2134502194","https://openalex.org/W2148673346","https://openalex.org/W2167447976","https://openalex.org/W2337808551","https://openalex.org/W2339398410","https://openalex.org/W3098702051"],"related_works":["https://openalex.org/W2623918504","https://openalex.org/W1650655882","https://openalex.org/W2957709805","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2916248738","https://openalex.org/W2011293233","https://openalex.org/W2167124952","https://openalex.org/W1968720239"],"abstract_inverted_index":{"Similar":[0],"to":[1,29],"the":[2,11,41,52,68,77,86,93,106],"belief":[3],"propagation":[4],"decoder,":[5],"linear":[6],"programming":[7],"decoding":[8,26],"based":[9],"on":[10],"alternating":[12],"direction":[13],"method":[14,66,88],"of":[15,44,79],"multipliers":[16],"(ADMM)":[17],"can":[18],"also":[19],"be":[20],"seen":[21],"as":[22],"an":[23,34],"iterative":[24,45],"message-passing":[25],"algorithm.":[27],"How":[28],"schedule":[30],"messages":[31],"efficiently":[32],"is":[33],"important":[35],"aspect":[36],"since":[37],"it":[38],"will":[39],"influence":[40],"convergence":[42],"rate":[43],"decoders.":[46],"In":[47,60],"this":[48],"letter,":[49],"we":[50,62],"investigate":[51],"node-wise":[53],"scheduling":[54,97],"for":[55,67],"ADMM":[56],"decoders,":[57],"named":[58],"NS-ADMM.":[59],"particular,":[61],"propose":[63],"a":[64,100],"reduced-complexity":[65],"NS-ADMM":[69,107],"decoder":[70],"by":[71],"avoiding":[72],"Euclidean":[73],"projections":[74],"involved":[75],"in":[76],"calculation":[78],"message":[80],"residuals.":[81],"Simulation":[82],"results":[83],"show":[84],"that":[85],"proposed":[87],"converges":[89],"much":[90],"faster":[91],"than":[92],"flooding":[94],"and":[95],"layered":[96],"while":[98],"keeping":[99],"lower":[101],"complexity":[102],"when":[103],"compared":[104],"with":[105],"decoder.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}