A structured dual split-radix algorithm for the discrete Hartley transform of length 2N
From MaRDI portal
Publication:2003161
DOI10.1007/S00034-017-0552-3zbMATH Open1486.65302OpenAlexW2606347997MaRDI QIDQ2003161FDOQ2003161
Publication date: 16 July 2019
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0552-3
Numerical methods for discrete and fast Fourier transforms (65T50) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Title not available (Why is that?)
- The Fast Hartley Transform Algorithm
- New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
- High-speed and low-power split-radix FFT
- Harmonic analysis with a real frequency function. I: Aperiodic case
- Harmonic analysis with a real function of frequency: II. Periodic and bounded cases; III. Data sequence
- Calculating the FHT in hardware
- Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.
- Prime factor fast Hartley transform
- Scalable and modular memory-based systolic architectures for discrete Hartley transform
Cited In (6)
- An efficient design for one-dimensional discrete Hartley transform using parallel additions
- The vector split-radix algorithm for 2D DHT
- A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs
- Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
- A new structure for the running discrete Hartley transform
- Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
This page was built for publication: A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003161)
