A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)

DOI10.1007/S00034-017-0552-3zbMath1486.65302OpenAlexW2606347997MaRDI QIDQ2003161

Doru Florin Chiper

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

zbMATH Keywords

fast algorithmsdiscrete Hartley transformVLSI implementationsplit-radix algorithms

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Harmonic analysis with a real function of frequency: II. Periodic and bounded cases; III. Data sequence
• Harmonic analysis with a real frequency function. I: Aperiodic case
• Fast algorithms for generalized discrete Hartley transform of composite sequence lengths
• Prime factor fast Hartley transform
• The Fast Hartley Transform Algorithm
• Calculating the FHT in hardware
• Scalable and modular memory-based systolic architectures for discrete Hartley transform
• New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
• High-speed and low-power split-radix FFT

This page was built for publication: A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)