Irregular repeat accumulate codes
Hao Jin · 2000
In this paper we will introduce an ensemble of codes called irregular repeat-accumulate (IRA) codes. IRA codes are a generalization of the repeat-accumulate codes introduced in [1], and as such have a natural linear time encoding algorithm. We shall prove that on the binary erasure channel, IRA codes can be decoded reliably in linear time, using iterater] sum-product decoding,a# ra#SJ a#SJ8T a#SJ8 close tocha#T36 ca pa#J464 Asimila# resulta#u ea#S to be true on the AWGN channel, although we have no proof of this. We illustrate our results with numerical and experimenta# examples.
Cited by 508 works.
Authors
References
- The capacity of low-density parity-check codes under message-passing decoding
- Iterative decoding of binary block and convolutional codes
- Codes and Decoding on General Graphs
- Analysis of low density codes and improved designs using irregular graphs
- Coding theorems for 'turbo-like' codes
- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
- Design of provably good low-density parity check codes
- Iterative turbo decoder analysis based on Gaussian density evolution