{"id":"https://openalex.org/W4360897542","doi":"https://doi.org/10.1109/tcomm.2023.3261380","title":"Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes","display_name":"Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes","publication_year":2023,"publication_date":"2023-03-24","ids":{"openalex":"https://openalex.org/W4360897542","doi":"https://doi.org/10.1109/tcomm.2023.3261380"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2023.3261380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2023.3261380","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"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 Transactions on Communications","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":null,"display_name":"Teng Lu","orcid":"https://orcid.org/0000-0002-9657-6420"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Teng Lu","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-9657-6420","affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062225577","display_name":"Xuan He","orcid":"https://orcid.org/0000-0002-8934-1981"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuan He","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-8934-1981","affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047350475","display_name":"Peng Kang","orcid":"https://orcid.org/0000-0002-0050-2751"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Peng Kang","raw_affiliation_strings":["Science, Mathematics and Technology (SMT) Cluster, Singapore University of Technology and Design, Tampines, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-0050-2751","affiliations":[{"raw_affiliation_string":"Science, Mathematics and Technology (SMT) Cluster, Singapore University of Technology and Design, Tampines, Singapore","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048187723","display_name":"Jiongyue Xing","orcid":"https://orcid.org/0000-0002-9238-7892"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiongyue Xing","raw_affiliation_strings":["Theory Laboratory, 2012 Laboratories, Central Research Institute, Huawei Technology Company Ltd., Hong Kong, SAR, China"],"raw_orcid":"https://orcid.org/0000-0002-9238-7892","affiliations":[{"raw_affiliation_string":"Theory Laboratory, 2012 Laboratories, Central Research Institute, Huawei Technology Company Ltd., Hong Kong, SAR, China","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029840191","display_name":"Xiaohu Tang","orcid":"https://orcid.org/0000-0002-7938-7812"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaohu Tang","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-7938-7812","affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5305,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63878505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"71","issue":"6","first_page":"3207","last_page":"3220"},"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.9983999729156494,"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.9958999752998352,"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/decoding-methods","display_name":"Decoding methods","score":0.6150282621383667},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5637208819389343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5048642754554749},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.47416606545448303},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4735262393951416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45763447880744934},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42856454849243164},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42822057008743286},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.42758506536483765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4197543263435364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4184038043022156},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4032209813594818},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11652031540870667}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6150282621383667},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5637208819389343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5048642754554749},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.47416606545448303},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4735262393951416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45763447880744934},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42856454849243164},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42822057008743286},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.42758506536483765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4197543263435364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4184038043022156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4032209813594818},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11652031540870667},{"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/tcomm.2023.3261380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2023.3261380","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"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 Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2433080754","display_name":null,"funder_award_id":"2022NSFSC0952","funder_id":"https://openalex.org/F4320329861","funder_display_name":"Natural Science Foundation of Sichuan Province"},{"id":"https://openalex.org/G7711165724","display_name":null,"funder_award_id":"2021YFF1200200","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G8754238840","display_name":null,"funder_award_id":"62101462","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"},{"id":"https://openalex.org/F4320329861","display_name":"Natural Science Foundation of Sichuan Province","ror":null},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1573665190","https://openalex.org/W1973712217","https://openalex.org/W2038174373","https://openalex.org/W2046091144","https://openalex.org/W2060051654","https://openalex.org/W2060144433","https://openalex.org/W2096084217","https://openalex.org/W2097988393","https://openalex.org/W2126419525","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2134700719","https://openalex.org/W2151785695","https://openalex.org/W2159781015","https://openalex.org/W2161310544","https://openalex.org/W2165527213","https://openalex.org/W2169732368","https://openalex.org/W2171555792","https://openalex.org/W2530443784","https://openalex.org/W2775852252","https://openalex.org/W2989561951","https://openalex.org/W3119991309","https://openalex.org/W3206712879","https://openalex.org/W4206971217","https://openalex.org/W6683643303","https://openalex.org/W6684382624"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2391237956","https://openalex.org/W2092857423","https://openalex.org/W2361792238","https://openalex.org/W2182725540","https://openalex.org/W3126598192","https://openalex.org/W2122913048","https://openalex.org/W2954849755","https://openalex.org/W2066141615","https://openalex.org/W2090897912"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,33,66,93,137,167],"consider":[4],"how":[5,111],"to":[6,12,44,88,100,112,132,175,185],"partition":[7,160,183],"the":[8,14,22,35,46,69,73,82,102,114,123,146,169,188,196,212],"parity-check":[9,29],"matrices":[10],"(PCMs)":[11],"reduce":[13,133],"hardware":[15],"complexity":[16,152],"and":[17,75,108,158,204],"increase":[18],"decoding":[19,25],"throughput":[20],"for":[21,72,145],"row":[23],"layered":[24],"of":[26,50,126,209],"quasi-cyclic":[27,170],"low-density":[28],"(QC-LDPC)":[30],"codes.":[31,216],"First,":[32],"formulate":[34],"PCM":[36],"partitioning":[37],"as":[38],"an":[39,142],"optimization":[40,147],"problem,":[41],"which":[42,129],"targets":[43],"minimize":[45],"maximum":[47,85],"column":[48,86],"weight":[49,87],"each":[51],"layer":[52,98,118,190],"while":[53],"maintaining":[54],"a":[55,64,77,90,95,181],"block":[56],"cyclic":[57],"shift":[58],"property":[59],"among":[60],"different":[61],"layers.":[62],"As":[63],"result,":[65],"derive":[67],"all":[68],"feasible":[70],"solutions":[71,115],"problem":[74,148],"propose":[76],"tight":[78],"lower":[79],"bound":[80],"\u03c9LBon":[81],"minimum":[83,124],"possible":[84],"evaluate":[89],"solution.":[91],"Second,":[92],"define":[94],"metric":[96],"called":[97],"distance":[99,119],"measure":[101],"data":[103],"dependency":[104],"between":[105],"consecutive":[106],"layers":[107],"further":[109],"illustrate":[110],"identify":[113],"with":[116,149],"desired":[117,189],"from":[120],"those":[121],"achieving":[122],"value":[125],"\u03c9LB=":[127],"1,":[128],"is":[130,153],"preferred":[131],"computation":[134],"delay.":[135],"Next,":[136],"demonstrate":[138],"that":[139,179,195],"up-to-now,":[140],"finding":[141],"optimal":[143],"solution":[144],"polynomial":[150],"time":[151],"unachievable.":[154],"Therefore,":[155],"both":[156],"enumerative":[157],"greedy":[159],"algorithms":[161],"are":[162],"proposed":[163],"instead.":[164],"After":[165],"that,":[166],"modify":[168],"progressive":[171],"edge-growth":[172],"(QC-PEG)":[173],"algorithm":[174],"directly":[176],"construct":[177],"PCMs":[178],"have":[180,199],"straightforward":[182],"scheme":[184],"achieve":[186,205],"\u03c9LBor":[187],"distance.":[191],"Simulation":[192],"results":[193],"showed":[194],"constructed":[197],"codes":[198],"better":[200],"error":[201],"correction":[202],"performance":[203],"less":[206],"average":[207],"number":[208],"iterations":[210],"than":[211],"underlying":[213],"5G":[214],"LDPC":[215]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}