On the public citation graph
Implementation and performance of the fast Hartley transform
0 signed · 21 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0016-0032(65)90537-5openalex-snapshot
The Fourier transform and its applications
inferredcites →https://doi.org/10.1038/scientificamerican0689-86openalex-snapshot
The Fourier Transform
inferredcites →https://doi.org/10.1049/ip-f-1.1987.0059openalex-snapshot
Operating principles and recent developments in analogue and digital signal processing hardware
inferredcites →https://doi.org/10.1109/jrproc.1942.234333openalex-snapshot
A More Symmetrical Fourier Analysis Applied to Transmission Problems
inferredcites →https://doi.org/10.1109/mm.1986.304802openalex-snapshot
Digital Signal Processing Microprocessors: Forward to the Past?
inferredcites →https://doi.org/10.1109/tassp.1975.1162674openalex-snapshot
The fast Fourier transform
inferredcites →https://doi.org/10.1109/tassp.1987.1165252openalex-snapshot
An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transforms
inferredcites →https://doi.org/10.1137/0907042openalex-snapshot
Conversion of FFT’s to Fast Hartley Transforms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00034-017-0552-3openalex-snapshot
A Structured Dual Split-Radix Algorithm for the Discrete Hartley Transform of Length $$2^{N}$$ 2 N
inferred← citeshttps://doi.org/10.1007/s11277-020-07125-4openalex-snapshot
Detection of Low-Rate Cloud DDoS Attacks in Frequency Domain Using Fast Hartley Transform
inferred← citeshttps://doi.org/10.1016/0165-1684(93)90031-5openalex-snapshot
A novel scaling scheme for fast Hartley transform
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90329-8openalex-snapshot
Multidimensional fast Hartley transform onto SIMD hypercubes
inferred← citeshttps://doi.org/10.1016/0745-7138(92)90013-uopenalex-snapshot
Selection criteria in the development of a multiple processor based DSP system
inferred← citeshttps://doi.org/10.1016/j.sigpro.2004.08.007openalex-snapshot
Time–frequency localization with the Hartley S-transform
inferred← citeshttps://doi.org/10.1017/s143192760210287xopenalex-snapshot
FFT “light” - Image Deconvolution based on Real to Real-Space Frequency Transformations
inferred← citeshttps://doi.org/10.1109/71.388039openalex-snapshot
Efficient fast Hartley transform algorithms for hypercube-connected multicomputers
inferred← citeshttps://doi.org/10.1109/78.91196openalex-snapshot
Discrete Hartley transform in error control coding
inferred← citeshttps://doi.org/10.1109/ciccas.1991.184481openalex-snapshot
On cepstrum approach to sequential image matching
inferred← citeshttps://doi.org/10.1109/icassp.1991.150849openalex-snapshot
Convolution algorithms on DSP processors
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.