Journal ArticleDOI
Fast discrete Fourier transform with exponentially spaced points
Reads0
Chats0
TLDR
The use of fast algorithms for evaluation of discrete Fourier transform-inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals is investigated.Abstract:
The use of fast algorithms for evaluation of discrete Fourier transform-inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals is investigated. The algorithms require order (N) arithmetic operations, rather than the order (N log(N)) required for the full FFT algorithm.read more
Citations
More filters
Journal ArticleDOI
Entropy-Based Low-Rank Approximation for Contrast Dielectric Target Detection with Through Wall Imaging System
TL;DR: A novel method based on entropy thresholding for low-rank approximation for contrast target detection is introduced and it was observed that the proposed method gives satisfactory results.
Proceedings ArticleDOI
Highly efficient signal processing for frequency agile power line communications
TL;DR: This paper presents the structure of the noncoherent optimum receiver that minimizes the number of required multiplications and memory locations and confirms the superiority of the presented algorithm over direct DFT calculation and FFT algorithm.
References
More filters
Journal Article
FFT pruning
TL;DR: It is shown that for situations in which the relative number of zero-valued samples is quite large, significant time-saving can be obtained by pruning the FFT algorithm.
Journal ArticleDOI
FFT algorithm for both input and output pruning
Thippur V. Sreenivas,P. Rao +1 more
TL;DR: It is shown that the complementary structure of the DIT and the DIF formulations makes possible the application of the pruning algorithms simultaneously at the input, as well as at the output, for either of the formulations.