Some Optimal and Near Optimal Doppler Resilient Complementary Sequence Sets

Bingsheng Shen, Zhengchun Zhou, Yang Yang, Pingzhi Fan

TL;DR

This paper introduces novel mathematical constructions for Doppler Resilient Complementary Sequence Sets (DRCSSs), a specialized class of signals designed to maintain high precision in radar and mobile communications despite the "notorious" Doppler effect. By leveraging combinatorial structures like frequency-hopping sequences and almost difference sets, the authors present new sequence sets that reach or closely approach theoretical limits for minimizing interference.

What Problem Does This Paper Address?

In modern wireless systems—particularly radar sensing and high-speed mobile communications like connected vehicles—signals are plagued by the Doppler effect. When a transmitter or receiver is moving, the signal undergoes a frequency shift (Doppler) and a time delay.

To identify a target or decode a message accurately, engineers use the Ambiguity Function (AF) to characterize how a receiver responds to these shifts. Ideally, a signal should have a "thumbtack" response: a sharp peak at the correct delay/Doppler and zero "sidelobes" (interference) everywhere else.

While "complementary sequences" (which sum multiple subsequences to cancel out interference) have existed since the 1960s, designing sets of these sequences that are resilient to Doppler shifts while remaining "optimal" (hitting the lowest possible theoretical interference levels) remains a significant mathematical challenge.

Methods

The authors propose four primary construction methods to generate these high-performance sequence sets:

  1. OC-FHSS Mapping: They demonstrate that One-Coincidence Frequency-Hopping Sequence Sets can be transformed into periodic DRCSSs. This allows them to inherit the low-interference properties of frequency-hopping codes.
  2. Circular Florentine Rectangles (CFR): By treating CFRs as a special case of frequency-hopping sequences, they construct DRCSSs that are asymptotically optimal.
  3. Almost Difference Sets (ADS): The authors use ADSs—a concept from combinatorial design—to create Low Ambiguity Zone (LAZ) sequence sets. These sets have extremely low interference within a specific window of delay and Doppler shifts.
  4. Complete Complementary Codes (CCC) Repetition: By repeating existing CCCs, they generate Zero Ambiguity Zone (ZAZ) DRCSSs, which feature a region of absolute zero interference, ideal for small-alphabet applications.

Datasets

As a theoretical contribution to sequence design, this paper does not use traditional "big data" datasets. Instead, it utilizes and builds upon established mathematical structures and benchmarks:

  • Combinatorial Structures: OC-FHSSs, ADSs, and CCCs sourced from existing literature (referenced in Tables II and IV).
  • Theoretical Bounds: The performance of the new sequences is evaluated against the Welch bound and specific AF lower bounds established in recent information theory research (e.g., Ding et al., 2020; Ye et al., 2021).

Key Insights and Ideas

  • The Power of Summation: The core "aha!" moment lies in the "complementary" nature of the sequences. By summing the ambiguity functions of several subsequences, the unwanted sidelobes of one subsequence can be mathematically canceled out by another.
  • Bridging Fields: The authors successfully bridge the gap between frequency-hopping code design and Doppler-resilient sequence design, showing that tools from the former can solve problems in the latter.
  • Asymptotic Optimality: They introduce an "optimality factor" ($\rho$). A value of $\rho = 1$ means the sequence is perfect. The paper proves that as the parameters of their constructions grow, $\rho$ approaches 1, meaning their methods become perfectly optimal in the limit.

Key Results

  • New Optimal Sets: The paper provides several new families of DRCSSs with parameters previously unachieved. For example, using OC-FHSS, they produced optimal sets where the set size, flock size, and length are all related to prime powers ($p^m$).
  • Thumbtack Performance: Numerical examples (e.g., Example 1) demonstrate that these sequences achieve an "ideal thumbtack" ambiguity function, which is physically impossible for traditional, non-complementary sequences.
  • LAZ/ZAZ Efficiency: The constructions for Low and Zero Ambiguity Zones provide engineers with "quiet windows" in the signal spectrum, significantly reducing the complexity of signal processing in high-mobility environments.

Limitations and Future Work

  • Alphabet Constraints: Some constructions (like those based on CCCs) are optimized for small alphabets, but others may require complex unimodular values that are harder to implement in low-cost hardware.
  • Initial Stage: The authors acknowledge that research into DRCSSs is still in its infancy. While they have found several optimal constructions, the variety of available parameters is still limited by the underlying mathematical structures (like the existence of specific Almost Difference Sets).
  • Future Directions: The authors suggest exploring "weakened" OC-FHSS requirements. By relaxing certain mathematical constraints, it may be possible to create even larger sets of sequences while maintaining their Doppler-resilient properties.

Summary updated

Abstract

Sequences with excellent ambiguity functions are very useful in radar detection and modern mobile communications. Doppler resilient complementary sequence (DRCS) is a new type of sequence proposed recently, which can achieve lower ambiguity function sidelobes by summing the ambiguity functions of subsequences. In this paper, we introduce some new constructions of DRCS sets (DRCSSs) based on one-coincidence frequency-hopping sequence sets (OC-FHSSs), almost difference sets (ADSs), some specific sequences, etc. Critically, the proposed DRCSSs are optimal or near optimal.
BibTeX
@misc{shen2025some,
  author = {Bingsheng Shen and Zhengchun Zhou and Yang Yang and Pingzhi Fan},
  title = {{Some Optimal and Near Optimal Doppler Resilient Complementary Sequence Sets}},
  year = {2025},
  eprint = {2508.15325},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2508.15325},
}
Figure