Recursive formulation of short-time discrete trigonometric transforms
From MaRDI portal
Publication:4221004
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.
Recommendations
Cited in
(2)
This page was built for publication: Recursive formulation of short-time discrete trigonometric transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221004)