Sequence Pairs with Lowest Combined Autocorrelation and Crosscorrelation
Daniel J. Katz, Eli Moore

TL;DR
This paper characterizes when binary sequence pairs meet a fundamental autocorrelation and crosscorrelation bound, linking it to Golay pairs, and extends the results to complex sequences, analyzing their correlation properties.
Contribution
It proves that the Pursley-Sarwate bound is exactly met by Golay complementary pairs and generalizes this characterization to complex-valued sequences.
Findings
Golay pairs meet the Pursley-Sarwate bound exactly.
The bound is generalized to complex sequences.
Asymptotic correlation factors are computed for Golay families.
Abstract
Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair of binary sequences (i.e., sequences with terms in ). If is a nonzero sequence, then its autocorrelation demerit factor, , is the sum of the squared magnitudes of the aperiodic autocorrelation values over all nonzero shifts for the sequence obtained by normalizing to have unit Euclidean norm. If is a pair of nonzero sequences, then their crosscorrelation demerit factor, , is the sum of the squared magnitudes of the aperiodic crosscorrelation values over all shifts for the sequences obtained by normalizing both and to have unit Euclidean norm. Pursley and Sarwate showed that for binary sequences, the sum of and the geometric mean of and must be at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography · Approximation Theory and Sequence Spaces
