On the public citation graph

A VLSI constant geometry architecture for the fast Hartley and Fourier transforms

0 signed · 64 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.1016/0030-4018(85)90107-5openalex-snapshot
Coherent optical generation of Hartley transform of real images
inferredcites →https://doi.org/10.1016/0030-4018(86)90149-5openalex-snapshot
Image reconstruction from the Hartley transform intensity
inferredcites →https://doi.org/10.1016/0141-9331(86)90081-5openalex-snapshot
VLSI signal processing: a bit-serial approach
inferredcites →https://doi.org/10.1016/0165-6074(90)90329-8openalex-snapshot
Multidimensional fast Hartley transform onto SIMD hypercubes
inferredcites →https://doi.org/10.1016/0167-8191(87)90018-4openalex-snapshot
Multiprocessor FFTs
inferredcites →https://doi.org/10.1016/0167-9260(89)90022-9openalex-snapshot
VLSI design of an FFT processor network
inferredcites →https://doi.org/10.1049/el:19880631openalex-snapshot
Proposed prime number Hartley transform implementation using transversal filter type structures
inferredcites →https://doi.org/10.1049/ip-g-1.1988.0014openalex-snapshot
Calculation of the discrete hartley transform via the fermat number transform using a VLSI chip
inferredcites →https://doi.org/10.1049/ip-g-1.1988.0036openalex-snapshot
Fast multidimensional discrete hartley transform using fermat number transform
inferredcites →https://doi.org/10.1049/ip-g-2.1989.0046openalex-snapshot
Prime-factor Hartley and Hartley-like transform calculation using transversal filter-type structures
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1109/29.103069openalex-snapshot
Application-specific architectural methodologies for high-throughput digital signal and image processing
inferredcites →https://doi.org/10.1109/29.106871openalex-snapshot
Design and evaluation of an architecture for a digital signal processor for instrumentation applications
inferredcites →https://doi.org/10.1109/29.17541openalex-snapshot
In-situ bit-reversed ordering for Hartley transforms
inferredcites →https://doi.org/10.1109/29.31282openalex-snapshot
Fast cepstrum analysis using the Hartley transform
inferredcites →https://doi.org/10.1109/29.56029openalex-snapshot
Design issues and an architecture for the monolithic implementation of a parallel digital signal processor
inferredcites →https://doi.org/10.1109/42.3941openalex-snapshot
Fast Hartley transforms for image processing
inferredcites →https://doi.org/10.1109/53.16926openalex-snapshot
Programmable DSP architectures. I
inferredcites →https://doi.org/10.1109/53.16934openalex-snapshot
Programmable DSP architectures. II
inferredcites →https://doi.org/10.1109/cicc.1989.56793openalex-snapshot
A mask programmable DSP array
inferredcites →https://doi.org/10.1109/iscas.1988.15493openalex-snapshot
A systolic circuit for fast Hartley transform
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/mc.1982.1653825openalex-snapshot
Why systolic architectures?
inferredcites →https://doi.org/10.1109/proc.1975.10027openalex-snapshot
Theory and application of digital signal processing
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/proc.1986.13619openalex-snapshot
Fast two-dimensional Hartley transform
inferredcites →https://doi.org/10.1109/proc.1987.13729openalex-snapshot
A three-dimensional DFT algorithm using the fast Hartley transform
inferredcites →https://doi.org/10.1109/proc.1987.13762openalex-snapshot
Fast interpolation algorithm using fast Hartley transform
inferredcites →https://doi.org/10.1109/tassp.1985.1164687openalex-snapshot
On computing the discrete Hartley transform
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/tassp.1987.1165220openalex-snapshot
Real-valued fast Fourier transform algorithms
inferredcites →https://doi.org/10.1109/tc.1987.1676877openalex-snapshot
The Fast Hartley Transform Algorithm
inferredcites →https://doi.org/10.1109/tsmc.1978.4309918openalex-snapshot
Theory and Application of Digital Signal Processing
inferredcites →https://doi.org/10.1117/12.7974009openalex-snapshot
Geometric Moments Computed From The Hartley Transform
inferredcites →https://doi.org/10.1117/12.966483openalex-snapshot
The Fast Hartley Transform
inferredcites →https://doi.org/10.1364/ao.24.001401openalex-snapshot
Optical synthesis of the Hartley transform
inferredcites →https://doi.org/10.1364/ao.26.003755openalex-snapshot
Optical correlator performance of binary phase-only filters using Fourier and Hartley transforms
inferredcites →https://doi.org/10.1364/josa.73.001832openalex-snapshot
Discrete Hartley transform
inferredcites →https://doi.org/10.5555/44979.44991openalex-snapshot
Faster than fast fourier

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-58430-7_19openalex-snapshot
Vectorization of the radix r self-sorting FFT
inferred← citeshttps://doi.org/10.1007/bf02407032openalex-snapshot
Constant geometry split-radix algorithms
inferred← citeshttps://doi.org/10.1007/s11432-013-4826-5openalex-snapshot
A novel conflict-free parallel memory access scheme for FFT constant geometry architectures
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90061-oopenalex-snapshot
Design of a pipelined radix 4 CORDIC processor
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00062-3openalex-snapshot
FFTs on mesh connected computers
inferred← citeshttps://doi.org/10.1016/j.matpr.2021.05.662openalex-snapshot
WITHDRAWN: CORDIC algorithm for fixed point
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00022-7openalex-snapshot
Unified framework for the parallelization of divide and conquer based tridiagonal systems
inferred← citeshttps://doi.org/10.1109/12.338101openalex-snapshot
Unified architecture for divide and conquer based tridiagonal system solvers
inferred← citeshttps://doi.org/10.1109/71.313124openalex-snapshot
Parallel architecture for fast transforms with trigonometric kernel
inferred← citeshttps://doi.org/10.1109/78.205761openalex-snapshot
Application-specific architecture for fast transforms based on the successive doubling method
inferred← citeshttps://doi.org/10.1109/78.752608openalex-snapshot
Architecture-oriented regular algorithms for discrete sine and cosine transforms
inferred← citeshttps://doi.org/10.1109/78.875476openalex-snapshot
Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
inferred← citeshttps://doi.org/10.1109/82.392316openalex-snapshot
Partial column FFT pipelines
inferred← citeshttps://doi.org/10.1109/iccd.2008.4751880openalex-snapshot
A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346639openalex-snapshot
Scalable FFT architecture vs. multiple pipeline FFT architectures — Hardware implementation and cost
inferred← citeshttps://doi.org/10.1109/iscas.2000.858801openalex-snapshot
Scalable interconnection networks for partial column array processor architectures
inferred← citeshttps://doi.org/10.1109/ism.2006.8openalex-snapshot
A Novel VLSI Architecture for Image Compression
inferred← citeshttps://doi.org/10.1109/lsp.2006.879472openalex-snapshot
A Family of Fast Walsh Hadamard Algorithms With Identical Sparse Matrix Factorization
inferred← citeshttps://doi.org/10.1109/naecon.2010.5712968openalex-snapshot
Automatic VHDL generation software tool for parameterized FPGA based FFT architectures
inferred← citeshttps://doi.org/10.1109/tcsi.2009.2037391openalex-snapshot
Enhanced Scaling-Free CORDIC
inferred← citeshttps://doi.org/10.1109/tcsvt.2005.856908openalex-snapshot
Modified virtually scaling-free adaptive CORDIC rotator algorithm and architecture
inferred← citeshttps://doi.org/10.1142/s0129626412500090openalex-snapshot
BLOCK-PARALLEL SYSTOLIC-ARRAY ARCHITECTURE FOR 2-D NTT-BASED FRAGILE WATERMARK EMBEDDING
inferred← citeshttps://doi.org/10.1145/2159542.2159547openalex-snapshot
Computer Generation of Hardware for Linear Digital Signal Processing Transforms
inferred← citeshttps://doi.org/10.2478/itc-2013-0010openalex-snapshot
Investigation of the Indirect Hypercube as Natural Architecture for Parallel Algorithms of a Transpose Type for FFT and Other Fourier-Related Transforms
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.