Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 7-14 Tagen versandfertig
Veröffentlichung:	März 2026
Genre:	Schulbücher
ISBN:	9786131126291
EAN-Code:	9786131126291
Verlag:	Omniscriptum
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 220 mm / B 150 mm / D 6 mm
Gewicht:	149 gr
Seiten:	88
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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).