id: 01782535
dt: j
an: 01782535
au: Takeshita, Oscar Y.; Costello, Daniel J.jun.
ti: New deterministic interleaver designs for turbo codes.
so: IEEE Trans. Inf. Theory 46, No.6, 1988-2006 (2000).
py: 2000
pu: Institute of Electrical and Electronics Engineers (IEEE), New York, NY
la: EN
cc: 
ut: permutations; pseudo-random sequences; quadratic congruences; turbo codes;
    interleavers; capacity
ci: 
li: doi:10.1109/18.868474
ab: Summary: It is well known that an interleaver with random properties, quite
    often generated by pseudo-random algorithms, is one of the essential
    building blocks of turbo codes. However, randomly generated
    interleavers have two major drawbacks: lack of an adequate analysis
    that guarantees their performance and lack of a compact representation
    that leads to a simple implementation. In this paper we present several
    new classes of deterministic interleavers of length $N$, with
    construction complexity $O(N)$, that permute a sequence of bits with
    nearly the same statistical distribution as a random interleaver and
    perform as well as or better than the average of a set of random
    interleavers. The new classes of deterministic interleavers have a very
    simple representation based on quadratic congruences and hence have a
    structure that allows the possibility of analysis as well as a
    straightforward implementation. Using the new interleavers, a turbo
    code of length 16384 that is only 0.7 dB away from capacity at a
    bit-error rate (BER) of $10^{-5}$ is constructed. We also generalize
    the theory of previously known deterministic interleavers that are
    based on block interleavers, and we apply this theory to the
    construction of a nonrandom turbo code of length 16384 with a very
    regular structure whose performance is only 1.1 dB away from capacity
    at a BER of $10^{-5}$.
rv: