1999
DOI: 10.1006/acha.1999.0271
|View full text |Cite
|
Sign up to set email alerts
|

Density of Gabor Frames

Abstract: A Gabor system is a set of time-frequency shifts S(g, ) = {e

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
115
1

Year Published

2000
2000
2023
2023

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 129 publications
(122 citation statements)
references
References 9 publications
5
115
1
Order By: Relevance
“…ω ∈ G will generate a frame {T λ g} λ∈G with bounds A, B. For discrete (irregular) Gabor systems in L 2 (R n ) such questions are studied in [12]. On the other hand, totality in L 2 (G) of the set {T λ g} λ∈G is achievable for both discrete and non-discrete LCA groups G; e.g., take any g ∈ L 2 (G) withĝ(ω) = 0 for a.e.…”
Section: Proof the Implication (Ii)⇒(i) Is Trivial So We Only Have Tmentioning
confidence: 99%
“…ω ∈ G will generate a frame {T λ g} λ∈G with bounds A, B. For discrete (irregular) Gabor systems in L 2 (R n ) such questions are studied in [12]. On the other hand, totality in L 2 (G) of the set {T λ g} λ∈G is achievable for both discrete and non-discrete LCA groups G; e.g., take any g ∈ L 2 (G) withĝ(ω) = 0 for a.e.…”
Section: Proof the Implication (Ii)⇒(i) Is Trivial So We Only Have Tmentioning
confidence: 99%
“…The density result of Ramanthan and Steger [37] (as extended by Christensen, Deng and Heil [15]) is as follows:…”
Section: Theorem 32 (Homogeneous Approximation Propertymentioning
confidence: 99%
“…[20], Theorems 1.1, 3.1. For a regular Gabor system {E mb T na g} m,n∈Z the latter assumption corresponds exactly to the condition ab ≤ 1.…”
Section: Irregular Gabor Systems and Open Problemsmentioning
confidence: 99%
“…Observe that V 0 will always be a pure subspace of L 2 (R): in [20] it is proved that translates of a single function never can constitute a frame for all of L 2 (R). A sufficient condition for {V j , φ} to be an FMRA was given in [4], Theorem 4.6: Note the similarity between Theorem 5.4 and the results for an MRA; cf.…”
Section: Frame Multiresolution Analysismentioning
confidence: 99%