{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:19:50Z","timestamp":1762604390333,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T00:00:00Z","timestamp":1680048000000},"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":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Science Foundation of the Fujian Province, China","award":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}]},{"name":"the Fujian Province Young and Middle-aged Teacher Education Research Project","award":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}]},{"name":"the Scientific Research Funds of Huaqiao University","award":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"],"award-info":[{"award-number":["61901182","2020J05056","JAT220182","ZQN-1008","19BS206","20BS105","21BS118","62101195"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>By using the residual source redundancy to achieve the shaping gain, a joint source-channel coded modulation (JSCCM) system has been proposed as a new solution for probabilistic amplitude shaping (PAS). However, the source and channel codes in the JSCCM system should be designed specifically for a given source probability to ensure optimal PAS performance, which is undesirable for systems with dynamically changing source probabilities. In this paper, we propose a new shaping scheme by optimizing the bit-labeling of the JSCCM system. Instead of the conventional fixed labeling, the proposed bit-labelings are adaptively designed according to the source probability and the source code. Since it is simple to switch between different labelings according to the source probability and the source code, the proposed design can be considered as a promising low complexity alternative to obtain the shaping gain for sources with different probabilities. Numerical results show that the proposed bit-labelings can significantly improve the bit-error rate (BER) performance of the JSCCM system.<\/jats:p>","DOI":"10.3390\/e25040586","type":"journal-article","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T02:23:46Z","timestamp":1680143026000},"page":"586","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Bit-Labeling Design for Probabilistic Shaping Based on Residual Source Redundancy"],"prefix":"10.3390","volume":"25","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[{"name":"Xiamen Key Laboratory of Mobile Multimedia Communications, College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6562-8507","authenticated-orcid":false,"given":"Qiwang","family":"Chen","sequence":"additional","affiliation":[{"name":"Xiamen Key Laboratory of Mobile Multimedia Communications, College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanya","family":"Liu","sequence":"additional","affiliation":[{"name":"Xiamen Key Laboratory of Mobile Multimedia Communications, College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5137-7858","authenticated-orcid":false,"given":"Lin","family":"Zhou","sequence":"additional","affiliation":[{"name":"Xiamen Key Laboratory of Mobile Multimedia Communications, College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1109\/18.669123","article-title":"Bit-interleaved coded modulation","volume":"3","author":"Caire","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1109\/JSAC.1984.1146101","article-title":"Efficient modulation for band-limited channels","volume":"5","author":"Forney","year":"1984","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_3","first-page":"4651","article-title":"Bandwidth efficient and rate-matched low-density parity-check coded modulation","volume":"12","author":"Steiner","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/LCOMM.2018.2870180","article-title":"Bit-metric decoding of non-binary LDPC codes with probabilistic amplitude shaping","volume":"11","author":"Steiner","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/JSAC.2015.2504298","article-title":"Protograph-based LDPC code design for shaped bit-metric decoding","volume":"2","author":"Steiner","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/LCOMM.2022.3144610","article-title":"A simple sign-bit probabilistic shaping scheme","volume":"4","author":"Corlay","year":"2022","journal-title":"IEEE Commun. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1109\/LCOMM.2022.3200727","article-title":"A probabilistic shaping scheme for bit-interleaved coded modulation with iterative decoding","volume":"11","author":"Kang","year":"2022","journal-title":"IEEE Commun. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.2015.2499181","article-title":"Constant composition distribution matching","volume":"62","author":"Schulte","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"ref_9","unstructured":"Perkert, R., Kaindl, M., and Hindelang, T. (2001, January 7\u201311). Iterative source and channel decoding for GSM. Proceedings of the IEEE ICASSP, Salt Lake City, UT, USA."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Othman, N.S., El-Hajjar, M., Alamri, O., and Hanzo, L. (2007, January 22\u201325). Soft-bit assisted iterative AMR-WB source-decoding and turbo-detection of channel-coded differential space-time spreading using sphere packing modulation. Proceedings of the IEEE VTC-Spring, Dublin, Ireland.","DOI":"10.1109\/VETECS.2007.416"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Kliewer, J., and Gortz, N. (2002, January 13\u201317). Iterative source-channel decoding for robust image transmission. Proceedings of the IEEE ICASSP, Orlando, FL, USA.","DOI":"10.1109\/ICASSP.2002.1005111"},{"key":"ref_12","first-page":"1065","article-title":"Joint Source-Channel Turbo Coding for Binary Markov Sources","volume":"5","author":"Zhu","year":"2006","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_13","unstructured":"El-Hajjar, M., Othman, N.S., Quang, A.P., and Hanzo, L. (2008, January 21\u201324). Over-complete mapping aided, soft-bit assisted iterative unequal error protection H.264 joint source and channel decoding. Proceedings of the IEEE VTC-Fall, Calgary, AB, Canada."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, Q., He, Y., Chen, C., and Zhou, L. (2023). Optimization of protograph LDPC codes via surrogate channel for unequal power allocation. IEEE Trans. Commun., early access.","DOI":"10.1109\/TCOMM.2023.3237845"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4267","DOI":"10.1109\/TCOMM.2021.3071117","article-title":"Probabilistic shaping for protograph LDPC-coded modulation by residual source redundancy","volume":"7","author":"Chen","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3170","DOI":"10.1109\/TIT.2004.838367","article-title":"On the optimality of the binary reflected Gray code","volume":"12","author":"Agrell","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","unstructured":"Nguyen, V. (2012). Design of Capacity-Approaching Protograph-Based LDPC Coding Systems. [Ph.D. Dissertation, University of Texas at Dallas]."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/LWC.2017.2718542","article-title":"Performance improvement of joint source-channel coding with unequal power allocation","volume":"5","author":"He","year":"2017","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/JSAC.2009.090806","article-title":"Capacity approaching protograph codes","volume":"6","author":"Divsalar","year":"2009","journal-title":"IEEE J. Sel. Areas. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3255","DOI":"10.1109\/TCOMM.2018.2814603","article-title":"Joint optimization of protpgraph LDPC code pair for joint source and channel coding","volume":"8","author":"Chen","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","unstructured":"Uchikawa, H. (July, January 29). Design of non-precoded protograph-based LDPC codes. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, USA."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5369","DOI":"10.1109\/TVT.2020.2984235","article-title":"Design and Analysis of Joint Source Channel Coding Schemes Over Non-Standard Coding Channels","volume":"5","author":"Chen","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3929","DOI":"10.1109\/TCOMM.2015.2425877","article-title":"Iterative receiver for M-ary DCSK systems","volume":"11","author":"Lyu","year":"2015","journal-title":"IEEE Trans. Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/586\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:06:23Z","timestamp":1760123183000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,29]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["e25040586"],"URL":"https:\/\/doi.org\/10.3390\/e25040586","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,3,29]]}}}