Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call