Andere Kunden interessierten sich auch für
![Split-radix FFT Algorithm]( "Split-radix FFT Algorithm")
Split-radix FFT Algorithm22,99 €![Spread Option Valuation in Ornstein-Uhlenbeck Type SV Models]( "Spread Option Valuation in Ornstein-Uhlenbeck Type SV Models")
Spread Option Valuation in Ornstein-Uhlenbeck Type SV Models36,99 €![Different Fourier Transforms and Their Applications]( "Different Fourier Transforms and Their Applications")
Different Fourier Transforms and Their Applications30,99 €![Signale und Spektren]( "Signale und Spektren")
Signale und Spektren49,00 €![Symmetric-key Algorithm]( "Symmetric-key Algorithm")
Symmetric-key Algorithm22,99 €![Verhoeff Algorithm]( "Verhoeff Algorithm")
Verhoeff Algorithm29,99 €![Schreier Sims Algorithm]( "Schreier Sims Algorithm")
Schreier Sims Algorithm22,99 €
High Quality Content by WIKIPEDIA articles! Rader's algorithm (1968) is a fast Fourier transform (FFT) algorithm that computes the discrete Fourier transform (DFT) of prime sizes by re-expressing the DFT as a cyclic convolution. (The other algorithm for FFTs of prime sizes, Bluestein's algorithm, also works by rewriting the DFT as a convolution.) Since Rader's algorithm only depends upon the periodicity of the DFT kernel, it is directly applicable to any other transform (of prime order) with a similar property, such as a number-theoretic transform or the discrete Hartley transform. The algorithm can be modified to gain a factor of two savings for the case of DFTs of real data, using a slightly modified re-indexing/permutation to obtain two half-size cyclic convolutions of real data (Chu & Burrus, 1982); an alternative adaptation for DFTs of real data, using the discrete Hartley transform, was described by Johnson & Frigo (2007).