Polyphase Barker sequences up to length 36

被引:41
作者
Friese, M
机构
[1] Institute for Communication Technology, Technical University of Darmstadt
关键词
Barker sequences; Huffman sequences; optimization;
D O I
10.1109/18.508850
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is shown that uniform complex sequences up to length 36, meeting the Barker condition, do exist. Examples are given for length 32-36. The sequences were obtained with a stochastic optimization algorithm, that was run with properly selected starting vectors.
引用
收藏
页码:1248 / 1250
页数:3
相关论文
共 9 条
[1]  
[Anonymous], 1953, GROUP SYNCHRONIZATIO
[2]   POLYPHASE BARKER SEQUENCES [J].
BOMER, L ;
ANTWEILER, M .
ELECTRONICS LETTERS, 1989, 25 (23) :1577-1579
[3]   NEW OPTIMIZATION HEURISTICS - THE GREAT DELUGE ALGORITHM AND THE RECORD-TO-RECORD TRAVEL [J].
DUECK, G .
JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 104 (01) :86-92
[4]  
ELIAHOU S, 1992, ENSEIGNEMENT MATH, V38, P345
[5]   POLYPHASE BARKER SEQUENCES UP TO LENGTH 31 [J].
FRIESE, M ;
ZOTTMANN, H .
ELECTRONICS LETTERS, 1994, 30 (23) :1930-1931
[6]  
HUFFMAN DA, 1962, IRE T INFORM THEOR, V8, pS10
[7]  
Oppenheim AV, 1975, DIGITAL SIGNAL PROCE
[8]   UNIFORM COMPLEX CODES WITH LOW AUTOCORRELATION SIDELOBES [J].
SOMAINI, U ;
ACKROYD, MH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :689-691
[9]   60-PHASE GENERALIZED BARKER SEQUENCES [J].
ZHANG, N ;
GOLOMB, SW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (04) :911-912