منابع مشابه
Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-d...
متن کاملFast algorithms for 2-D circular convolutions and number theoretic transforms based on polynomial transforms over finite rings
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D number theoretic transforms (NTT). These new algorithms, which offer improved computational complexity, are constructed based on polynomial transforms over 2, ; these transforms are Fourier-like transforms over Z1,[.r], which is the integral domain of polynomial forms over Z,. Having defined such polynom...
متن کاملApplications of Generalized Convolutions Associated with the Fourier and Hartley Transforms
In this paper we present new generalized convolutions with weight-function associated with the Fourier and Hartley transforms, and consider applications. Namely, using the generalized convolutions, we construct normed rings on the space L(R), provide the sufficient and necessary condition for the solvability of a class of integral equations of convolution type, and receive the explicit solution...
متن کاملMore zeros of krawtchouk polynomials
Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families in q are found for the degree three polynomials. The techniques used are from elementary...
متن کاملNew Bounds for Hahn and Krawtchouk Polynomials
For the Hahn and Krawtchouk polynomials orthogonal on the set {0, . . . , N} new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval [0, N ]) by their va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Sciences
سال: 2018
ISSN: 1664-3607,1664-3615
DOI: 10.1007/s13373-018-0132-2