The Fast Hartley Transform Algorithm
From MaRDI portal
Recommendations
- Fast computation of the discrete Hartley transform
- New fast discrete Hartley transform algorithm
- Fast Hankel transform algorithm
- scientific article; zbMATH DE number 3951888
- Fast Walsh–Hadamard–Fourier Transform Algorithm
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- scientific article; zbMATH DE number 2163930
- Moment-based fast discrete Hartley transform
- Conversion of FFT’s to Fast Hartley Transforms
Cited in
(37)- Natural-ordered complex Hadamard transform
- Fast discrete transforms by means of eigenpolynomials
- Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
- The Cooley-Tukey algorithm and discrete Haar transforms
- Fast Jacket-Haar transform with any size
- The approximating capability of fast forms
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
- A fast Hermite transform
- Generalized orthogonal discrete W transform and its fast algorithm
- A discrete Hartley transform based on Simpson's rule
- Object oriented approach for computation of two dimensional Hartley transform
- Hartly transform for symmetrical components measurement in a power system
- Prime factor fast Hartley transform
- Polynomial transform fast Hartley transform
- scientific article; zbMATH DE number 5003232 (Why is no real title available?)
- Split-radix fast Hartley transform in one and two dimensions
- Fast computation of the discrete Hartley transform
- scientific article; zbMATH DE number 3926793 (Why is no real title available?)
- Fast Hankel transform algorithm
- Prefolding in FHT algorithms
- Systolic arrays for the discrete Hartley transform
- Eight-point discrete Hartley transform as an edge operator and its interpretation in the frequency domain
- Fast discrete extrapolation via the fast Hartley transform
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- scientific article; zbMATH DE number 2163930 (Why is no real title available?)
- Conversion of FFT’s to Fast Hartley Transforms
- Identification of a class of nonlinear continuous-time systems using Hartley modulating functions
- An algorithm for fast Hilbert transform of real functions
- scientific article; zbMATH DE number 7607907 (Why is no real title available?)
- A fast, accurate, and smooth planetary ephemeris retrieval system
- In-place in-order mixed radix fast Hartley transforms
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
- An array architecture for computing two-dimensional discrete Hartley transforms
- Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning
- Moment-based fast discrete Hartley transform
- Fixed-point fast Hartley transform error analysis
This page was built for publication: The Fast Hartley Transform Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757265)
