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 are easy to derive. RA codes were introduced by Divsalar et al.
- Comment
- enIn computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their are easy to derive. RA codes were introduced by Divsalar et al.
- Has abstract
- enIn computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their are easy to derive. RA codes were introduced by Divsalar et al. In an RA code, an 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.
- Is primary topic of
- Repeat-accumulate code
- Label
- enRepeat-accumulate code
- Link from a Wikipage to an external page
- www.cambridge.org/gb/knowledge/isbn/item2711886/%3Fsite_locale=en_GB
- Link from a Wikipage to another Wikipage
- Accumulator (computing)
- Category:Error detection and correction
- Computer science
- Ensemble weight distributions
- Error-correcting code
- Information block
- Interleaver
- LDPC
- Recursive
- SameAs
- 4tU8Y
- m.0fbk32
- Q7313939
- Subject
- Category:Error detection and correction
- WasDerivedFrom
- Repeat-accumulate code?oldid=1104827949&ns=0
- WikiPageLength
- 2600
- Wikipage page ID
- 5880700
- Wikipage revision ID
- 1104827949
- WikiPageUsesTemplate
- Template:Cn
- Template:More footnotes
- Template:Reflist
- Template:Short description