Moment-based fast discrete Hartley transform
From MaRDI portal
Recommendations
Cited in
(15)- A novel approach to fast discrete Fourier transform
- A novel interpretation of the two-dimensional discrete Hartley transform
- A new structure for the running discrete Hartley transform
- New algorithms for multidimensional discrete Hartley transform
- Fast DCT-I, DCT-III, and DCT-IV via moments
- An efficient design for one-dimensional discrete Hartley transform using parallel additions
- Hartly transform for symmetrical components measurement in a power system
- Polynomial transform fast Hartley transform
- Fast computation of the discrete Hartley transform
- The Fast Hartley Transform Algorithm
- Systolic arrays for the discrete Hartley transform
- Eight-point discrete Hartley transform as an edge operator and its interpretation in the frequency domain
- A novel CORDIC-based array architecture for the multidimensional discrete Hartley transform
- In-place in-order mixed radix fast Hartley transforms
- An array architecture for computing two-dimensional discrete Hartley transforms
This page was built for publication: Moment-based fast discrete Hartley transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948186)