- finite-length FFT
- быстрое Фурье-преобразование конечной длины
Большой англо-русский и русско-английский словарь. 2001.
finite-length FFT
Смотреть что такое "finite-length FFT" в других словарях:
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 … Wikipedia
Window function — For the term used in SQL statements, see Window function (SQL) In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero valued outside of some chosen interval … Wikipedia
Convolution — For the usage in formal language theory, see Convolution (computer science). Convolution of two square pulses: the resulting waveform is a triangular pulse. One of the functions (in this case g) is first reflected about τ = 0 and then offset by t … Wikipedia
Wavelet — A wavelet is a mathematical function used to divide a given function or continuous time signal into different frequency components and study each component with a resolution that matches its scale. A wavelet transform is the representation of a… … Wikipedia
Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… … Wikipedia
Fourier analysis — In mathematics, Fourier analysis is a subject area which grew out of the study of Fourier series. The subject began with trying to understand when it was possible to represent general functions by sums of simpler trigonometric functions. The… … Wikipedia
Fourier — (pronEng|ˈfʊərieɪ, French pronunciation IPA2|fuʁie) may refer to:*Charles Fourier (1772–1837), a French utopian socialist thinker *Joseph Fourier (1768–1830), a French mathematician and physicist **Mathematics, physics, and engineering terms… … Wikipedia
Periodogram — The periodogram is an estimate of the spectral density of a signal. The term was coined by Arthur Schuster in 1898Schuster, A., On the investigation of hidden periodicities with application to a supposed 26 day period of meteorological phenomena … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
