Journal Home > Volume 29 , Issue 3
Tsinghua Science and Technology 2024, 29(3): 656-670 https://doi.org/10.26599/TST.2023.9010038
Open Access | Issue | Published: 04 December 2023

Spatially Coupled Codes via Bidirectional Block Markov Superposition Transmission

Show Author's Information Gaoyan Li1,  Shancheng Zhao1,2( ),  Haiqiang Chen2,  Jinming Wen1
College of Information Science and Technology, Jinan University, Guangzhou 510632, China
Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning 530004, China
Keywords:
block Markov superposition transmission (BMST), protograph-based extrinsic information transfer (PEXIT), capacity-approaching codes, spatial coupling
Cite this article:
Li G, Zhao S, Chen H, et al. Spatially Coupled Codes via Bidirectional Block Markov Superposition Transmission. Tsinghua Science and Technology, 2024, 29(3): 656-670. https://doi.org/10.26599/TST.2023.9010038
Download citation
EndNote(RIS)
BibTeX

221

Views

55

Downloads

Citations

0

Crossref

0

WoS

0

Scopus

0

CSCD

Abstract Full text About this article

In this paper, we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition. The resulting codes are termed as bidirectional block Markov superposition transmission (BiBMST) codes. Firstly, we perform an iterative decoding threshold analysis according to protograph-based extrinsic information transfer (PEXIT) charts for the BiBMST codes over the binary erasure channels (BECs). Secondly, we derive the generator and parity-check matrices of the BiBMST codes. Thirdly, extensive numerical results are presented to show the advantages of the proposed BiBMST codes. Particularly, our numerical results show that, under the constraint of an equal decoding latency, the BiBMST codes perform better than the recursive BMST (rBMST) codes. However, the simulation results show that, in finite-length regime, negligible performance gain is obtained by increasing the encoding memory. We solve this limitation by introducing partial superposition, and the resulting codes are termed as partially-connected BiBMST (PC-BiBMST) code. Analytical results have confirmed the advantages of the PC-BiBMST codes over the original BiBMST codes. We also present extensive simulation results to show the performance advantages of the PC-BiBMST codes over the spatially coupled low-density parity-check (SC-LDPC) codes, spatially coupled generalized LDPC (SC-GLDPC) codes, and the original BiBMST codes in the finite-length regime.


menu
Abstract
Full text
Outline
About this article

Spatially Coupled Codes via Bidirectional Block Markov Superposition Transmission

Show Author's information Gaoyan Li1, Shancheng Zhao1,2( ), Haiqiang Chen2, Jinming Wen1
College of Information Science and Technology, Jinan University, Guangzhou 510632, China
Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning 530004, China

Abstract

In this paper, we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition. The resulting codes are termed as bidirectional block Markov superposition transmission (BiBMST) codes. Firstly, we perform an iterative decoding threshold analysis according to protograph-based extrinsic information transfer (PEXIT) charts for the BiBMST codes over the binary erasure channels (BECs). Secondly, we derive the generator and parity-check matrices of the BiBMST codes. Thirdly, extensive numerical results are presented to show the advantages of the proposed BiBMST codes. Particularly, our numerical results show that, under the constraint of an equal decoding latency, the BiBMST codes perform better than the recursive BMST (rBMST) codes. However, the simulation results show that, in finite-length regime, negligible performance gain is obtained by increasing the encoding memory. We solve this limitation by introducing partial superposition, and the resulting codes are termed as partially-connected BiBMST (PC-BiBMST) code. Analytical results have confirmed the advantages of the PC-BiBMST codes over the original BiBMST codes. We also present extensive simulation results to show the performance advantages of the PC-BiBMST codes over the spatially coupled low-density parity-check (SC-LDPC) codes, spatially coupled generalized LDPC (SC-GLDPC) codes, and the original BiBMST codes in the finite-length regime.

Keywords: block Markov superposition transmission (BMST), protograph-based extrinsic information transfer (PEXIT), capacity-approaching codes, spatial coupling

References(35)

[1]

J. Du, J. Song, Y. Ren, and J. Wang, Convergence of broadband and broadcast/multicast in maritime information networks, Tsinghua Science and Technology, vol. 26, no. 5, pp. 592–607, 2021.
DOI Google Scholar
[2]

P. Wang and S. Wang, A fairness-enhanced intelligent MAC scheme using Q-learning-based bidirectional backoff for distributed vehicular communication networks, Tsinghua Science and Technology, vol. 28, no. 2, pp. 258–268, 2023.
DOI Google Scholar
[3]

Z. Chen, Z. Sun, Y. Pei, and L. Yin, Generalized sparse codes for non-Gaussian channels: Code design, algorithms, and applications, Fundam. Res., vol. 2, no. 2, pp. 284–295, 2022.
DOI Google Scholar
[4]

E. Arikan, Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels, IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, 2009.
DOI Google Scholar
[5]

C. Li, H. Chen, Z. Wang, Y. Sun, X. Li, and T. Qin, Two-stage constructions for the rate-compatible shortened polar codes, Tsinghua Science and Technology, vol. 28, no. 2, pp. 269–282, 2023.
DOI Google Scholar
[6]

R. Gallager, Low-density parity-check codes, IEEE Trans. Inform. Theory, vol. 8, no. 1, pp. 21–28, 1962.
DOI Google Scholar
[7]

D. J. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399–431, 1999.
DOI Google Scholar
[8]

P. Wang, L. Yin, and J. Lu, Efficient helicopter-satellite communication scheme based on check-hybrid LDPC coding, Tsinghua Science and Technology, vol. 23, no. 3, pp. 323–332, 2018.
DOI Google Scholar
[9]

A. J. Felstrom and K. S. Zigangirov, Time-varying periodic convolutional codes with low-density parity-check matrix, IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181–2191, 1999.
DOI Google Scholar
[10]

S. Kudekar, T. J. Richardson, and R. L. Urbanke, Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC, IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803–834, 2011.
DOI Google Scholar
[11]

M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, Iterative decoding threshold analysis for LDPC convolutional codes, IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274–5289, 2010.
DOI Google Scholar
[12]
A. Yedla, Y. Y. Jian, P. S. Nguyen, and H. D. Pfister, A simple proof of threshold saturation for coupled scalar recursions, in Proc. 2012 7th Int. Symp. on Turbo Codes and Iterative Information Processing (ISTC), Gothenburg, Sweden, 2012, pp. 51–55.
DOI
[13]

A. Yedla, Y. Y. Jian, P. S. Nguyen, and H. D. Pfister, A simple proof of maxwell saturation for coupled scalar recursions, IEEE Trans. Inform. Theory, vol. 60, no. 11, pp. 6943–6965, 2014.
DOI Google Scholar
[14]

S. Kudekar, T. J. Richardson, and R. L. Urbanke, Wave-like solutions of general 1-D spatially coupled systems, IEEE Trans. Inf. Theory, vol. 61, no. 8, pp. 4117–4157, 2015.
DOI Google Scholar
[15]

A. Ashikhmin, G. Kramer, and S. T. Brink, Extrinsic information transfer functions: Model and erasure channel properties, IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657–2673, 2004.
DOI Google Scholar
[16]

C. Measson, A. Montanari, T. J. Richardson, and R. Urbanke, The generalized area theorem and some of its consequences, IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4793–4821, 2009.
DOI Google Scholar
[17]
V. Aref, N. Macris, R. Urbanke, and M. Vuffray, Lossy source coding via spatially coupled LDGM ensembles, in Proc. 2012 IEEE Int. Symp. on Information Theory Proceedings, Cambridge, MA, USA, 2012, pp. 373–377.
DOI
[18]
V. Aref, N. Macris, and M. Vuffray, Approaching the rate-distortion limit by spatial coupling with belief propagation and decimation, in Proc. 2013 IEEE Int. Symp. on Information Theory, Istanbul, Turkey, 2013, pp. 1177–1181.
DOI
[19]

S. Cai, W. Lin, X. Yao, B. Wei, and X. Ma, Systematic convolutional low density generator matrix code, IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 3752–3764, 2021.
DOI Google Scholar
[20]

S. Moloudi, M. Lentmaier, and A. G. I. Amat, Spatially coupled turbo-like codes, IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6199–6215, 2017.
DOI Google Scholar
[21]
M. Lentmaier, S. Moloudi, and A. G. I. Amat, Braided convolutional codes—A class of spatially coupled turbo-like codes, in Proc. 2014 Int. Conf. Signal Processing and Communications (SPCOM), Bangalore, India, 2014, pp. 1–5.
DOI
[22]
A. G. I. Amat, S. Moloudi, and M. Lentmaier, Spatially coupled turbo codes: Principles and finite length performance, in Proc. 2014 11th Int. Symp. on Wireless Communications Systems (ISWCS), Barcelona, Spain, 2014, pp. 883–887.
DOI
[23]

W. Zhang, M. Lentmaier, K. S. Zigangirov, and D. J. Costello, Braided convolutional codes: A new class of turbo-like codes, IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 316–331, 2010.
DOI Google Scholar
[24]
M. Qiu, X. Wu, J. Yuan, and A. G. I. Amat, Generalized spatially coupled parallel concatenated convolutional codes with partial repetition, in Proc. 2021 IEEE Int. Symp. on Information Theory (ISIT), Melbourne, Australia, 2021, pp. 581–586.
DOI
[25]

X. Ma, C. Liang, K. Huang, and Q. Zhuang, Block Markov superposition transmission: Construction of big convolutional codes from short codes, IEEE Trans. Inf. Theory, vol. 61, no. 6, pp. 3150–3163, 2015.
DOI Google Scholar
[26]

C. Liang, X. Ma, Q. Zhuang, and B. Bai, Spatial coupling of generator matrices: A general approach to design good codes at a target BER, IEEE Trans. Commun., vol. 62, no. 12, pp. 4211–4219, 2014.
DOI Google Scholar
[27]

C. Liang, J. Hu, X. Ma, and B. Bai, A new class of multiple-rate codes based on block Markov superposition transmission, IEEE Trans. Signal Process., vol. 63, no. 16, pp. 4236–4244, 2015.
DOI Google Scholar
[28]
N. Lin, S. Cai, and X. Ma, Block Markov superposition transmission of BCH codes with iterative hard-decision decoding, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT), Aachen, Germany, 2017, pp. 1598–1602.
DOI
[29]

J. Hu, X. Ma, and C. Liang, Block Markov superposition transmission of repetition and single-parity-check codes, IEEE Commun. Lett., vol. 19, no. 2, pp. 131–134, 2015.
DOI Google Scholar
[30]

X. Ma, K. Huang, and B. Bai, Systematic block Markov superposition transmission of repetition codes, IEEE Trans. Inf. Theory, vol. 64, no. 3, pp. 1604–1620, 2018.
DOI Google Scholar
[31]

Q. Wang, S. Cai, Y. Wang, and X. Ma, Free-ride feedback and superposition retransmission over LDPC coded links, IEEE Trans. Commun., vol. 71, no. 1, pp. 13–25, 2023.
DOI Google Scholar
[32]

S. Zhao, X. Ma, Q. Huang, and B. Bai, Recursive block Markov superposition transmission of short codes: Construction, analysis, and applications, IEEE Trans. Commun., vol. 66, no. 7, pp. 2784–2796, 2018.
DOI Google Scholar
[33]

K. Huang and X. Ma, Performance analysis of block Markov superposition transmission of short codes, IEEE J. Sel. Areas Commun., vol. 34, no. 2, pp. 362–374, 2016.
DOI Google Scholar
[34]
G. Liva and M. Chiani, Protograph LDPC codes design based on EXIT analysis, in Proc. IEEE GLOBECOM 2007 - IEEE Global Telecommun. Conf., Washington, DC, USA, 2007, pp. 3250–3254.
DOI
[35]

D. G. M. Mitchell, P. M. Olmos, M. Lentmaier, and D. J. Costello, Spatially coupled generalized LDPC codes: Asymptotic analysis and finite length scaling, IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 3708–3723, 2021.
DOI Google Scholar
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 17 November 2022
Revised: 27 March 2023
Accepted: 05 May 2023
Published: 04 December 2023
Issue date: June 2024

Copyright

© The Author(s) 2024.

Acknowledgements

Acknowledgment

This work was supported by the National Natural Science Foundation of China (Nos. 62271233, 12271215, and 62261003), the Basic Research Program of Guangzhou Municipal Science and Technology Bureau (No. 202201020036), and the Guangdong Provincial Natural Science Foundation (Nos. 2022A1515010029 and 2021A1515011906).

Rights and permissions

The articles published in this open access journal are distributed under the terms of theCreative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return