Other Fast Algorithms for the FFT

Algorithms for the fast calculation of a discrete Fourier transform (DFT) are based on factorization of the matrix of the transform. In order to use these fast algorithms and thus to exploit to the full both the characteristics of the signals to be processed and the various technological possibiliti...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Digital Signal Processing s. 1
Hlavní autor:	Bellanger, Maurice
Médium:	Kapitola
Jazyk:	angličtina
Vydáno:	Chichester, UK Wiley 2024 John Wiley & Sons John Wiley & Sons, Ltd
Vydání:	10
Témata:	Computer Architecture Computer Hardware Engineering discrete Fourier transform Electronic Devices Electronics & Semiconductors fast Fourier transform algorithms Kronecker product lapped transforms matrix products partial transforms
ISBN:	9781394182664, 139418266X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Obsah:

3.1 Kronecker Product of Matrices 3.2 Factorizing the Matrix of a Decimation-in-Frequency Algorithm 3.3 Partial Transforms 3.4 Lapped Transform 3.5 Other Fast Algorithms 3.6 Binary Fourier Transform - Hadamard 3.7 Number-Theoretic Transforms Exercises References