A unified approach to autocorrelation of Frank, Chu, and Milewski sequences
Idris Mercer
TL;DR
This paper introduces a unified, simple construction method for perfect polyphase sequences that encompasses Frank, Chu, and Milewski sequences, with insights into their autocorrelation properties.
Contribution
It presents a unified and simplified construction framework for perfect polyphase sequences, including Frank, Chu, and Milewski sequences as special cases.
Findings
Sequences are perfect polyphase with ideal autocorrelation.
The construction simplifies understanding of sequence autocorrelations.
Includes remarks on acyclic autocorrelation properties.
Abstract
We construct a family of perfect polyphase sequences that has the Frank sequences, Chu sequences, and Milewski sequences as special cases. This is not the most general construction of this type, but it has a particularly simple form. We also include some remarks about the acyclic autocorrelations of our sequences.
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Wireless Communication Networks Research