Repeat-accumulate code 📖 Wikipedia

In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their ensemble weight distributions are easy to derive. RA codes were introduced by Divsalar et al.

In an RA code, an information block of length ${\displaystyle {N}}$ is repeated ${\displaystyle {q}}$ times, scrambled by an interleaver of size ${\displaystyle {qN}}$, and then encoded by a rate 1 accumulator. The accumulator can be viewed as a truncated rate 1 recursive convolutional encoder with transfer function ${\displaystyle {1/(1+D)}}$, but Divsalar et al. prefer to think of it as a block code whose input block ${\displaystyle {(z_{1},\ldots ,z_{n})}}$ and output block ${\displaystyle {(x_{1},\ldots ,x_{n})}}$ are related by the formula ${\displaystyle {x_{1}=z_{1}}}$ and ${\displaystyle x_{i}=x_{i-1}+z_{i}}$ for ${\displaystyle i>1}$. The encoding time for RA codes is linear and their rate is ${\displaystyle 1/q}$. They are nonsystematic.

Irregular repeat accumulate (IRA) codes build on top of the ideas of RA codes. IRA replaces the outer code in RA code with a low density generator matrix code.^[1] IRA codes first repeats information bits different times, and then accumulates subsets of these repeated bits to generate parity bits. The irregular degree profile on the information nodes, together with the degree profile on the check nodes, can be designed using density evolution.

Systematic IRA codes are considered a form of LDPC code. Litigation over whether the DVB-S2 LDPC code is a form of IRA code is ongoing.^[2] US patents 7,116,710; 7,421,032; 7,916,781; and 8,284,833 are at issue.^{[citation needed]}

• Divsalar, D.; Jin, H.; McEliece, R.J. (September 1998). "Coding theorems for 'turbo-like' codes". Proceedings of the annual Allerton Conference on Communication control and Computing. Vol. 36. University Of Illinois. pp. 201–210.

• Iterative Error Correction: Turbo, Low-Density Parity-Check, and Repeat-Accumulate Codes