On the public citation graph

Fast Hartley transform pruning

0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1049/el:19850241openalex-snapshot
Fast Hartley transform algorithm
inferredcites →https://doi.org/10.1049/el:19860018openalex-snapshot
Split-radix fast Hartley transform
inferredcites →https://doi.org/10.1049/el:19870154openalex-snapshot
Comparative study of time efficiency of several algorithms for discrete W transform and discrete Hartley transform
inferredcites →https://doi.org/10.1049/el:19870800openalex-snapshot
Alternative to split-radix Hartley transform
inferredcites →https://doi.org/10.1109/proc.1984.12968openalex-snapshot
The fast Hartley transform
inferredcites →https://doi.org/10.1109/proc.1985.13381openalex-snapshot
A comparison of the time involved in computing fast Hartley and fast Fourier transforms
inferredcites →https://doi.org/10.1109/tassp.1985.1164687openalex-snapshot
On computing the discrete Hartley transform
inferredcites →https://doi.org/10.1109/tassp.1986.1164896openalex-snapshot
Structured fast Hartley transform algorithms
inferredcites →https://doi.org/10.1109/tassp.1987.1165218openalex-snapshot
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
inferredcites →https://doi.org/10.1109/tau.1971.1162205openalex-snapshot
FFT pruning
inferredcites →https://doi.org/10.1109/tc.1987.1676877openalex-snapshot
The Fast Hartley Transform Algorithm
inferredcites →https://doi.org/10.1364/josa.73.001832openalex-snapshot
Discrete Hartley transform

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4615-2776-3_5openalex-snapshot
High-Speed Transform Coding Architectures for Video Communications
inferred← citeshttps://doi.org/10.1007/s11265-017-1322-yopenalex-snapshot
Discrete Orthogonal Multi-transform on Chip (DOMoC)
inferred← citeshttps://doi.org/10.1016/0165-1684(96)00044-8openalex-snapshot
Generalized pruning at the input of radix-2 DIF FHT algorithm
inferred← citeshttps://doi.org/10.1016/j.micpro.2005.10.002openalex-snapshot
Transform decomposition method of pruning the FHT algorithms
inferred← citeshttps://doi.org/10.1016/s0165-1684(96)00107-7openalex-snapshot
A new structure for the running discrete Hartley transform
inferred← citeshttps://doi.org/10.1109/76.285623openalex-snapshot
Optimal unified architectures for the real-time computation of time-recursive discrete sinusoidal transforms
inferred← citeshttps://doi.org/10.1109/78.205735openalex-snapshot
Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms
inferred← citeshttps://doi.org/10.1109/78.489046openalex-snapshot
Analysis of pruning in fast cosine transform
inferred← citeshttps://doi.org/10.1109/apccas.1994.514528openalex-snapshot
VLSI implementation of a generic discrete transform processor for real-time applications
inferred← citeshttps://doi.org/10.1109/icet.2005.1558852openalex-snapshot
On Cooley-Tukey FFT method for zero padded signals
inferred← citeshttps://doi.org/10.1109/mwscas.1992.271378openalex-snapshot
Unified VLSI lattice architectures for discrete sinusoidal transforms
inferred← citeshttps://doi.org/10.1109/tsp.2004.838983openalex-snapshot
An analysis of real-Fourier domain-based adaptive algorithms implemented with the Hartley transform using cosine-sine symmetries
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.