A note on an OACF-preserving operation based on Parker's Transformation

Geyang Wang, Qi Wang

Abstract: This study introduces "nega-decimation," a novel mathematical operation designed to preserve the odd-periodic autocorrelation (OACF) properties of binary sequences. While standard decimation preserves even-periodic autocorrelation (PACF) but alters OACF, nega-decimation maintains OACF values through a specific correction term. By applying this operation to sequences generated via Parker’s Transformation, the authors demonstrate that 16 previously distinct classes of optimal sequences are mathematically equivalent, reducing them to 8 unique classes. This finding significantly simplifies the landscape of sequence design for modern communication systems.

Introduction

In digital communication frameworks such as GPS and CDMA, binary sequences with low autocorrelation are essential for signal synchronization and interference mitigation. Autocorrelation is typically categorized into even-periodic (PACF) and odd-periodic (OACF) types. While operations like negation, cyclic shift, and decimation are known to preserve PACF, the OACF-preserving counterpart to decimation has been missing. This paper addresses this gap by defining "nega-decimation," an operation that maintains OACF properties, thereby providing a complete set of OACF-preserving transformations.

Mathematical Framework

The research utilizes Parker’s Transformation, which maps a binary sequence $s$ of length $N$ to a sequence $u$ of length $2N$ by concatenating $s$ with its complement ($s \oplus 1$). The core innovation is the nega-decimation operator $\tilde{D}_d$, defined as: $$\tilde{D}_d(s)(\tau) = s(d\tau) + \lfloor \frac{d\tau}{N} \rfloor$$ This operator incorporates a floor-function-based correction term that ensures the resulting sequence retains the original OACF distribution. The authors provide formal algebraic proofs to establish that nega-decimation is a distinct, OACF-preserving operation that cannot be synthesized from negation or nega-cyclic shifts alone.

Classification and Results

The most significant application of nega-decimation is the re-evaluation of 16 classes of binary sequences with optimal OACF properties proposed by Matthew Parker in 2001. By applying the nega-decimation operator, the authors prove that these 16 cases are not independent but rather belong to 8 fundamental classes. For instance, sequences $s_1$ and $s_4$ are shown to be equivalent under a specific nega-decimation mapping.

Table 4: Classification of 16 sequences into 8 distinct classes based on nega-decimation relations.

The properties of these sequences, including their OACF values, are summarized in the initial characterizations provided in the study. For example, sequences $s_1$ through $s_4$ exhibit specific OACF value sets and even symmetry.

Table 1: Initial notation and OACF values for sequences s1 through s4.

Conclusion

The identification of nega-decimation completes the trio of OACF-preserving operations, mirroring the well-established PACF-preserving set. This discovery not only simplifies existing sequence classifications but also opens new avenues for identifying optimal signals in next-generation communication hardware. Future research will explore the applicability of nega-decimation across all known binary sequence constructions.

Summary updated

BibTeX
@inproceedings{wang2019note,
  author = {Geyang Wang and Qi Wang},
  title = {{A note on an OACF-preserving operation based on Parker's Transformation}},
  booktitle = {IWSDA},
  year = {2019},
  url = {https://openreview.net/forum?id=i3P7pfJXSq6},
}
Figure