2019
DOI: 10.1016/j.acha.2017.07.005
|View full text |Cite
|
Sign up to set email alerts
|

The fast Slepian transform

Abstract: The discrete prolate spheroidal sequences (DPSS's) provide an efficient representation for discrete signals that are perfectly timelimited and nearly bandlimited. Due to the high computational complexity of projecting onto the DPSS basis -also known as the Slepian basis -this representation is often overlooked in favor of the fast Fourier transform (FFT). We show that there exist fast constructions for computing approximate projections onto the leading Slepian basis elements. The complexity of the resulting al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 34 publications
(36 citation statements)
references
References 35 publications
0
36
0
Order By: Relevance
“…Slepian [4] first provided an asymptotic expression for the DPSS eigenvalues. In [16], we recently provided a non-asymptotic result for the distribution of the DPSS eigenvalues (which improves upon a previous result in [9]). …”
Section: Introductionmentioning
confidence: 63%
“…Slepian [4] first provided an asymptotic expression for the DPSS eigenvalues. In [16], we recently provided a non-asymptotic result for the distribution of the DPSS eigenvalues (which improves upon a previous result in [9]). …”
Section: Introductionmentioning
confidence: 63%
“…Consequently, it can be shown [2] [2,13,16,17].) For any W ∈ (0, 1 2 ), N ∈ N, and ∈ (0, 1 2 ), we have…”
Section: Definitionsmentioning
confidence: 97%
“…Unfortunately, unlike the DFT which can be computed efficiently with the FFT algorithm, there exists no algorithm that can efficiently compute the DPSS representation for a very large signal. Recently, we proposed [16] a fast Slepian transform (FST), a fast method for computing approximate projections onto the leading DPSS vectors and compressing a signal to the corresponding low dimension. Despite its favorable properties, the fast algorithm presented in [16] did not correspond to an orthogonal projection.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It makes sense only if ε is not too small. Recently, in [11], the authors have given the following asymptotic estimate of N (W, ε), which is valid for small values of ε,…”
Section: The Spectrum Associated With the Dpswf's: Behaviour And Decamentioning
confidence: 99%