The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes

Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper, we perform a comprehensive design space exploration, revealing different aspects of SC-SCCs and discussing various design trade-offs. In particular, we investigate the impact of coupling memory, block length, decoding window size, and number of iterations on the performance, complexity, and latency of SC-SCCs. As a result, we propose design guidelines to make the code design independent of the block length. By introducing a modified window decoding schedule, we are able to demonstrate that the block length and coupling memory can be exchanged flexibly without changing the latency and complexity of decoding and without performance loss. Thus, thanks to spatial coupling, a certain code strength and performance can be achieved by either a very small block length or a large one, while the complexity and latency are fixed. Moreover, our results show that using higher coupling memory with smaller blocks can even improve the performance without increasing the latency and complexity. For all considered cases we observe that the performance of SC-SCCs is improved with respect to the uncoupled ensembles for a fixed latency and complexity.

[1]  Baoming Bai,et al.  Braided Convolutional Codes With Sliding Window Decoding , 2017, IEEE Transactions on Communications.

[2]  Krzysztof Wesolowski,et al.  Channel Coding for Ultra-Reliable Low-Latency Communication in 5G Systems , 2016, 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall).

[3]  Michael Lentmaier,et al.  Spatially Coupled Turbo-Like Codes , 2016, IEEE Transactions on Information Theory.

[4]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[5]  Gerhard Fettweis,et al.  Fully parallel window decoder architecture for spatially-coupled LDPC codes , 2016, 2016 IEEE International Conference on Communications (ICC).

[7]  Charly Poulliat,et al.  A General Framework and Optimization for Spatially-Coupled Serially Concatenated Systems , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[8]  Ralf R. Müller,et al.  Comparison of Convolutional and Block Codes for Low Structural Delay , 2015, IEEE Transactions on Communications.

[9]  Li Chen,et al.  Improved sliding window decoding of spatially coupled low-density parity-check codes , 2017, 2017 IEEE Information Theory Workshop (ITW).

[10]  Wen Xu,et al.  Window-Interleaved Turbo Codes , 2018, IEEE Communications Letters.

[11]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[12]  Michael Lentmaier,et al.  Thresholds of Braided Convolutional Codes on the AWGN Channel , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[13]  Ralf R. Müller,et al.  Low latency-constrained high rate coding: LDPC codes vs. convolutional codes , 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[14]  Jinhong Yuan,et al.  Partially Information-Coupled Turbo Codes for LTE Systems , 2018, IEEE Transactions on Communications.

[15]  Michael Lentmaier,et al.  Spatially Coupled Turbo-Like Codes: A New Trade-Off Between Waterfall and Error Floor , 2018, IEEE Transactions on Communications.

[16]  Nicolas Macris,et al.  Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels , 2013, IEEE Transactions on Information Theory.