{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:50:45Z","timestamp":1753887045638,"version":"3.41.2"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"vor","delay-in-days":121,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771364","61701368"],"award-info":[{"award-number":["61771364","61701368"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1504601"],"award-info":[{"award-number":["U1504601"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003172","name":"Henan University of Science and Technology","doi-asserted-by":"publisher","award":["2014QN030"],"award-info":[{"award-number":["2014QN030"]}],"id":[{"id":"10.13039\/501100003172","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>This paper presents a family of rate\u2010compatible (RC) globally coupled low\u2010density parity\u2010check (GC\u2010LDPC) codes, which is constructed by combining algebraic construction method and graph extension. Specifically, the highest rate code is constructed using the algebraic method and the codes of lower rates are formed by successively extending the graph of the higher rate codes. The proposed rate\u2010compatible codes provide more flexibility in code rate and guarantee the structural property of algebraic construction. It is confirmed, by numerical simulations over the AWGN channel, that the proposed codes have better performances than their counterpart GC\u2010LDPC codes formed by the classical method and exhibit an approximately uniform gap to the capacity over a wide range of rates. Furthermore, a <jats:italic>modified two-phase local\/global iterative decoding scheme<\/jats:italic> for GC\u2010LDPC codes is proposed. Numerical results show that the proposed decoding scheme can reduce the unnecessary cost of local decoder at low and moderate SNRs, without any increase in the number of decoding iterations in the global decoder at high SNRs.<\/jats:p>","DOI":"10.1155\/2018\/4397671","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T23:31:39Z","timestamp":1525303899000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Construction and Decoding of Rate\u2010Compatible Globally Coupled LDPC Codes"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7642-7607","authenticated-orcid":false,"given":"Ji","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-5493","authenticated-orcid":false,"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7055-8670","authenticated-orcid":false,"given":"Xijin","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9403-4460","authenticated-orcid":false,"given":"Hengzhou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3779-4505","authenticated-orcid":false,"given":"Huaan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"crossref","unstructured":"LiJ. LinS. Abdel-GhaffarK. RyanW. E. andCostelloD. J. Globally coupled LDPC codes Proceedings of the 2016 Information Theory and Applications Workshop ITA 2016 February 2016 La Jolla CA USA https:\/\/doi.org\/10.1109\/ITA.2016.7888167 2-s2.0-85018243084.","DOI":"10.1109\/ITA.2016.7888167"},{"volume-title":"LDPC Code Designs, Constructions, and Unification","year":"2017","author":"Li J.","key":"e_1_2_9_2_2"},{"key":"e_1_2_9_3_2","doi-asserted-by":"crossref","unstructured":"LiJ. LiuK. LinS. andAbdel-GhaffarK. Reed-Solomon based globally coupled quasi-cyclic LDPC codes Proceedings of the 2017 Information Theory and Applications Workshop ITA 2017 February 2017 San Diego CA USA https:\/\/doi.org\/10.1109\/ITA.2017.8023442 2-s2.0-85030973169.","DOI":"10.1109\/ITA.2017.8023442"},{"key":"e_1_2_9_4_2","doi-asserted-by":"crossref","unstructured":"LiJ. LiuK. LinS. andAbdel-GhaffarK. Reed-solomon based nonbinary globally coupled LDPC codes: Correction of random errors and bursts of erasures Proceedings of the 2017 IEEE International Symposium on Information Theory ISIT 2017 June 2017 Aachen Germany 381\u2013385 https:\/\/doi.org\/10.1109\/ISIT.2017.8006554 2-s2.0-85034087388.","DOI":"10.1109\/ISIT.2017.8006554"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6852099"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504273"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613107"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.2763"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836667"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.898834"},{"key":"e_1_2_9_17_2","doi-asserted-by":"crossref","unstructured":"JacobsenN.andSoniR. Design of rate-compatible irregular LDPC codes based on edge growth and parity splitting Proceedings of the 2007 IEEE 66th Vehicular Technology Conference VTC 2007-Fall October 2007 USA 1052\u20131056 2-s2.0-47649129449 https:\/\/doi.org\/10.1109\/VETECF.2007.228.","DOI":"10.1109\/VETECF.2007.228"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928274"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.081012.110010"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2558152"},{"key":"e_1_2_9_21_2","unstructured":"Document 3GPP R1-1613710 3GPP TSG RAN WG1 Meeting 87 3GPP Nov. 2016 http:\/\/www.3gpp.org\/ftp\/tsg_ran\/WG1_RL1\/TSGR1_87\/Docs\/R1-1613710.zip."},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188990"},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"HouW. LuS. andChengJ. Rate-compatible spatially coupled LDPC codes via repeat-accumulation extension Proceedings of the 2014 8th International Symposium on Turbo Codes and Iterative Information Processing ISTC 2014 August 2014 Bremen Germany 87\u201391 https:\/\/doi.org\/10.1109\/ISTC.2014.6955091 2-s2.0-84911926639.","DOI":"10.1109\/ISTC.2014.6955091"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.101813.120864"},{"key":"e_1_2_9_25_2","doi-asserted-by":"crossref","unstructured":"NitzoldW. FettweisG. P. andLentmaierM. Rate-compatible spatially-coupled LDPC code ensembles with nearly-regular degree distributions Proceedings of the IEEE International Symposium on Information Theory ISIT 2015 June 2015 Hong Kong 41\u201345 2-s2.0-84969771749 https:\/\/doi.org\/10.1109\/ISIT.2015.7282413.","DOI":"10.1109\/ISIT.2015.7282413"},{"volume-title":"Error Control Coding: Fundamentals and Applications","year":"2004","author":"Lin S.","key":"e_1_2_9_26_2"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"e_1_2_9_28_2","unstructured":"Document 3GPP R1-1711982 3GPP TSG RAN WG1 Meeting AH NR2 3GPP June 2017 http:\/\/www.3gpp.org\/ftp\/tsg_ran\/WG1_RL1\/TSGR1_AH\/NR_AH_1706\/Docs\/R1-1711982.zip."},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2608938"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.768759"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.042712.110189"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/4397671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/4397671.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/4397671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:22:06Z","timestamp":1723015326000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/4397671"}},"subtitle":[],"editor":[{"given":"Zesong","family":"Fei","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/4397671"],"URL":"https:\/\/doi.org\/10.1155\/2018\/4397671","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2017-11-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4397671"}}