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...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
MDPI AG
2021-10-01
|
| Ráidu: | Signals |
| Fáttát: | |
| Liŋkkat: | https://www.mdpi.com/2624-6120/2/4/41 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|