DeepAI AI Chat
Log In Sign Up

Time-Invariant LDPC Convolutional Codes

by   Dimitris Achlioptas, et al.
University of California Santa Cruz
ETH Zurich

Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is determined by a very small number of parameters. More precisely, we consider time-invariant low-density convolutional codes with very large constraint lengths. We show via simulations that, despite their extreme simplicity, such codes still show the threshold saturation behavior known from the spatially coupled codes discussed in the literature. Further, we show how the size of the typical minimum stopping set is related to basic parameters of the code. Due to their simplicity and good performance, these codes might be attractive from an implementation perspective.


page 1

page 2

page 3

page 4


Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth

We propose a low-complexity method to find quasi-cyclic low-density pari...

Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition

We introduce generalized spatially coupled parallel concatenated codes (...

Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed gener...

Zipper Codes

Zipper codes are a framework for describing spatially-coupled product-li...

Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes

In this paper, we study a class of spatially coupled turbo codes, namely...

Generalized LDPC Codes with Convolutional Code Constraints

Braided convolutional codes (BCCs) are a class of spatially coupled turb...

New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes

One of the most important and challenging problems in coding theory is t...