Recursive formulation of short-time discrete trigonometric transforms (Q4221004)

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 1234034
Language Label Description Also known as
default for all languages
No label defined
    English
    Recursive formulation of short-time discrete trigonometric transforms
    scientific article; zbMATH DE number 1234034

      Statements

      Recursive formulation of short-time discrete trigonometric transforms (English)
      0 references
      9 September 1999
      0 references
      discrete trigonometric transform
      0 references
      moving-window transforms
      0 references
      short-time transforms
      0 references
      discrete Fourier transform
      0 references
      Moving-window transforms, also called short-time transforms, are useful, when a nonstationary input signal must be continuously transformed. The moving-window discrete Fourier transform of a signal \(x(j)\) is defined by \(DFT_n(k): =\sum^{N-1}_{j=0} x(j+n-N+1) w^{jk}_N\) with \(w_N: =\exp (-2\pi i/N)\). Based on the recursive formula \[ DFT_n(k)= \bigl( DFT_{n-1} (k)+x(n)- x(n-N)\bigr) w_N^{-k}, \] the authors present second-order recursive formulas for moving-window discrete cosine/sine/ Hartley transforms.
      0 references

      Identifiers