A structured dual split-radix algorithm for the discrete Hartley transform of length 2N

DOI10.1007/S00034-017-0552-3MaRDI QIDQ2003161zbMATHOpenAlexFDO

Authors 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 algorithmsVLSI implementationdiscrete Hartley transformsplit-radix algorithms

Mathematics Subject Classification ID

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

Recommendations

• Fast DHT algorithms for length \(N=q*2^m\)
• Split-radix algorithm for 2-D discrete Hartley transform
• The vector split-radix algorithm for 2D DHT
• Fast computation of the discrete Hartley transform
• A new structure for the running discrete Hartley transform

Cites work

• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• Calculating the FHT in hardware
• Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.
• 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
• High-speed and low-power split-radix FFT
• New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
• Prime factor fast Hartley transform
• Scalable and modular memory-based systolic architectures for discrete Hartley transform
• The Fast Hartley Transform Algorithm

Cited in

(6)

• An efficient design for one-dimensional discrete Hartley transform using parallel additions
• Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
• Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
• A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs
• The vector split-radix algorithm for 2D DHT
• A new structure for the running discrete Hartley transform

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)