Repeat-accumulate code

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 is repeated times, scrambled by an interleaver of size , and then encoded by a rate 1 accumulator. The accumulator can be viewed as a truncated rate 1 recursive convolutional encoder with transfer function , but Divsalar et al. prefer to think of it as a block code whose input block and output block are related by the formula and for . The encoding time for RA codes is linear and their rate is . They are nonsystematic.

Irregular Repeat Accumulate Codes

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.

Notes
  1. Hui Jin, Aamod Khandekar & Robert McEliece, "Irregular Repeat-Accumulate Codes."
  2. Hughes Satellite Codes Spark Caltech Patent Suit
gollark: Blind people should simply touch-type.
gollark: Why voice recognition when you could simply type faster?
gollark: You should get more jokes.
gollark: Shut up, "Zachary". I know you were behind this somehow.
gollark: We have just endured the horrible agonies of MULTIPLE hours with broken internet connectivity.

References
  • D. Divsalar, H. Jin, and R. J. McEliece. "Coding theorems for ‘turbo-like’ codes." Proc. 36th Allerton Conf. on Communication, Control and Computing, Allerton, Illinois, Sept. 1998, pp. 201–210.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.