HOME

TheInfoList



OR:

The Fourier operator is the
kernel Kernel may refer to: Computing * Kernel (operating system), the central component of most operating systems * Kernel (image processing), a matrix used for image convolution * Compute kernel, in GPGPU programming * Kernel method, in machine learnin ...
of the Fredholm integral of the first kind that defines the
continuous Fourier transform In mathematics, the Fourier transform (FT) is an integral transform that takes a function (mathematics), function as input then outputs another function that describes the extent to which various Frequency, frequencies are present in the origin ...
, and is a two-dimensional function when it corresponds to the Fourier transform of one-dimensional functions. It is complex-valued and has a constant (typically unity) magnitude everywhere. When depicted, e.g. for teaching purposes, it may be visualized by its separate real and imaginary parts, or as a colour image using a colour wheel to denote phase. It is usually denoted by a capital letter "F" in script font (\mathcal), e.g. the Fourier transform of a function g(t) would be written using the operator as \mathcalg(t). It may be thought of as a limiting case for when the size of the
discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced Sampling (signal processing), samples of a function (mathematics), function into a same-length sequence of equally-spaced samples of the discre ...
increases without bound while its spatial resolution also increases without bound, so as to become both continuous and not necessarily periodic.


Visualization

The Fourier operator defines a continuous two-dimensional function that extends along time and frequency axes, outwards to infinity in all four directions. This is analogous to the
DFT matrix In applied mathematics, a DFT matrix is a ''square matrix'' as an expression of a discrete Fourier transform (DFT) as a transformation matrix, which can be applied to a signal through matrix multiplication. Definition An ''N''-point DFT is expres ...
but, in this case, is continuous and infinite in extent. The value of the function at any point is such that it has the same magnitude everywhere. Along any fixed value of time, the value of the function varies as a complex exponential in frequency. Likewise along any fixed value of frequency the value of the function varies as a complex exponential in time. A portion of the infinite Fourier operator is shown in the illustration below. Any slice parallel to either of the axes, through the Fourier operator, is a complex exponential, i.e. the real part is a cosine wave and the imaginary part is a sine wave of the same frequency as the real part. Diagonal slices through the Fourier operator give rise to chirps. Thus rotation of the Fourier operator gives rise to the
fractional Fourier transform In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to the ''n''-th power, where ''n' ...
, which is related to the
chirplet transform In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.S. Mann and S. Haykin,The Chirplet transform: A generalization of Gabor's logon transform, ''Proc. Vision In ...
.Shi, J., Zheng, J., Liu, X., Xiang, W., & Zhang, Q. (2020). Novel Short-Time Fractional Fourier Transform: Theory, Implementation, and Applications. IEEE Transactions on Signal Processing, 68, 3280-3295.


See also

*
Least-squares spectral analysis Least-squares spectral analysis (LSSA) is a method of estimating a Spectral density estimation#Overview, frequency spectrum based on a least-squares fit of Sine wave, sinusoids to data samples, similar to Fourier analysis. Fourier analysis, the ...


References

{{reflist Fourier analysis Integral transforms Unitary operators