Discrete multiwindow Gabor-type transforms (Q4355503)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1063813
Language Label Description Also known as
default for all languages
No label defined
    English
    Discrete multiwindow Gabor-type transforms
    scientific article; zbMATH DE number 1063813

      Statements

      Discrete multiwindow Gabor-type transforms (English)
      0 references
      11 June 1998
      0 references
      discrete multiwindow Gabor-type transforms
      0 references
      frames
      0 references
      generalized inverses
      0 references
      signal reconstruction
      0 references
      discrete-time signals
      0 references
      discrete Fourier transform
      0 references
      algorithms
      0 references
      complexity
      0 references
      The continuous Gabor transform was previously generalized by the authors to incorporate several window functions [Appl. Comput. Harmon. Anal. 4, No. 2, 188-221, Art. No. A970209 (1997; Zbl 0885.42024)]. This paper examines the discrete-finite case of the multiwindow Gabor scheme. For \(L\)-periodic, discrete-time signals \(f\) with \(L= N'M= M'N\) \((M,N\in\mathbb{N})\), the authors propose the representation scheme \[ f(j)= \sum^{R-1}_{r=0} \sum^{M- 1}_{m=0} \sum^{N- 1}_{n= 0} c_{r,m,n} g_{r,m,n}(j), \] \[ g_{r,m,n}(j):= g_r(j- mN') e^{2\pi i{jn\over N}}. \] They analyze the properties of the sequence of representation functions \(\{g_{r,m,n}\}\). Further, they present discrete Fourier transform based algorithms, including complexity analysis, for the calculation of the expansion coefficients and for the reconstruction of the signal in both signal and transform domains. An example illustrates the advantages of the multiwindow scheme over the single-window scheme.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references