The Asymptotics of Difference Systems of Sets for Synchronization and Phase Detection

TL;DR

This paper proves that optimal difference systems of sets asymptotically reach Levenshtein's lower bound, providing a probabilistic linear-time construction method and demonstrating their application in phase detection and noise-resilient synchronization.

Contribution

It establishes the asymptotic optimality of difference systems of sets and introduces a linear-time randomized construction algorithm for them.

Findings

Optimal DSSes asymptotically attain Levenshtein's lower bound.

A linear-time randomized algorithm constructs asymptotically optimal DSSes.

DSSes have applications in phase detection and noise-resilient synchronization.

Abstract

We settle the problem of determining the asymptotic behavior of the parameters of optimal difference systems of sets, or DSSes for short, which were originally introduced for computationally efficient frame synchronization under the presence of additive noise. We prove that the lowest achievable redundancy of a DSS asymptotically attains Levenshtein's lower bound for any alphabet size and relative index, answering the question of Levenshtein posed in 1971. Our proof is probabilistic and gives a linear-time randomized algorithm for constructing asymptotically optimal DSSes with high probability for any alphabet size and information rate. This provides efficient self-synchronizing codes with strong noise resilience. We also point out an application of DSSes to phase detection.