A Sparse Algorithm for Computing the DFT Using Its Real Eigenvectors

Direct computation of the discrete Fourier transform (DFT) and its FFT computational algorithms requires multiplication (and addition) of complex numbers. Complex number multiplication requires four real-valued multiplications and two real-valued additions, or three real-valued multiplications and f...

Description complète

Détails bibliographiques

Auteurs principaux:	Rajesh Thomas, Victor DeBrunner, Linda S. DeBrunner
Format:	Artigo
Langue:	Inglês
Publié:	MDPI AG 2021-10-01
Collection:	Signals
Sujets:	discrete fourier transform DFT eigenvectors harmonic analysis
Accès en ligne:	https://www.mdpi.com/2624-6120/2/4/41
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!