The approximating capability of fast forms

DOI10.1007/BF01200788zbMath0945.47006OpenAlexW1998903557MaRDI QIDQ1971592

Wei Liu, William A. Porter

Publication date: 7 February 2001

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01200788

zbMATH Keywords

fast forms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Efficient computation of the discrete pseudo-Wigner distribution
• A fast recursive algorithm for the discrete sine transform
• The Fast Hartley Transform Algorithm
• Kronecker products and matrix calculus in system theory
• Kronecker Products, Unitary Matrices and Signal Processing Applications
• Fast discrete extrapolation via the fast Hartley transform

This page was built for publication: The approximating capability of fast forms