Journal ArticleDOI
Sieves for low autocorrelation binary sequences
TLDR
It is concluded that the requirement of skewsymmetry constitutes a powerful and effective sieve for the search for near-optimal sequences.Abstract:
The value 2e^{2} is calculated by approximations as a conjectured asymptotic limit for the best central to sidelobe energy ratio of very long low autocorrelation binary sequences. The same bound is calculated by approximation for skewsymmetric sequences, hence it is concluded that the requirement of skewsymmetry constitutes a powerful and effective sieve for the search for near-optimal sequences. A second sieve based on the use of complementary sequences is discussed and shown to be quite effective for sequence lengths up to 31, and its investigation for longer lengths by means of computers is suggested. A third and a fourth sieve, based on the selection of restricted classes of complementary sequences, are also discussed.read more
Citations
More filters
Journal ArticleDOI
Peak-to-mean power control in OFDM, Golay complementary sequences and Reed-Muller codes
James A. Davis,Jonathan Jedwab +1 more
TL;DR: A previously unrecognized connection between Golay complementary sequences and second-order Reed-Muller codes over alphabets Z/sub 2/h is found to give an efficient decoding algorithm involving multiple fast Hadamard transforms.
Journal ArticleDOI
New Algorithms for Designing Unimodular Sequences With Good Correlation Properties
Petre Stoica,Hao He,Jian Li +2 more
TL;DR: This paper presents several cyclic algorithms for the local minimization of ISL-related metrics and presents a number of examples, including the design of sequences that have virtually zero autocorrelation sidelobes in a specified lag interval and of long sequences that could hardly be handled by means of other algorithms previously suggested in the literature.
Posted Content
Landscapes and Their Correlation Functions
TL;DR: In this article, the correlation of a time series sampled along a random walk on the landscape and the correlation function with respect to a partition of the set of all vertex pairs are investigated.
Journal ArticleDOI
Landscapes and their correlation functions
TL;DR: In this paper, the correlation of a time series sampled along a random walk on the landscape and the correlation function with respect to a partition of the set of all vertex pairs are investigated.
Journal ArticleDOI
Optimization Methods for Designing Sequences With Low Autocorrelation Sidelobes
TL;DR: Numerical experiments show that the proposed algorithms outperform existing ones in terms of both the merit factors of designed sequences and the computational complexity.
References
More filters
Complementary series
TL;DR: These series, which were originally conceived in connection with the optical problem of multislit spectrometry, also have possible applications in communication engineering, for when the two kinds of elements of these series are taken to be +1 and -1, it follows immediately from their definition that the sum of their two respective autocorrelation series is zero everywhere, except for the center term.
Journal ArticleDOI
Synthesis of low-peak-factor signals and binary sequences with low autocorrelation (Corresp.)
TL;DR: In this correspondence, a formula for the phase angles is derived that yields generally low peak factors, often comparable to that of a sinusoidal signal of equal power.
Journal ArticleDOI
Binary sequences up to length 40 with best possible autocorrelation function
TL;DR: The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today, however, solutions were found up to length 40 by exhaustive searching with the aid of a special minicomputer.
Journal ArticleDOI
Binary pulse compression codes
TL;DR: This analytical technique produced codes for lengths near 100 digits as good as, or better than, any previously known binary pulse compression codes in less than 15 minutes computer time.
Journal ArticleDOI
A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)
TL;DR: An algorithm is presented for the generation of finite binary sequences having an odd number of terms of value + 1 or -1, whose autocorrelation values are zero for odd shifts.