Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning

DOI10.4310/CIS.2005.V5.N1.A2zbMATH Open1140.65375OpenAlexW2008914219MaRDI QIDQ820192FDOQ820192

Stefano Serra Capizzano, Manfred Tasche, Antonio Arico

Publication date: 6 April 2006

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.cis/1149698472

Recommendations

• On a Matrix Algebra Related to the Discrete Hartley Transform
• Fast and numerically stable algorithms for discrete cosine transforms
• scientific article; zbMATH DE number 7607907
• The Fast Hartley Transform Algorithm
• Fast computation of the discrete Hartley transform

Mathematics Subject Classification ID

Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (4)

• A discrete Hartley transform based on Simpson's rule
• Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms
• Hartley-type algebras in displacement and optimization strategies.
• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms

This page was built for publication: Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning

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