اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDiscrete correlation of order 2 of generalized Rudin--Shapiro sequences on alphabets of arbitrary size
57
0
0.0
(
0
)
تأليف
Pierre-Adrien Tahay
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2 in cases where the size of the alphabet is a prime number or a squarefree product of primes. We establish similar results for an even larger family of pseudorandom sequences, constructed via difference matrices, in the case of an alphabet of any size. The constructions generalize those from Grant et al. In the case where the size of the alphabet is squarefree and where there are at least two prime factors, we obtain an improvement in the error term by comparison with the result of Grant et al.
قيم البحث
اقرأ أيضاً
Sequences with low aperiodic autocorrelation and crosscorrelation are used in communications and remote sensing. Golay and Shapiro independently devised a recursive construction that produces families of complementary pairs of binary sequences. In th
e simplest case, the construction produces the Rudin-Shapiro sequences, and in general it produces what we call Golay-Rudin-Shapiro sequences. Calculations by Littlewood show that the Rudin-Shapiro sequences have low mean square autocorrelation. A sequences peak sidelobe level is its largest magnitude of autocorrelation over all nonzero shifts. H{o}holdt, Jensen, and Justesen showed that there is some undetermined positive constant $A$ such that the peak sidelobe level of a Rudin-Shapiro sequence of length $2^n$ is bounded above by $A(1.842626ldots)^n$, where $1.842626ldots$ is the positive real root of $X^4-3 X-6$. We show that the peak sidelobe level is bounded above by $5(1.658967ldots)^{n-4}$, where $1.658967ldots$ is the real root of $X^3+X^2-2 X-4$. Any exponential bound with lower base will fail to be true for almost all $n$, and any bound with the same base but a lower constant prefactor will fail to be true for at least one $n$. We provide a similar bound on the peak crosscorrelation (largest magnitude of crosscorrelation over all shifts) between the sequences in each Rudin-Shapiro pair. The methods that we use generalize to all families of complementary pairs produced by the Golay-Rudin-Shapiro recursion, for which we obtain bounds on the peak sidelobe level and peak crosscorrelation with the same exponential growth rate as we obtain for the original Rudin-Shapiro sequences.
Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence (which we cal
l the seed) by a recursive construction that doubles the length of the sequence at each step, and many sequences produced in this manner have exceptionally low aperiodic autocorrelation. Borwein and Mossinghoff showed that the asymptotic autocorrelation merit factor for any such family is at most $3$, and found the seeds of length $40$ or less that produce the maximum asymptotic merit factor of $3$. The definition of Rudin-Shapiro-like sequences was generalized by Katz, Lee, and Trunov to include sequences with arbitrary complex coefficients, among which are families of low autocorrelation polyphase sequences. Katz, Lee, and Trunov proved that the maximum asymptotic merit factor is also $3$ for this larger class. Here we show that a family of such Rudin-Shapiro-like sequences achieves asymptotic merit factor $3$ if and only if the seed is either of length $1$ or is the interleaving of a pair of Golay complementary sequences. For small seed lengths where this is not possible, the optimal seeds are interleavings of pairs that are as close as possible to being complementary pairs, and the idea of an almost-complementary pair makes sense of remarkable patterns in previously unexplained data on optimal seeds for binary Rudin-Shapiro-like sequences.
We consider the class of Rudin-Shapiro-like polynomials, whose $L^4$ norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial $f(z)=f_0+f_1 z + cdots + f_d z^d$ is identified with the sequence $(f_0,f_1,ldots,f_d)$ of
its coefficients. From the $L^4$ norm of a polynomial, one can easily calculate the autocorrelation merit factor of its associated sequence, and conversely. In this paper, we study the crosscorrelation properties of pairs of sequences associated to Rudin-Shapiro-like polynomials. We find an explicit formula for the crosscorrelation merit factor. A computer search is then used to find pairs of Rudin-Shapiro-like polynomials whose autocorrelation and crosscorrelation merit factors are simultaneously high. Pursley and Sarwate proved a bound that limits how good this combined autocorrelation and crosscorrelation performance can be. We find infinite families of polynomials whose performance approaches quite close to this fundamental limit.
Let $kappa$ be a positive real number and $minmathbb{N}cup{infty}$ be given. Let $p_{kappa, m}(n)$ denote the number of partitions of $n$ into the parts from the Piatestki-Shapiro sequence $(lfloor ell^{kappa}rfloor)_{ellin mathbb{N}}$ with at most $
m$ times (repetition allowed). In this paper we establish asymptotic formulas of Hardy-Ramanujan type for $p_{kappa, m}(n)$, by employing a framework of asymptotics of partitions established by Roth-Szekeres in 1953, as well as some results on equidistribution.
We show that a recently proposed Rudin-Shapiro-like sequence, with balanced weights, has purely singular continuous diffraction spectrum, in contrast to the well-known Rudin-Shapiro sequence whose diffraction is absolutely continuous. This answers a
question that had been raised about this new sequence.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
