A Sparse Algorithm for Computing the DFT Using Its Real Eigenvectors

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

Full description

Bibliographic Details
Main Authors: Rajesh Thomas, Victor DeBrunner, Linda S. DeBrunner
Format: Article
Language:English
Published: MDPI AG 2021-10-01
Series:Signals
Subjects:
discrete fourier transform
DFT eigenvectors
harmonic analysis
Online Access:https://www.mdpi.com/2624-6120/2/4/41

Internet

https://www.mdpi.com/2624-6120/2/4/41

Similar Items