The author shows that Lempel-Costas (LC) arrays when treated as permutations possess ideal properties for use in pseudorandom interleavers. The basic theory of interleavers is reviewed and the necessary conditions imposed on permutations for successful operation of pseudorandom interleavers are given. Proof that LC arrays satisfy the conditions, and a comparison with randomly constructed permutations are given; it is shown that LC permutations perform better than randomly generated permutations.
No takes yet. Share an insight, caveat, or question.
S.V. Marić (1994) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: