A fast algorithm for adapted time-frequency tilings

DOI10.1006/ACHA.1996.0009MaRDI QIDQ1917554zbMATH OpenOpenAlexFDO

Authors Christoph Thiele, Lars F. Villemoes

Publication date 20 February 1997

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

fast algorithmfast Fourier transformWalsh functionsfinite Abelian groupsbest basis algorithmadapted time frequency tilings

Mathematics Subject Classification ID

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

Recommendations

• Tilings of the time-frequency plane: construction of arbitrary orthogonal bases and fast tiling algorithms
• Adapted bases of time-frequency local cosines.
• Fast algorithm for best anisotropic Walsh bases and relatives
• Modulated Malvar-Wilson bases
• Absolute optimal time - frequency basis - a research tool

Cited in

(11)

• Natural graph wavelet packet dictionaries
• Wedgelets: Nearly minimax estimation of edges
• Self-regulated complexity in neural networks
• A fast transform for spherical harmonics
• The norm of the Fourier transform on finite abelian groups
• Noiselets
• Examples of sets with large trigonometric sums
• The quartile operator and pointwise convergence of Walsh series
• Fast algorithm for best anisotropic Walsh bases and relatives
• eGHWT: the extended generalized Haar-Walsh transform
• Adapted bases of time-frequency local cosines.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917554)