Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...

Wavelet transformation is one of the most practical mathematical transformations in the field of image processing, especially image and signal processing. Depending on the nature of the multiresolution analysis, Wavelet transformation become more accessible and powerful tools. In this paper, we refer to the mathematical foundations of this transformation.   Introduction: The...

We study the Fourier-Mukai transform for holonomic D-modules on complex abelian varieties. Among other things, we show that the cohomology support loci of a holonomic D-module are finite unions of linear subvarieties, which go through points of finite order for objects of geometric origin; that the standard t-structure on the derived category of holonomic complexes corresponds, under the Fourie...

In quantum mechanics, the Fourier Transform commonly converts from position space to momentum. For finite dimensional Hilbert spaces, the analog is the discrete (or quantum) Fourier transform, which has many applications in quantum information theory. We explore applications of this discrete Fourier transform to the elementary particle generations, and then present a related and elegant new par...

Some orthogonal polynomial systems are mapped onto each other by the Fourier transform. The best-known example of this type is the Hermite functions, i.e., the Hermite polynomials multiplied by exp(−x2/2), which are eigenfunctions of the Fourier transform. In this paper, we introduce two new examples of finite systems of this type and obtain their orthogonality relations. We also estimate a com...

Uncertainty principles for functions defined on finite Abelian groups generally relate the cardinality of a function to the cardinality of its Fourier transform. We examine how the cardinality of a function is related to the cardinality of its short–time Fourier transform. We illustrate that for some cyclic groups of small order, both, the Fourier and the short–time Fourier case, show a remarka...

Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of cyclic groups. In this regard, we introduce a generalization of the previous investigations to the case of finite groups, abelian or not. We make clear the p...

A major application of the FFT is fast convolution or fast ltering where the DFT of the signal is multiplied term-by-term by the DFT of the impulse (helps to be doing nite impulse response (FIR) ltering) and the time-domain output is obtained by taking the inverse DFT of that product. What is less well-known is the DFT can be calculated by convolution. There are several di erent approaches to t...

In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of n elements over a finite field GF(pm) with a number of bit operations 0(nm log(nm) ■ P(q)) where P(q) is the number of bit operations required to multiply two q-bit integers and q = 2 log2« + 4 log2m + 4 log2p. This method is uniformly applicable to all instances and its order of complexity is...