Practical interleavers for repeat-accumulate codes

In this paper we design practical interleavers for regular, systematic repeat-accumulate (RA) codes. The new interleavers, which we call L-type and modified L-type interleavers, are deterministic, described by a single parameter, and straightforward to implement. Despite their simple description, the new interleavers are shown to perform equally as well as, or better than, traditional interleavers over a wide range of code lengths and rates.