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

DOI10.4310/CIS.2005.V5.N1.A2MaRDI QIDQ820192zbMATH OpenOpenAlexFDO

Authors Antonio Arico, Stefano Serra Capizzano, Manfred Tasche

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

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)

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

Cited in

(4)

• A discrete Hartley transform based on Simpson's rule
• Hartley-type algebras in displacement and optimization strategies.
• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
• Lowest complexity self-recursive radix-2 DCT II/III algorithms

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)