Generalized Spatially Coupled Parallel Concatenated Convolutional Codes with Partial Repetition
Paper in proceeding, 2021

We introduce generalized spatially coupled parallel concatenated codes (GSC-PCCs), a class of spatially coupled turbo-like codes obtained by coupling parallel concatenated codes (PCCs) with a fraction of information bits repeated before the PCC encoding. GSC-PCCs can be seen as a generalization of the original spatially coupled parallel concatenated convolutional codes (SC-PCCs) proposed by Moloudi et al. [1]. To characterize the asymptotic performance of GSC-PCCs, we derive the corresponding density evolution equations and compute their decoding thresholds. We show that the proposed codes have some nice properties such as threshold saturation and that their decoding thresholds improve with the repetition factor q. Most notably, our analysis suggests that the proposed codes asymptotically approach the capacity as q tends to infinity with any given constituent convolutional code.

Author

Min Qiu

University of New South Wales (UNSW)

Xiaowei Wu

University of New South Wales (UNSW)

Jinhong Yuan

University of New South Wales (UNSW)

Alexandre Graell I Amat

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks, Communication Systems

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

Vol. 2021-July 581-586
9781538682098 (ISBN)

2021 IEEE International Symposium on Information Theory, ISIT 2021
Virtual, Melbourne, Australia,

Reliable and Secure Coded Edge Computing

Swedish Research Council (VR) (2020-03687), 2021-01-01 -- 2024-12-31.

Subject Categories

Telecommunications

Discrete Mathematics

Mathematical Analysis

DOI

10.1109/ISIT45174.2021.9517979

More information

Latest update

12/29/2021