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

Full description

Bibliographic Details

Published in:	Digital Signal Processing p. 1
Main Author:	Bellanger, Maurice
Format:	Book Chapter
Language:	English
Published:	Chichester, UK Wiley 2024 John Wiley & Sons John Wiley & Sons, Ltd
Edition:	10
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!