This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
This paper will show an alternative method to compute the two-dimensional Discrete Fourier Transform. While current GPU Fourier transform libraries need a large buffer for storing ...
Daniel Kauker, Harald Sanftmann, Steffen Frey, Tho...
Multi-dimensional (MD) Discrete Fourier Transform (DFT) is a key kernel algorithm in many signal processing algorithms, including radar data processing and medical imaging. Althou...
Chi-Li Yu, Chaitali Chakrabarti, Sungho Park, Vija...
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on the spectrog...
Various types of moments have been used to recognize image patterns in a number of applications. However, only few works have paid attention to the completeness property of the in...
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
A novel system, called the oscillator system, consisting of order of p 3 functions (signals) on the finite field p; with p an odd prime, is described and studied. The new functions...