2014
DOI: 10.1109/tsp.2014.2366719
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Discrete Fractional Fourier Transform and Its Applications

Abstract: Abstract-The discrete fractional Fourier transform is a powerful signal processing tool with broad applications for nonstationary signals. In this paper, we propose a sparse discrete fractional Fourier transform (SDFrFT) algorithm to reduce the computational complexity when dealing with large data sets that are sparsely represented in the fractional Fourier domain. The proposed technique achieves multicomponent resolution in addition to its low computational complexity and robustness against noise. In addition… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
72
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 135 publications
(72 citation statements)
references
References 38 publications
0
72
0
Order By: Relevance
“…In the sparse representation process of ultrasonic phased array signal, the signal will be projected onto the orthogonal transform matrix. The commonly used orthogonal transform basis includes the discrete cosine transform basis, Fourier transform basis, wavelet basis, and curvelet basis [12][13][14][15].…”
Section: Reconstruction Of Ultrasonic Phased Array Signalmentioning
confidence: 99%
See 1 more Smart Citation
“…In the sparse representation process of ultrasonic phased array signal, the signal will be projected onto the orthogonal transform matrix. The commonly used orthogonal transform basis includes the discrete cosine transform basis, Fourier transform basis, wavelet basis, and curvelet basis [12][13][14][15].…”
Section: Reconstruction Of Ultrasonic Phased Array Signalmentioning
confidence: 99%
“…Discrete Fourier transform (DFT) is a method that transforms the finite time domain data into the frequency domain data [13]. When a discrete time signal x n n = 0, 1, … , N − 1 with N sequence values is given, the following transform is the discrete Fourier transform of x n :…”
Section: Reconstruction Of Ultrasonic Phased Array Signalmentioning
confidence: 99%
“…According to the literature [10], the equation (4) is processed by a Fourier transform. We can obtain the fractional lower-order power spectrum of random signal p xy P .…”
Section: A Doppler Estimationmentioning
confidence: 99%
“…Since DFrFT can transform a function to any intermediate domain between time and frequency domains, it exhibits superior capability to concentrate LFM signals with no effect from cross-terms. The continuous fractional Fourier transform is defined as (12), shown on the top of the page, where u denotes the fractional Fourier domain frequency, D is an integer, α denotes the rotation angle, and the phase of √ 1−j cot α is constrained in the range of (−π/4, π/4).…”
Section: Proposed Parameter Estimation Algorithmmentioning
confidence: 99%