Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917809279205376 |
|---|---|
| author | Katz, Daniel J. Ramirez, Miriam E. |
| author_facet | Katz, Daniel J. Ramirez, Miriam E. |
| contents | Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves, that is, the sequences must have small aperiodic autocorrelation at every nonzero shift. If $f$ is a sequence, then the demerit factor of $f$ is the sum of the squared magnitudes of the autocorrelations at all nonzero shifts for the sequence obtained by normalizing $f$ to unit Euclidean norm. The demerit factor is the reciprocal of Golay's merit factor, and low demerit factor indicates low self-similarity of a sequence under translation. We endow the $2^\ell$ binary sequences of length $\ell$ with uniform probability measure and consider the distribution of their demerit factors. Earlier works used combinatorial techniques to find exact formulas for the mean, variance, skewness, and kurtosis of the distribution as a function of $\ell$. These revealed that for $\ell \geq 4$, the $p$th central moment of this distribution is strictly positive for every $p \geq 2$. This article shows that for every $p$, the $p$th central moment is $\ell^{-2 p}$ times a quasi-polynomial function of $\ell$ with rational coefficients. It also shows that, in the limit as $\ell$ tends to infinity, the $p$th standardized moment is the same as that of the standard normal distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_14566 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences Katz, Daniel J. Ramirez, Miriam E. Information Theory Discrete Mathematics Signal Processing Combinatorics Probability 60C05, 94A55, 05A99, 05A18, 05E18 Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves, that is, the sequences must have small aperiodic autocorrelation at every nonzero shift. If $f$ is a sequence, then the demerit factor of $f$ is the sum of the squared magnitudes of the autocorrelations at all nonzero shifts for the sequence obtained by normalizing $f$ to unit Euclidean norm. The demerit factor is the reciprocal of Golay's merit factor, and low demerit factor indicates low self-similarity of a sequence under translation. We endow the $2^\ell$ binary sequences of length $\ell$ with uniform probability measure and consider the distribution of their demerit factors. Earlier works used combinatorial techniques to find exact formulas for the mean, variance, skewness, and kurtosis of the distribution as a function of $\ell$. These revealed that for $\ell \geq 4$, the $p$th central moment of this distribution is strictly positive for every $p \geq 2$. This article shows that for every $p$, the $p$th central moment is $\ell^{-2 p}$ times a quasi-polynomial function of $\ell$ with rational coefficients. It also shows that, in the limit as $\ell$ tends to infinity, the $p$th standardized moment is the same as that of the standard normal distribution. |
| title | Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences |
| topic | Information Theory Discrete Mathematics Signal Processing Combinatorics Probability 60C05, 94A55, 05A99, 05A18, 05E18 |
| url | https://arxiv.org/abs/2307.14566 |