2007
DOI: 10.1007/s00041-006-6069-y
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Algorithms to Approximate Canonical Gabor Windows: Computational Aspects

Abstract: ABSTRACT. In this article we investigate the computational aspects of some recently proposed iterative methods for approximating the canonical tight and canonical dual window of a Gabor frame (g, a, b). The iterations start with the window g while the iteration steps comprise the window g, the k th iterand γ k , the frame operators S and S k corresponding to (g, a, b)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 19 publications
(21 citation statements)
references
References 34 publications
0
21
0
Order By: Relevance
“…The function gabdualnorm will return the maximal reconstruction error of any signal when using the pair g, γ as windows for analysis and synthesis. 8,32 In particular for two windows that generate dual Gabor systems, the numerical precision is returned.…”
Section: Dual/tight Windowsmentioning
confidence: 99%
“…The function gabdualnorm will return the maximal reconstruction error of any signal when using the pair g, γ as windows for analysis and synthesis. 8,32 In particular for two windows that generate dual Gabor systems, the numerical precision is returned.…”
Section: Dual/tight Windowsmentioning
confidence: 99%
“…For simplicity we only construct the minimal factor, that L min has to be multiplied with, as stated in (23).…”
Section: Further Optimizationmentioning
confidence: 99%
“…Instead, they must be computed using a translated and modulated window function w(t), the analysis window, such that cm,n = <ir , wm,n> [75]- [80]. This window must satisfy the biorthonormality condition: …”
Section: Choice Of the Lattice Parameters T ωmentioning
confidence: 99%