Pages that link to "Item:Q3757265"
From MaRDI portal
The following pages link to The Fast Hartley Transform Algorithm (Q3757265):
Displaying 29 items.
- An algorithm for fast Hilbert transform of real functions (Q489778) (← links)
- A fast, accurate, and smooth planetary ephemeris retrieval system (Q642381) (← links)
- In-place in-order mixed radix fast Hartley transforms (Q672118) (← links)
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization (Q784516) (← links)
- An array architecture for computing two-dimensional discrete Hartley transforms (Q804326) (← links)
- Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning (Q820192) (← links)
- Moment-based fast discrete Hartley transform (Q948186) (← links)
- Fixed-point fast Hartley transform error analysis (Q951616) (← links)
- Natural-ordered complex Hadamard transform (Q1046655) (← links)
- Fast discrete transforms by means of eigenpolynomials (Q1311982) (← links)
- Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor (Q1318648) (← links)
- The Cooley-Tukey algorithm and discrete Haar transforms (Q1422693) (← links)
- Fast Jacket-Haar transform with any size (Q1666187) (← links)
- The approximating capability of fast forms (Q1971592) (← links)
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\) (Q2003161) (← links)
- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications (Q2277807) (← links)
- A fast Hermite transform (Q2378496) (← links)
- Generalized orthogonal discrete W transform and its fast algorithm (Q2657434) (← links)
- A discrete Hartley transform based on Simpson's rule (Q2795242) (← links)
- Prime factor fast Hartley transform (Q3201722) (← links)
- Polynomial transform fast Hartley transform (Q3204016) (← links)
- (Q3369687) (← links)
- Fast computation of the discrete Hartley transform (Q3563602) (← links)
- Fast Hankel transform algorithm (Q3757346) (← links)
- Prefolding in FHT algorithms (Q3985180) (← links)
- Systolic arrays for the discrete Hartley transform (Q3986216) (← links)
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms (Q4564656) (← links)
- Conversion of FFT’s to Fast Hartley Transforms (Q4727384) (← links)
- Identification of a class of nonlinear continuous-time systems using Hartley modulating functions (Q4863055) (← links)
