Aperiodic Crosscorrelation of Sequences Derived From Characters

被引:8
作者
Katz, Daniel J. [1 ]
机构
[1] Calif State Univ Northridge, Dept Math, Northridge, CA 91330 USA
基金
美国国家科学基金会;
关键词
Crosscorrelation; autocorrelation; aperiodic; merit factor; m-sequence; Legendre sequence; BINARY SEQUENCES; MERIT FACTOR; LEGENDRE SEQUENCES; L-4; NORM; POLYNOMIALS;
D O I
10.1109/TIT.2016.2589259
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is shown that the pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of the other, and shifts them appropriately, one can get significantly lower mean square aperiodic crosscorrelation. Sequence pairs with even lower mean square aperiodic crosscorrelation are constructed by taking a Legendre sequence, cyclically shifting it, and then cutting it (approximately) in half and using the halves as the sequences of the pair. In some of these constructions, the mean square aperiodic crosscorrelation can be lowered further if one truncates or periodically extends (appends) the sequences. Exact asymptotic formulas for mean squared aperiodic crosscorrelation are proved for sequences derived from additive characters (including m-sequences and modified versions thereof) and multiplicative characters (including Legendre sequences and their relatives). Data are presented that show that the sequences of modest length have performance that closely approximates the asymptotic formulas.
引用
收藏
页码:5237 / 5259
页数:23
相关论文
共 24 条
[1]  
[Anonymous], 2005, SIGNAL DESIGN GOOD C, DOI DOI 10.1017/CBO9780511546907
[2]   Binary sequences with merit factor greater than 6.34 [J].
Borwein, P ;
Choi, KKS ;
Jedwab, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) :3234-3249
[3]   Merit factors of character polynomials [J].
Borwein, P ;
Choi, KKS .
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2000, 61 :706-720
[4]   THE MERIT FACTOR OF LEGENDRE SEQUENCES [J].
GOLAY, MJE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (06) :934-936
[6]  
Golomb S.W., 1967, Shift Register Sequences
[7]   DETERMINATION OF THE MERIT FACTOR OF LEGENDRE SEQUENCES [J].
HOHOLDT, T ;
JENSEN, HE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (01) :161-164
[8]   Littlewood polynomials with small L4 norm [J].
Jedwab, Jonathan ;
Katz, Daniel J. ;
Schmidt, Kai-Uwe .
ADVANCES IN MATHEMATICS, 2013, 241 :127-136
[9]   Advances in the merit factor problem for binary sequences [J].
Jedwab, Jonathan ;
Katz, Daniel J. ;
Schmidt, Kai-Uwe .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (04) :882-906
[10]  
JENSEN HE, 1989, LECT NOTES COMPUT SC, V356, P306