Related papers: The inverse cyclotomic Discrete Fourier Transform …

We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…

Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…

A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast…

This work is a follow up on the newly proposed clustering algorithm called The Inverse Square Mean Shift Algorithm. In this paper a special case of algorithm for dealing with non-homogenous data is formulated and the three dimensional Fast…

As a generalization of the Fourier transform, the fractional Fourier transform was introduced and has been further investigated both in theory and in applications of signal processing. We obtain a sampling theorem on shift-invariant spaces…

We extend the theorem of Liouville on integration in finite terms to include dilogarithmic integrals. The results provide a necessary and sufficient condition for an element of the base field to have an antiderivative in a field extension…

In this paper, we establish a general discrete Fourier restriction theorem. As an application, we make some progress on the discrete Fourier restriction associated with KdV equation.

Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…

We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…

Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…

In this note, we present a new proof that the cyclotomic integers constitute the full ring of integers in the cyclotomic field.

Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.

A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

We show that the quantum Fourier transform on finite fields used to solve query problems is a special case of the usual quantum Fourier transform on finite abelian groups. We show that the control/target inversion property holds in general.…

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

In this essay, we see how prime cyclotomic fields (cyclotomic fields obtained by adjoining a primitive p-th root of unity to Q, where p is an odd prime) can lead to elegant proofs of number theoretical concepts. We namely develop the notion…

A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other…