Fast DFT Computation for Signals with Structured Support

Suppose an N -length signal has known frequency support of size k . Given access to samples of this signal, how fast can we compute the DFT? The answer to this question depends on the structure of the frequency support. We first identify some frequency supports for which (an ideal) O ( k log k ) com...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2024-02, Vol.70 (2), p.1-1
Hauptverfasser:	Pochimireddy, Charantej Reddy, Siripuram, Aditya, Osgood, Brad
Format:	Artikel
Sprache:	eng
Schlagworte:	Additives algorithm design and analysis Algorithms Approximation algorithms Arithmetic combinatorial mathematics Complexity Complexity theory Computation computational efficiency Discrete Fourier transforms fast Fourier transforms Indexes Signal processing algorithms signal reconstruction signal sampling
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!