The Fast Hartley Transform Algorithm
From MaRDI portal
Publication:3757265
DOI10.1109/TC.1987.1676877zbMATH Open0621.65037MaRDI QIDQ3757265FDOQ3757265
Publication date: 1987
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
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
discrete Fourier transformfast Fourier transformparallel processingdiscrete cosine transformdiscrete Hartley transformfast Hartley transform
Cited In (26)
- Title not available (Why is that?)
- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
- A fast Hermite transform
- A discrete Hartley transform based on Simpson's rule
- Identification of a class of nonlinear continuous-time systems using Hartley modulating functions
- The Cooley-Tukey algorithm and discrete Haar transforms
- Split-radix fast Hartley transform in one and two dimensions
- Fast computation of the discrete Hartley transform
- Fast Hankel transform algorithm
- Prime factor fast Hartley transform
- Fast discrete extrapolation via the fast Hartley transform
- Fast discrete transforms by means of eigenpolynomials
- Conversion of FFT’s to Fast Hartley Transforms
- Generalized orthogonal discrete W transform and its fast algorithm
- Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
- Title not available (Why is that?)
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- An algorithm for fast Hilbert transform of real functions
- Title not available (Why is that?)
- A fast, accurate, and smooth planetary ephemeris retrieval system
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
- The approximating capability of fast forms
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
- Polynomial transform fast Hartley transform
- Title not available (Why is that?)
- In-place in-order mixed radix fast Hartley transforms
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)
