Calculation of multidimensional Hartley transforms using one-dimensional Fourier transforms

DOI10.1109/78.382424MaRDI QIDQ4838233zbMATH OpenOpenAlexWikidataFDO

Authors Thomas Bortfeld, Wolfgang Dinter

Publication date 1 August 1995

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.382424

zbMATH Keywords

fast algorithmindexing schemesmultidimensional Hartley transformsone-dimensional Fourier transformsparity operators

Mathematics Subject Classification ID

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

Recommendations

• New algorithms for multidimensional discrete Hartley transform
• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
• Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
• Fast computation of the discrete Hartley transform
• scientific article; zbMATH DE number 2163930

Cited in

(3)

• Fast unified computation of the multi-dimensional discrete sinusoidal transforms
• A new multidimensional FFT based on one-dimensional decompositions
• Interpolation using Hartley transform

This page was built for publication: Calculation of multidimensional Hartley transforms using one-dimensional Fourier transforms

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