A fast algorithm for adapted time-frequency tilings

DOI10.1006/ACHA.1996.0009zbMath0857.65148OpenAlexW1978691304MaRDI QIDQ1917554

Lars F. Villemoes, Christoph Thiele

Publication date: 20 February 1997

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/acha.1996.0009

zbMATH Keywords

Walsh functionsfast Fourier transformfinite Abelian groupsfast algorithmbest basis algorithmadapted time frequency tilings

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Finite abelian groups (20K01) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (9)

eGHWT: the extended generalized Haar-Walsh transform ⋮ Natural graph wavelet packet dictionaries ⋮ Self-regulated complexity in neural networks ⋮ The norm of the Fourier transform on finite abelian groups ⋮ Fast algorithm for best anisotropic Walsh bases and relatives ⋮ Noiselets ⋮ Wedgelets: Nearly minimax estimation of edges ⋮ A fast transform for spherical harmonics ⋮ The quartile operator and pointwise convergence of Walsh series

This page was built for publication: A fast algorithm for adapted time-frequency tilings