The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes
Preprint
Abstract
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 investigate the impact of coupling memory, block length, decoding window size, and number of iterations on the performance, complexity, and latency of SC-SCCs. Several design tradeoffs are presented to see the relation between these parameters in a wide range. Also, our analysis provides design guidelines for SC-SCCs in different scenarios to make the code design independent of block length. As a result, block length and coupling memory can be exchanged flexibly without changing the latency and complexity. Also, we observe that the performance of SC-SCCs is improved with respect to the uncoupled ensembles for a fixed latency and complexity.Keywords
All Related Versions
- Version 1, 2020-06-24, ArXiv
- Version 2, 2021-07-25, ArXiv
- Published version: , 1.
This publication has 9 references indexed in Scilit:
- Spatially Coupled Turbo-Like Codes: A New Trade-Off Between Waterfall and Error FloorIEEE Transactions on Communications, 2019
- Partially Information-Coupled Turbo Codes for LTE SystemsIEEE Transactions on Communications, 2018
- Window-Interleaved Turbo CodesIEEE Communications Letters, 2018
- Spatially Coupled Turbo-Like CodesIEEE Transactions on Information Theory, 2017
- Braided Convolutional Codes With Sliding Window DecodingIEEE Transactions on Communications, 2017
- Comparison of Convolutional and Block Codes for Low Structural DelayIEEE Transactions on Communications, 2015
- Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS ChannelsIEEE Transactions on Information Theory, 2014
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BECIEEE Transactions on Information Theory, 2011
- Iterative Decoding Threshold Analysis for LDPC Convolutional CodesIEEE Transactions on Information Theory, 2010