Effective approach to calculate analysis window in infinite discrete Gabor transform

DOI10.1155/2018/9039240MaRDI QIDQ1649538zbMATH OpenOpenAlexWikidataFDO

Authors Rui Li, Yong Huang, Jiabao Liu

Publication date 6 July 2018

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/9039240

zbMATH Keywords

analysis windowfast discrete Fourier transform (FFT)long-periodic/infinite discrete Gabor transform (DGT)synthesis window

Mathematics Subject Classification ID

Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Other transformations of harmonic type (42C20)

Review text

Summary: The long-periodic/infinite Discrete Gabor Transform (DGT) is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT). The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.

Recommendations

• Efficient algorithms for the discrete Gabor transform with a long FIR window
• A sparse analysis window for discrete Gabor transform
• Finite real-valued discrete Gabor transform with multi-windows
• Discrete multiwindow Gabor-type transforms
• Fast algorithms for generalized discrete Gabor expansions

Cites work

• A necessary and sufficient condition for dual Weyl-Heisenberg frames to be compactly supported
• A sparse analysis window for discrete Gabor transform
• Discrete Fourier-Invariant Signals: Design and Application
• Discrete Gabor transform
• Efficient algorithms for the discrete Gabor transform with a long FIR window
• Gabor dual spline windows
• Gabor frames by sampling and periodization
• scientific article; zbMATH DE number 1111497 (Why is no real title available?)
• Multiwindow Real-Valued Discrete Gabor Transform and Its Fast Algorithms
• Optimal biorthogonal functions for finite discrete-time gabor expansion
• Oversampling in the Gabor scheme
• Pairs of dual Gabor frame generators with compact support and desired frequency localization
• Parallel lattice structure of block time-recursive generalized Gabor transforms
• Sparse dual frames and dual Gabor functions of minimal time and frequency supports
• Toeplitz and Circulant Matrices: A Review

Cited in

(3)

• On a novel critically-sampled discrete-time real Gabor transform
• A sparse analysis window for discrete Gabor transform
• Efficient algorithms for the discrete Gabor transform with a long FIR window

This page was built for publication: Effective approach to calculate analysis window in infinite discrete Gabor transform

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