scispace - formally typeset
Search or ask a question
Topic

Non-uniform discrete Fourier transform

About: Non-uniform discrete Fourier transform is a research topic. Over the lifetime, 4067 publications have been published within this topic receiving 123952 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In an algorithm proposed here, DFT coefficients are computed via the Walsh transform (WT), which is superior to the fast Fourier transform (FFT) approach in applications where L is relatively small compared with N.
Abstract: This paper presents a new computational algorithm for the discrete Fourier transform (DFT). In an algorithm proposed here, DFT coefficients are computed via the Walsh transform (WT). The number of multiplications required by the new algorithm is approximately NL/6, where N is the number of data points and L is the number of Fourier coefficients desired. As such, it is superior to the fast Fourier transform (FFT) approach in applications where L is relatively small compared with N. It is also useful in cases where the Walsh and Fourier coefficients are both desired.

44 citations

Journal ArticleDOI
TL;DR: The fast Fourier transform is considered to owe its speed to the fact that a certain matrix, none of whose elements is zero, can be factored into matrices with very many zeros as mentioned in this paper.
Abstract: The fast Fourier transform is considered to owe its speed to the fact that a certain matrix, none of whose elements is zero, can be factored into matrices with very many zeros. This paper describes and discusses a procedure for explicitly carrying out such a factorization.

44 citations

01 Jan 2006
TL;DR: The definition of LCT and some special cases are given at first, followed by its properties as listed, and the discrete linear canonical transform is introduced.
Abstract: As an emerging tool for signal processing,the linear canonical transform(LCT) proves itself to be more general and flexible than the Fourier transform as well as the fractional Fourier transform.So it can slove problems that can't be dealt with well by the latter.In this paper,the definition of LCT and some special cases are given at first,followed by its properties as listed.Besides,the discrete linear canonical transform is introduced.The implication of LCT is illustrated finally,displaying(LCT's) potentials and capabilities in the field of signal processing.

44 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
88% related
Image processing
229.9K papers, 3.5M citations
81% related
Feature extraction
111.8K papers, 2.1M citations
80% related
Robustness (computer science)
94.7K papers, 1.6M citations
79% related
Pixel
136.5K papers, 1.5M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202318
202233
20213
20201
20191
20189