A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources

LÜ Yaping; MA Xiao

doi:10.11999/JEIT251224

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2026 >

LÜ Yaping, MA Xiao. A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251224

Citation:

LÜ Yaping, MA Xiao. A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251224

LÜ Yaping, MA Xiao. A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251224

Citation:

LÜ Yaping, MA Xiao. A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251224

PDF( 1946 KB)

A Joint Source-Channel Coding Modulation Scheme for the Transmission of Gaussian Sources

doi: 10.11999/JEIT251224 cstr: 32379.14.JEIT251224

LÜ Yaping^{1, 2
,},
MA Xiao^{1, 2
,
,}

1.
School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China
2.
Guangdong Key Laboratory of Information Security Technology, Sun Yat-sen University, Guangzhou 510006, China

Funds: The National Key R&D Program of China (2020YFB1807100), The National Natural Science Foundation of China (62471506, 62371411)

Received Date: 2025-11-21
Accepted Date: 2026-05-29
Rev Recd Date: 2026-05-29

Available Online: 2026-06-09

Abstract

Abstract

Objective The Separated Source-Channel Coding (SSCC) scheme has been proven to incur no performance loss when the source block length tends to infinity. However, SSCC usually requires a large buffer and causes long delay. It may also lead to error propagation when a single symbol error occurs in the communication channel. To alleviate these issues, Joint Source-Channel Coding (JSCC) schemes have been studied for Gaussian source transmission. In this paper, a Joint Source-Channel Coding Modulation (JSCCM) scheme is proposed for Gaussian sources. A Gaussian source reconstruction scheme and its reconstruction expression are also provided. Methods The Gaussian source sequence is quantized into an M-ary symbol sequence by a Lloyd-Max quantizer. For the M-ary quantized symbol sequence, a matching M-ary Fourier Transform Pair (FTP) code is constructed. The corresponding M-ary Pulse Amplitude Modulation (M-PAM) scheme is adopted for modulation. The modulated M-ary symbol sequence is transmitted using Block Markov Superposition Transmission (BMST), forming a BMST-FTP code. In addition, a Geometric Shaping (GS) scheme is proposed to obtain shaping gain. In the proposed source reconstruction scheme, the system output is the weighted average of the representative elements of the Lloyd-Max quantizer, rather than a single representative element. Results and Discussions Simulations are conducted over Additive White Gaussian Noise (AWGN) channels with M-PAM modulation and BMST-FTP codes over Galois Field (GF) orders 3 and 5, denoted GF(3) and GF(5). For FTP codes with random mapping, the Word Error Rate (WER) approaches the Union Bound (UB) at high Signal-to-Noise Ratio (SNR). Similarly, FTP codes with m repeated transmissions show WER performance close to the corresponding UBs. The WER performance of BMST-FTP codes with memory m also approaches the UBs in the high SNR region (Fig. 6). In terms of Symbol Error Rate (SER), the GF(3) BMST-FTP code outperforms the GF(5) BMST-FTP code (Fig. 7(a)). For the GF(5) BMST-FTP code, GS provides an SER performance gain of approximately 0.3 dB (Fig. 8(a)). In terms of distortion performance, the GF(3) BMST-FTP code performs better in the low SNR region, whereas the GF(5) BMST-FTP code performs better in the high SNR region (Fig. 7(b)). Compared with other work, the GF(3) BMST-FTP code with m = 1 achieves similar performance, whereas the GF(5) BMST-FTP code with m = 1 achieves better performance (Fig. 7(b)). Conclusions This work proposes a JSCCM scheme for Gaussian source transmission. In the proposed scheme, two types of BMST-FTP codes are constructed. Each code is matched with a corresponding Lloyd-Max quantizer and M-PAM modulator. A Gaussian source reconstruction scheme and its reconstruction expression are also provided. Simulation results show that an appropriate transmission scheme can be selected according to the target performance. The proposed GS scheme provides an SER gain of approximately 0.3 dB and improves distortion performance in the waterfall region.
- Gaussian sources,
- Fourier transform pair code,
- Block Markov superposition transmission,
- Geometry shaping

FullText(HTML)

References(26)

References

[1]	LIU Yi, YUAN Xingliang, XIONG Zehui, et al. Federated learning for 6G communications: Challenges, methods, and future directions[J]. China Communications, 2020, 17(9): 105–118. doi: 10.23919/jcc.2020.09.009.
[2]	ZHENG Sihui, SHEN Cong, and CHEN Xiang. Design and analysis of uplink and downlink communications for federated learning[J]. IEEE Journal on Selected Areas in Communications, 2021, 39(7): 2150–2167. doi: 10.1109/JSAC.2020.3041388.
[3]	BURSALIOGLU O Y, CAIRE G, and DIVSALAR D. Joint source-channel coding for deep-space image transmission using rateless codes[J]. IEEE Transactions on Communications, 2013, 61(8): 3448–3461. doi: 10.1109/TCOMM.2013.061913.120747.
[4]	CHRAITI M and ERCETIN O. Perceptual lossy compression rate for two correlated Gaussian sources[J]. IEEE Communications Letters, 2025, 29(10): 2336–2340. doi: 10.1109/LCOMM.2025.3594598.
[5]	LI Yishen, CHEN Xuechen, and DENG Xiaoheng. Joint source-channel coding for a multivariate Gaussian over a Gaussian MAC using variational domain adaptation[J]. IEEE Transactions on Cognitive Communications and Networking, 2023, 9(6): 1424–1437. doi: 10.1109/TCCN.2023.3294754.
[6]	SHANNON C E. A mathematical theory of communication[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2001, 5(1): 3–55. doi: 10.1145/584091.584093.
[7]	DAVISSON L. Rate distortion theory: A mathematical basis for data compression[J]. IEEE Transactions on Communications, 1972, 20(6): 1202–1202. doi: 10.1109/tcom.1972.1091311.
[8]	段建新, 张天赐, 陈正川, 等. 有限码长信源编码下联合提升无线物联系统信息时效性与保真度[J]. 电子与信息学报, 2025. doi: 10.11999/JEIT251057. DUAN Jianxin, ZHANG Tianci, CHEN Zhengchuan, et al. Jointly improving information timeliness and fidelity under finite-blocklength source coding in a wireless IOT system[J]. Journal of Electronics & Information Technology, 2025. doi: 10.11999/JEIT251057.
[9]	YEH P S and MILLER W H. Application guide for universal source encoding for space[R]. NASA Technical Paper 3441, 1993.
[10]	FRESIA M, PERÉZ-CRUZ F, POOR H V, et al. Joint source and channel coding[J]. IEEE Signal Processing Magazine, 2010, 27(6): 104–113. doi: 10.1109/MSP.2010.938080.
[11]	包涵, 凃国防, 张灿, 等. 基于可变长纠错码和掺杂调制的联合信源信道编码调制方法[J]. 电子与信息学报, 2023, 45(6): 2045–2053. doi: 10.11999/JEIT220531. BAO Han, TU Guofang, ZHANG Can, et al. Joint source-channel code modulation scheme based on variable-length error-correct code and doping modulation[J]. Journal of Electronics & Information Technology, 2023, 45(6): 2045–2053. doi: 10.11999/JEIT220531.
[12]	GAO Yang and TUNCEL E. New hybrid digital/analog schemes for transmission of a Gaussian source over a Gaussian channel[J]. IEEE Transactions on Information Theory, 2010, 56(12): 6014–6019. doi: 10.1109/TIT.2010.2081112.
[13]	ZHAO Shancheng and MA Xiao. Partially block Markov superposition transmission of a Gaussian source with nested lattice codes[J]. IEEE Transactions on Communications, 2016, 64(12): 5217–5226. doi: 10.1109/TCOMM.2016.2611670.
[14]	YANG Zheng, ZHAO Shancheng, MA Xiao, et al. A new joint source-channel coding scheme based on nested lattice codes[J]. IEEE Communications Letters, 2012, 16(5): 730–733. doi: 10.1109/LCOMM.2012.031912.120151.
[15]	LIANG Jifan, ZHU Tingting, WEI Baodian, et al. A new JSCC scheme for transmission of Gaussian sources over AWGN channels[C]. 2023 IEEE/CIC International Conference on Communications in China, Dalian, China, 2023: 1–6. doi: 10.1109/ICCC57788.2023.10233613.
[16]	WU Qiaoqiao, JI Meiying, SUN Jiachen, et al. Transmission of Gaussian source using ternary convolutional low density generator matrix codes[C]. 2018 IEEE International Conference on Communication Systems, Chengdu, China, 2018: 231–235. doi: 10.1109/ICCS.2018.8689170.
[17]	LLOYD S. Least squares quantization in PCM[J]. IEEE Transactions on Information Theory, 1982, 28(2): 129–137. doi: 10.1109/TIT.1982.1056489.
[18]	MA Xiao, CHEN Dian, and LV Yaping. Block Markov superposition transmission of Fourier transform pair codes[C]. 2022 14th International Conference on Wireless Communications and Signal Processing, Nanjing, China, 2022: 378–382. doi: 10.1109/WCSP55476.2022.10039295.
[19]	MA Xiao, LIANG Chulong, HUANG Kechao, et al. Block Markov superposition transmission: Construction of big convolutional codes from short codes[J]. IEEE Transactions on Information Theory, 2015, 61(6): 3150–3163. doi: 10.1109/TIT.2015.2422296.
[20]	STEINER F and BÖCHERER G. Comparison of geometric and probabilistic shaping with application to ATSC 3.0[C]. 2017 11th International ITG Conference on Systems, Communications and Coding, Hamburg, Germany, 2017: 1–6.
[21]	BOUTROS J J, EREZ U, VAN WONTERGHEM J, et al. Geometric shaping: Low-density coding of Gaussian-like constellations[C]. 2018 IEEE Information Theory Workshop, Guangzhou, China, 2018: 1–5. doi: 10.1109/ITW.2018.8613506.
[22]	KÖKEN E, GÜNDÜZ D, and TUNCEL E. Energy-distortion exponents in lossy transmission of Gaussian sources over Gaussian channels[J]. IEEE Transactions on Information Theory, 2017, 63(2): 1227–1236. doi: 10.1109/tit.2016.2634578.
[23]	WANG Qianfan, CAI Suihua, LIN Wenchao, et al. Spatially coupled LDPC codes via partial superposition and their application to HARQ[J]. IEEE Transactions on Vehicular Technology, 2021, 70(4): 3493–3504. doi: 10.1109/TVT.2021.3065052.
[24]	WANG Qianfan, CAI Suihua, LIN Wenchao, et al. Spatially coupled LDPC codes via partial superposition[C]. 2019 IEEE International Symposium on Information Theory, Paris, France, 2019: 2614–2618. doi: 10.1109/ISIT.2019.8849384.
[25]	FORNEY G D. Codes on graphs: Normal realizations[J]. IEEE Transactions on Information Theory, 2001, 47(2): 520–548. doi: 10.1109/18.910573.
[26]	ZHUANG Qiutao, MA Xiao, and KAVCIC A. Bounds on the ML decoding error probability of RS-coded modulation over AWGN channels[J]. arXiv preprint arXiv: 1401.5305, 2014.