Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Conferences
Computing the Discrete Fourier Transform of signals with spectral frequency support
P.C. Reddy
,
V.S.S.P. Tej
,
Aditya Siripuram
,
B. Osgood
Published in Institute of Electrical and Electronics Engineers Inc.
2021
DOI:
10.1109/ISIT45174.2021.9518104
Volume: 2021-July
Pages: 2381 - 2386
Abstract
We consider the problem of finding the Discrete Fourier Transform (DFT) of N-length signals with known frequency support of size k. When N is a power of 2 and the frequency support is a spectral set, we provide an O(k\log k) algorithm to compute the DFT. Our algorithm uses some recent characterizations of spectral sets and is a generalization of the standard radix-2 algorithm. © 2021 IEEE.
Request full-text
Cite
Content may be subject to copyright.
Figures & Tables (4)
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
IEEE International Symposium on Information Theory - Proceedings
Publisher
Data powered by Typeset
Institute of Electrical and Electronics Engineers Inc.
ISSN
21578095
Authors (1)
Aditya Siripuram
Department of Electrical Engineering
Recent publications
On the k-coverage of line segments by a non homogeneous Poisson-Boolean model
LP relaxations and Fuglede's conjecture
A channel coding perspective of collaborative filtering
Fast DFT computation for signals with spectral support
Get all the updates for this publication
Follow