ON LOWER BOUNDS TO THE MAXIMUM CORRELATION OF COMPLEX ROOTS-OF-UNITY SEQUENCES

被引:15
作者
KUMAR, PV [1 ]
LIU, CM [1 ]
机构
[1] BELL COMMUN RES INC,RED BANK,NJ 07701
关键词
D O I
10.1109/18.54881
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This correspondence shows how the Welch bound 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 Sidelnikov. 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. © 1990 IEEE
引用
收藏
页码:633 / 640
页数:8
相关论文
共 18 条
[1]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[4]  
Golomb S. W., 1967, SHIFT REGISTER SEQUE
[5]  
KASAMI T, 1966, AD632574
[6]  
Kasami T., 1969, COMBINATORIAL MATH I
[7]  
KUMAR PV, 1989, CSI870203 U SO CAL T
[8]  
Macwilliams F. J., 1977, THEORY ERROR CORRECT
[9]   A NEW FAMILY OF BINARY PSEUDORANDOM SEQUENCES HAVING OPTIMAL PERIODIC CORRELATION-PROPERTIES AND LARGE LINEAR SPAN [J].
NO, JS ;
KUMAR, PV .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (02) :371-379
[10]   BENT-FUNCTION SEQUENCES [J].
OLSEN, JD ;
SCHOLTZ, RA ;
WELCH, LR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :858-864