New fast discrete Hartley transform algorithm

DOI10.1049/EL:19910220MaRDI QIDQ3201725zbMATHOpenAlexFDO

Authors

Publication date 1991

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19910220

zbMATH Keywords

discrete Fourier transformdiscrete Hartley transformnew algorithmminimum number of additionsminimum number of multiplications

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast computation of the discrete Hartley transform
• New algorithms for multidimensional discrete Hartley transform
• A new structure for the running discrete Hartley transform
• scientific article; zbMATH DE number 3926793
• A new algorithm to compute the discrete cosine Transform

Cited in

(6)

• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
• Fast computation of the discrete Hartley transform
• A new structure for the running discrete Hartley transform
• Fast algorithm for discrete fractional Hadamard transform
• scientific article; zbMATH DE number 3926793 (Why is no real title available?)
• The Fast Hartley Transform Algorithm

This page was built for publication: New fast discrete Hartley transform algorithm

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