DocumentCode :
1519809
Title :
On lower bounds to the maximum correlation of complex roots-of-unity sequences
Author :
Kumar, P. Vijay ; Liu, Chao-ming
Author_Institution :
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
Volume :
36
Issue :
3
fYear :
1990
fDate :
5/1/1990 12:00:00 AM
Firstpage :
633
Lastpage :
640
Abstract :
It is shown how the Welch bound (1974) on the maximum correlation of families of complex sequences of fixed norm can be modified to provide an improved bound for the case when the sequence symbols are roots of unity. As in the Welch bound, the improved bound is based on a useful expression for the even correlation moments. An analysis of the ratio of successive even moments using this expression is shown to yield a small improvement over a similarly derived bound due to V.M. Sidelnikov (1971). Interestingly, the expression for the moments reduces in the binary (q=2) case to a version of the Pless power-moment identities. The derivation also provides insight into the problem of optimal sequence design
Keywords :
binary sequences; correlation theory; Welch bound; complex sequences; even correlation moments; lower bounds; maximum correlation; optimal sequence design; roots-of-unity sequences; Chaotic communication; Digital communication; Information theory; Multiaccess communication; National security; Reliability theory; Statistics; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.54881
Filename :
54881
Link To Document :
بازگشت