Spatially Coupled Repeat-Accumulate Codes

Johnson, Sarah J.; Lechner, Gottfried

doi:10.1109/lcomm.2013.010313.122343

Cited by 36 publications

(19 citation statements)

References 9 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This copy-and-permute operation is called lifting and avoids small girths which often harm iterative decoding. In the following, we review four relevant constructions: the standard (l, r, L) P construction [6], a spatially coupled RA (SC-RA) construction [7] and a spatially coupled TAR4JA (SC-TAR4JA) construction [3].…”

Section: Constructions and Thresholdsmentioning

confidence: 99%

“…We have k = r l , k ∈ N VNs per regular (l, r) protograph and the code rate is calculated from the protograph as r (l,r,L)P = 1 − (L+l−1) kL . B. RA(q, L) Construction RA LDPC block codes are coupled as described in [7]. The uncoupled RA graphs contain message VNs and accumulator VNs.…”

Section: Constructions and Thresholdsmentioning

confidence: 99%

“…. , u + q − 1 and the accumulator VN at position u is connected to the CN at u exactly twice to keep the RA code accumulator structure [7]. …”

Section: Constructions and Thresholdsmentioning

confidence: 99%

“…For instance, our analysis applies to SC-LDPC codes based on accumulate-repeatby-4-jagged-accumulate (TAR4JA) structures analyzed in [3] or repeat-accumulate (RA) structures in [7]. First, we show that their finite-length performance can be estimated by means of an scaling law.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes

Stinner

Olmos

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes over the binary erasure channel (BEC) is analyzed. Existing scaling laws are extended to arbitrary protograph base matrices that include puncturing patterns and multiple edges between nodes. A regular protograph-based SC-LDPC construction based on the (4, 8)-regular LDPC block code works well in the waterfall region compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-off. Scaling laws are also used for code design and to estimate the block length of a given SC-LDPC code ensemble to match the performance of some other code. Estimates on the performance degradation are developed if the chain length varies.

show abstract

Section: Constructions and Thresholdsmentioning

confidence: 99%

Section: Constructions and Thresholdsmentioning

confidence: 99%

“…. , u + q − 1 and the accumulator VN at position u is connected to the CN at u exactly twice to keep the RA code accumulator structure [7]. …”

Section: Constructions and Thresholdsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes

Stinner

Olmos

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…However, it is later known that the finite-length performance of spatiallycoupled ARJA codes is rather worse than that of other spatially-coupled codes due to their inferior scaling behavior [15]. On the contrary, spatially-coupled repeat accumulate (SC-RA) codes [16] show the best finite-length performance compared to other spatially-coupled codes [15].…”

mentioning

confidence: 99%

Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programming

Kwak

Park

2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, we propose a new design method of irregular spatially-coupled low-density paritycheck (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the proposed method is based on two main ideas: A local design of the degree distributions and pre-computation of the input/output message relationship. These ideas make it possible to design the degree distributions of irregular SC-LDPC codes by solving low complexity LP problems over the binary erasure channel. We also find a proper objective function for the proposed design methodology to improve the performance of SC-LDPC codes. It is shown that the irregular SC-LDPC codes obtained by the proposed method are superior to regular SC-LDPC codes in terms of both asymptotic and finite-length performances. Index TermsLinear programming (LP) problem, low-density parity-check (LDPC) codes, non-uniform degree distributions, spatially-coupled low-density parity-check (SC-LDPC) codes.

show abstract

Convolutional LDPC Codes and Spatial Coupling

Schlegel

Pérez²

2015

Trellis and Turbo Coding

View full text Add to dashboard Cite

Spatially Coupled Repeat-Accumulate Codes

Cited by 36 publications

References 9 publications

Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes

Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes

Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programming

Convolutional LDPC Codes and Spatial Coupling

Contact Info

Product

Resources

About