{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:30:49Z","timestamp":1770748249426,"version":"3.49.0"},"reference-count":24,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671395"],"award-info":[{"award-number":["61671395"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Recently, a mesh model-based merging (M3) method and four basic graph models were proposed to construct the double protograph low-density parity-check (P-LDPC) code pair of the joint source channel coding (JSCC). Designing the protograph (mother code) of the P-LDPC code with both a good waterfall region and lower error floor is a challenge, and few works have existed until now. In this paper, the single P-LDPC code is improved to further verify the availability of the M3 method, and its structure is different from the channel code in the JSCC. This construction technique yields a family of new channel codes with lower power consumption and higher reliability. The structured design and better performance demonstrate that the proposed code is hardware-friendly.<\/jats:p>","DOI":"10.3390\/e25020232","type":"journal-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T03:02:48Z","timestamp":1674788568000},"page":"232","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Protograph Designing of P-LDPC Codes via M3 Method"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4096-3333","authenticated-orcid":false,"given":"Dan","family":"Song","sequence":"first","affiliation":[{"name":"Department of Information and Communication Engineering, Xiamen University, Xiamen 361005, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6252-9271","authenticated-orcid":false,"given":"Meiyuan","family":"Miao","sequence":"additional","affiliation":[{"name":"College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-129X","authenticated-orcid":false,"given":"Lin","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Xiamen University, Xiamen 361005, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"key":"ref_1","unstructured":"Cover, T.M., and Thamos, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.]."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1109\/COMST.2019.2893851","article-title":"Survey of Turbo, LDPC, and Polar Decoder ASIC Implementations","volume":"21","author":"Shao","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2977","DOI":"10.1109\/COMST.2019.2894154","article-title":"Optimization of Component Elements in Integrated Coding Systems for Green Communications: A Survey","volume":"21","author":"Chen","year":"2019","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"33091","DOI":"10.1109\/ACCESS.2021.3061134","article-title":"Optimal Design of Joint Protomatrix for DP-LDPC Codes-based JSCC System over On-body Channel","volume":"9","author":"Song","year":"2021","journal-title":"IEEE Access"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"5526","DOI":"10.1109\/TWC.2022.3141729","article-title":"Joint Code Rate Compatible Design of DP-LDPC Code Pairs for Joint Source Channel Coding over Implant-to-external Channel","volume":"21","author":"Song","year":"2022","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"9596","DOI":"10.1109\/TWC.2022.3178207","article-title":"Designing a Common DP-LDPC Code Pair for Variable on-body Channels","volume":"21","author":"Song","year":"2022","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/JOE.2013.2241933","article-title":"Soft-Decision Feedback Turbo Equalization for LDPC-Coded MIMO Underwater Acoustic Communications","volume":"39","author":"Rafati","year":"2014","journal-title":"IEEE J. Ocean. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Padala, S.K., and D\u2019Souza, J. (2020, January 21\u201323). Performance of Spatially Coupled LDPC Codes over Underwater Acoustic Communication Channel. Proceedings of the 2020 National Conference on Communications (NCC), Kharagpur, India.","DOI":"10.1109\/NCC48643.2020.9056068"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/LPT.2022.3188725","article-title":"Performance Enhanced of Geometrically Shaped 64-QAM With LDPC in UOWC System","volume":"34","author":"Liang","year":"2022","journal-title":"IEEE Photonics Technol. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/JSAC.2009.090806","article-title":"Capacity-approaching Protograph Codes","volume":"27","author":"Divsalar","year":"2009","journal-title":"IEEE J. Select. Areas Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1989","DOI":"10.1109\/COMST.2015.2436705","article-title":"A Survey on Protograph LDPC Codes and Their Applications","volume":"17","author":"Fang","year":"2015","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ranganathan, S.V.S., Divsalar, D., and Wesel, R.D. (2017, January 25\u201330). Design of Improved Quasi-cyclic Protograph-based Raptor-like LDPC Codes for Short Block-lengths. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006720"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4866","DOI":"10.1109\/TIT.2015.2453267","article-title":"Spatially Coupled LDPC Codes Constructed from Protographs","volume":"9","author":"Mitchell","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.1109\/TCOMM.2015.2404842","article-title":"Protograph-based Raptor-like LDPC Codes","volume":"5","author":"Chen","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","article-title":"Regular and Irregular Progressive Edge-Growth Tanner Graphs","volume":"1","author":"Hu","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"4998","DOI":"10.1109\/TCOMM.2021.3077939","article-title":"Protograph-Based LDPC Hadamard Codes","volume":"69","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TCOMM.2013.122113.130465","article-title":"Analysis and Enumeration of Absorbing Sets for Non-binary Graph-based Codes","volume":"62","author":"Amiri","year":"2014","journal-title":"IEEE Trans. Commun."},{"key":"ref_18","first-page":"1273","article-title":"A combined Algebraic- and Graph-based Method for Constructing Structured RC-LDPC Codes","volume":"20","author":"Mu","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Song, D., Wang, L., and Chen, P. (2023). Mesh Model-based Merging Method for DP-LDPC Code Pair. IEEE Trans. Commun., in press.","DOI":"10.1109\/TCOMM.2023.3238363"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"110087","DOI":"10.1016\/j.automatica.2021.110087","article-title":"Enhancement of Opacity for Distributed State Estimation in Cyber-physical Systems","volume":"136","author":"An","year":"2022","journal-title":"Automatica"},{"key":"ref_21","unstructured":"Harary, F. (1994). Graph Theory, Addison-Wesley."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.294849","article-title":"Genetic algorithms: A survey","volume":"27","author":"Srinivas","year":"1994","journal-title":"Computer"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Divsalar, D., Dolinar, S., and Jones, C. (2005, January 4\u20139). Low-rate LDPC Codes with Simple Protograph Structure. Proceedings of the International Symposium on Information Theory (ISIT), Adelaide, Australia.","DOI":"10.1109\/ISIT.2005.1523619"},{"key":"ref_24","unstructured":"Divsalar, D., Jones, C., Dolinar, S., and Thorpe, J. (December, January 28). Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size. Proceedings of the GLOBECOM \u201905. IEEE Global Telecommunications Conference, St. Louis, MO, USA."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/232\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:16:45Z","timestamp":1760120205000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,27]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["e25020232"],"URL":"https:\/\/doi.org\/10.3390\/e25020232","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,27]]}}}