Split-radix algorithm for 2-D discrete Hartley transform

DOI10.1016/S0165-1684(96)00139-9zbMATH Open0899.65084OpenAlexW2081932049MaRDI QIDQ1127485FDOQ1127485

Authors: Guoan Bi 

Publication date: 13 August 1998

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-1684(96)00139-9

Recommendations

• Split-radix fast Hartley transform in one and two dimensions
• The vector split-radix algorithm for 2D DHT
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
• Fast DHT algorithms for length \(N=q*2^m\)
• Fast DFT algorithms for length \(N=q*2^m\)

zbMATH Keywords

fast discrete Hartley transformfast split-radix algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (7)

• The vector split-radix algorithm for 2D DHT
• Split-radix fast Hartley transform in one and two dimensions
• Fast computation of the discrete Hartley transform
• Split-radix algorithms for length-p/sup m/ DFT's
• On the two-dimensional vector split-radix FFT algorithm
• Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)

This page was built for publication: Split-radix algorithm for 2-D discrete Hartley transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127485)