Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC Codes

TL;DR

This paper explores how tail-biting SC-LDPC codes can nearly match terminated codes' performance through random shortening, and examines their use over parallel channels, optimizing bit distribution to minimize buffer requirements.

Contribution

It introduces a method to approach terminated SC-LDPC code performance using random shortening of tail-biting codes and analyzes their application over parallel channels with optimized bit distribution.

Findings

Tail-biting SC-LDPC codes can achieve near-terminated code performance.

Optimal bit distribution reduces encoder buffer size.

Performance approaches MAP decoding within the achievable region.

Abstract

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical finite coupling lengths. In this paper, we study how we can approach the performance of terminated SC-LDPC codes by random shortening of tail-biting SC-LDPC codes. We find the minimum required rate-loss in order to achieve the same performance than terminated codes. We additionally study the use of tail-biting SC-LDPC codes for transmission over parallel channels (e.g., bit-interleaved-coded-modulation (BICM)) and investigate how the distribution of the coded bits between two parallel channels can change the performance of the code. We show that a tail-biting SC-LDPC code can be used with BP decoding almost anywhere within the achievable region of MAP decoding. The optimization comes with a mandatory buffer at the encoder side. We evaluate different distributions of coded bits in order to reduce this buffer length.