A NEW SEARCH FOR SKEWSYMMETRIC BINARY SEQUENCES WITH OPTIMAL MERIT FACTORS

被引：33

作者：

GOLAY, MJE ^{[1
]}

HARRIS, DB ^{[1
]}

机构：

[1] PERKIN ELMER CORP,NORWALK,CT 06859

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 05期

关键词：

D O I：

10.1109/18.57219

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Previous results on skewsymmetric sequences with low autocorrelation by making exhaustive searches for sequences with optimal merit factor are extended up to length 69. We then used a sieve that required both the symmetric and antisymmetric components of a skewsymmetric sequence to have high merit factor to make limited searches up to length 117, and found many sequences with merit factor greater than 9. © 1990 IEEE

引用

页码：1163 / 1166

页数：4