Recursive formulation of short-time discrete trigonometric transforms

DOI10.1109/82.663812zbMATH Open0919.94001OpenAlexW2024672858MaRDI QIDQ4221004FDOQ4221004

Authors: José Antonio Rosendo MacÍas, Antonio Gómez-Expósito 

Publication date: 9 September 1999

Published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/82.663812

Recommendations

• Windowed discrete cosine and sine transforms for shifting data
• Recursive Fourier transform algorithms with integrated windowing
• Windowed discrete Fourier transform for shifting data
• Generalized running discrete transforms

zbMATH Keywords

discrete Fourier transformdiscrete trigonometric transformmoving-window transformsshort-time transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Cited In (2)

• Recursive Fourier transform algorithms with integrated windowing
• Recursive calculation of discrete cosine transform for low resolution signal processing

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)