Fast DFT computation for signals with spectral support

Charantej Reddy, P. and Prabhu Tej, V.S.S. and Siripuram, A. (2021) Fast DFT computation for signals with spectral support. In: 27th National Conference on Communications, NCC 2021, 27 July 2021 through 30 July 2021, Virtual, Kanpur.

Full text not available from this repository. (Request a copy)


We consider the problem of computing the Discrete Fourier transform (DFT) of an N- length signal which has only k non-zero DFT coefficients at known locations. We say that a set of indices is spectral if there exists a DFT submatrix (square) with those columns that is unitary up to scaling. When the DFT support set is spectral and N is a prime power, we prove that this can be done in O(klogk) operations using k samples provided the DFT support. This is a generalization of a similar recent result for the case when N is a power of 2. © 2021 IEEE.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Siripuram, Aditya
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: DFT, SFFT, Spectral sets
Subjects: Electrical Engineering
Divisions: Department of Electrical Engineering
Depositing User: Mrs Haseena VKKM
Date Deposited: 26 Apr 2022 05:12
Last Modified: 26 Apr 2022 05:12
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 9249 Statistics for this ePrint Item