Title :
A new unified construction of perfect root-of-unity sequences
Author_Institution :
Lehrstuhl fur Nachrichtentech., Tech. Univ. Munchen, Germany
Abstract :
Perfect root-of-unity sequences (PRUS) have found applications in numerous spread spectrum systems such as pulse compression radars, DS/SSMA, FH/SSMA, etc. A unified PRUS construction, which includes all known constructions as special cases, was previously devised by this author. In this paper, a class of root-of-unity sequence sets with certain interesting correlation properties is identified as a very important source of PRUS. By deriving a general construction of such sequence sets, a new, even more general unified PRUS construction is obtained. In addition, a new lower bound on the total number of PRUS with given alphabet size and sequence length is derived by determining the exact number of PRUS obtainable from the construction. The bound is tight for all cases, in which the exact values are known. Furthermore, it is proved that there is no new PRUS obtainable through the application of various perfectness-invariant transformations and the direct product construction. This gives strong evidences to support the conjecture that the new unified construction in fact describes all PRUS that exist
Keywords :
code division multiple access; frequency hop communication; pseudonoise codes; pulse compression; radar theory; sequences; spread spectrum communication; spread spectrum radar; DS/SSMA; FH/SSMA; PRUS; alphabet size; correlation properties; direct product construction; perfect root-of-unity sequences; perfectness-invariant transformations; pulse compression radars; sequence length; sequence sets; spread spectrum systems; unified construction; Autocorrelation; Channel estimation; Chirp; Cryptography; Jamming; Pulse compression methods; Radar applications; Spread spectrum radar; Transform coding;
Conference_Titel :
Spread Spectrum Techniques and Applications Proceedings, 1996., IEEE 4th International Symposium on
Conference_Location :
Mainz
Print_ISBN :
0-7803-3567-8
DOI :
10.1109/ISSSTA.1996.563445