• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.583-590
• /
• 2008

In this article, we focuss on. sequences of polynomials with {$\pm1$} coefficients constructed by recursive argument that is known as Rudin-Shapiro polynomials. The asymptotic behavior of these polynomials defines as the ratio of their 2q-norm with 2-norm to be dominated by some number depending on q or "the best" by an absolute constant. In this work we first show the conjecture holds for some finite numbers of m and then introduce a technique that give the result for any positive odd integer m whenever it holds for all pervious even numbers.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.301-310
• /
• 2005

The coefficients of the Rudin-Shapiro polynomials are $\pm1$. In this paper we first replace-1 coefficient by 0 which on that case the structure of the coefficients will be on base 2. Then using the results obtained for the numbers on base 2, we introduce a quite fast algorithm to calculate the autocorrelation coefficients. Main facts: Regardless of frequencies, finding the autocorrelations of those polynomials on which their coefficients lie in the unit disk has been a telecommunication's demand. The Rudin-Shapiro polynomials have a very special form of coefficients that allow us to use 'Machine language' for evaluating these values.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.39-46
• /
• 1997

Given to be the $m^{th}$ correlation coefficient of the Rudin-Shapiro polynomials of degrees $2^n-1$, $$\mid$a_m$\mid$ \leq C(2^n)^{\frac{3}{4}}$ and there exists $\kappa \neq 0$ such that $$\mid$a_{\kappa}$\mid$ ＞D(2^n)^{0.73}$ (C and D are universal constants). Here we show that the 0.73 is optimal in the upper vound case.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.235-240
• /
• 1998

Given a Unimodular polynomial P of degree N$\geq$1, the exteremal problem for ${\gamma}$ =max{｜P(eit)｜:0 $\leq$t$\leq$2$\pi$} satisfies ${\gamma}$$\leq$C{{{{ SQRT { N+1} where C is a universal constant. Here we show that C < 2+{{{{ whenever N is fixed and P has the coefficients of a Rudin-Shapiro polynomial.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.973-981
• /
• 2008

In this paper we focus on a type of Unimodular polynomial pair used for digital systems and present some new properties of them which lead us to estimation of their autocorrelation coefficients and the moments of a Rudin-Shapiro polynomial product. Some new results on the Rudin-shapiro sequences will be presented in the last section. Main Facts: For positive integers M and n with $M\;<\;2^n$ - 1, consider the $2^n$ - M numbers ${\epsilon}_k$ ($M\;{\leq}\;k\;{\leq}\;2^n$ - 1) which form a collection of Rudin-Shapiro coefficients. We verify that $|{\sum}_{k=M}^{2^{n-1}}\;{{\epsilon}_k}e^{ikt}|$ is dominated by $(2+\sqrt{2})\;\sqrt {2^n-M}-{\sqrt{2}}$.