Fast computation of the discrete Hartley transform
From MaRDI portal
(Redirected from Publication:3563602)
Recommendations
Cites work
- scientific article; zbMATH DE number 47717 (Why is no real title available?)
- scientific article; zbMATH DE number 3240629 (Why is no real title available?)
- A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
- A Split Vector-Radix Algorithm for the 3-D Discrete Hartley Transform
- Discrete sine transform and its inverse - realization through recursive algorithms
- Efficient Recursive Structures for Forward and Inverse Discrete Cosine Transform
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- Fast DHT algorithms for length N=q*2ᵐ
- Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.
- New fast discrete Hartley transform algorithm
- Split-radix algorithm for 2-D discrete Hartley transform
- Split-radix fast Hartley transform in one and two dimensions
- The Fast Hartley Transform Algorithm
Cited in
(34)- Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning
- An efficient design for one-dimensional discrete Hartley transform using parallel additions
- A fast Hermite transform
- Object oriented approach for computation of two dimensional Hartley transform
- The vector split-radix algorithm for 2D DHT
- New fast discrete Hartley transform algorithm
- Fast algorithm for discrete fractional Hadamard transform
- Generalized discrete Hartley transforms
- Split-radix fast Hartley transform in one and two dimensions
- The Fast Hartley Transform Algorithm
- Prime factor fast Hartley transform
- Fast discrete extrapolation via the fast Hartley transform
- Conversion of FFT’s to Fast Hartley Transforms
- Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
- On prime factor mapping for the discrete Hartley transform
- Fast Discrete Curvelet Transforms
- Hartly transform for symmetrical components measurement in a power system
- scientific article; zbMATH DE number 7607907 (Why is no real title available?)
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
- scientific article; zbMATH DE number 3926793 (Why is no real title available?)
- Binary Discrete Cosine and Hartley Transforms
- A new structure for the running discrete Hartley transform
- New algorithms for multidimensional discrete Hartley transform
- Systolic arrays for the discrete Hartley transform
- scientific article; zbMATH DE number 55187 (Why is no real title available?)
- Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
- Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
- Polynomial transform fast Hartley transform
- Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform
- Moment-based fast discrete Hartley transform
- In-place in-order mixed radix fast Hartley transforms
- Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
This page was built for publication: Fast computation of the discrete Hartley transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563602)
