Iterative algorithms to approximate canonical Gabor windows: Computational aspects

DOI10.1007/S00041-006-6069-YMaRDI QIDQ2373369zbMATH OpenOpenAlexFDO

Authors Peter Søndergaard, A. J. E. M. Janssen

Publication date 19 July 2007

Published in The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/math/0601090

zbMATH Keywords

signal samplinggabor framessignal characterization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Linear operator approximation theory (47A58) Rate of convergence, degree of approximation (41A25) Sampling theory in information and communication theory (94A20)

Abstract: In this paper 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 gamma_{k}, the frame operators S and S_{k} corresponding to (g,a,b) and (gamma_{k},a,b), respectively, and a number of scalars. The structure of the iteration step of the method is determined by the envisaged convergence order m of the method. We consider two strategies for scaling the terms in the iteration step: norm scaling, where in each step the windows are normalized, and initial scaling where we only scale in the very beginning. Norm scaling leads to fast, but conditionally convergent methods, while initial scaling leads to unconditionally convergent methods, but with possibly suboptimal convergence constants. The iterations, initially formulated for time-continuous Gabor systems, are considered and tested in a discrete setting in which one passes to the appropriately sampled-and-periodized windows and frame operators. Furthermore, they are compared with respect to accuracy and efficiency with other methods to approximate canonical windows associated with Gabor frames.

Recommendations

• Some iterative algorithms to compute canonical windows for Gabor frames
• On compactly supported dual windows of Gabor frames
• scientific article; zbMATH DE number 1111497
• Double preconditioning for Gabor frames
• Characterization and computation of canonical tight windows for Gabor frames

Cited in

(10)

• Structure of nonstationary Gabor frames and their dual systems
• Efficient algorithms for the discrete Gabor transform with a long FIR window
• Some iterative algorithms to compute canonical windows for Gabor frames
• Optimized paraunitary filter banks for time-frequency channel diagonalization
• Frames for the Solution of Operator Equations in Hilbert Spaces with Fixed Dual Pairing
• Characterization and computation of canonical tight windows for Gabor frames
• Nonstationary Gabor frames -- approximately dual frames and reconstruction errors
• Designing Gabor windows using convex optimization
• THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX
• Gabor windows supported on \([- 1, 1]\) and construction of compactly supported dual windows with optimal smoothness

Describes a project that uses

Uses Software

• ATLAS

This page was built for publication: Iterative algorithms to approximate canonical Gabor windows: Computational aspects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373369)