Tail-Biting LDPC Convolutional Codes Based on Protographs

Abstract

In this paper, we introduce and investigate the tail- biting low-density parity-check convolutional codes (LDPCCCs) based on protographs. We show a construction algorithm for these codes, which is based on a modified version of the PEG algorithm [1] and on the unwrapping [2] technique. The basic ideas behind the decoder architecture for these codes are also discussed. Finally, the performances of the tail-biting LDPCCCs based on protographs are evaluated through computer simulations, where we also examine a family of rate-compatible codes.