On the public citation graph

Parallel architecture for fast transforms with trigonometric kernel

0 signed · 43 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.1007/bf00127832openalex-snapshot
Systolic arrays for multidimensional discrete transforms
inferredcites →https://doi.org/10.1016/0010-4485(86)90105-3openalex-snapshot
VLSI signal processing systems
inferredcites →https://doi.org/10.1016/0141-9331(92)90061-wopenalex-snapshot
A 400 MFLOPS FFT processor VLSI architecture
inferredcites →https://doi.org/10.1049/el:19860239openalex-snapshot
Fast computation of discrete cosine transform through fast Hartley transform
inferredcites →https://doi.org/10.1049/el:19900469openalex-snapshot
Filtering with the fast T transform
inferredcites →https://doi.org/10.1049/el:19901036openalex-snapshot
Fast cosine transform based on the successive doubling method
inferredcites →https://doi.org/10.1049/ip-g-2.1991.0107openalex-snapshot
Semisystolic architecture for fast Hartley transform: decimation in frequency and radix 2
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/12.156543openalex-snapshot
Low latency time CORDIC algorithms
inferredcites →https://doi.org/10.1109/4.993openalex-snapshot
A wafer-scale 170000-gate FFT processor with built-in test circuits
inferredcites →https://doi.org/10.1109/49.62820openalex-snapshot
Directions in DSP processors
inferredcites →https://doi.org/10.1109/71.113082openalex-snapshot
A VLSI constant geometry architecture for the fast Hartley and Fourier transforms
inferredcites →https://doi.org/10.1109/78.157218openalex-snapshot
Fast algorithms for the discrete cosine transform
inferredcites →https://doi.org/10.1109/78.205761openalex-snapshot
Application-specific architecture for fast transforms based on the successive doubling method
inferredcites →https://doi.org/10.1109/79.143467openalex-snapshot
CORDIC-based VLSI architectures for digital signal processing
inferredcites →https://doi.org/10.1109/icassp.1985.1168513openalex-snapshot
Systematic approaches to the design of algorithmically specified systolic arrays
inferredcites →https://doi.org/10.1109/icwsi.1991.151696openalex-snapshot
Defect tolerance and yield for a wafer scale FFT processor system
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/jssc.1984.1052211openalex-snapshot
A radix 4 delay commutator for fast Fourier transform processor implementation
inferredcites →https://doi.org/10.1109/t-c.1970.222826openalex-snapshot
A Pipeline Fast Fourier Transform
inferredcites →https://doi.org/10.1109/t-c.1974.223784openalex-snapshot
Discrete Cosine Transform
inferredcites →https://doi.org/10.1109/t-c.1974.223800openalex-snapshot
Fourier Transform Computers Using CORDIC Iterations
inferredcites →https://doi.org/10.1109/tassp.1980.1163351openalex-snapshot
A fast cosine transform in one and two dimensions
inferredcites →https://doi.org/10.1109/tassp.1987.1165093openalex-snapshot
Architectures for multiplierless fast Fourier transform hardware implementation in VLSI
inferredcites →https://doi.org/10.1109/tassp.1987.1165220openalex-snapshot
Real-valued fast Fourier transform algorithms
inferredcites →https://doi.org/10.1117/12.966483openalex-snapshot
The Fast Hartley Transform
inferredcites →https://doi.org/10.1145/321450.321457openalex-snapshot
An Adaptation of the Fast Fourier Transform for Parallel Processing
inferredcites →https://doi.org/10.7551/mitpress/1170.003.0007openalex-snapshot
Computer Architecture

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-3-319-91734-4_17openalex-snapshot
Hardware architectures for the fast Fourier transform
inferred← citeshttps://doi.org/10.1007/s00034-022-01963-2openalex-snapshot
Hybrid Architecture for Sinusoidal and Non-sinusoidal Transforms
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00062-3openalex-snapshot
FFTs on mesh connected computers
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.1023/a:1007949000569openalex-snapshot
Mapping of Trellises Associated with General Encoders onto High-Performance VLSI Architectures
inferred← citeshttps://doi.org/10.1023/a:1008044104579openalex-snapshot
An Efficient Architecture for the In-Place Fast Cosine Transform
inferred← citeshttps://doi.org/10.1109/26.554365openalex-snapshot
High-performance VLSI architecture for the Viterbi algorithm
inferred← citeshttps://doi.org/10.1109/78.845951openalex-snapshot
Constant geometry algorithm for discrete cosine transform
inferred← citeshttps://doi.org/10.1109/82.752951openalex-snapshot
Area-efficient architecture for Fast Fourier transform
inferred← citeshttps://doi.org/10.1109/asap.1997.606855openalex-snapshot
An efficient architecture for the in place fast cosine transform
inferred← citeshttps://doi.org/10.1109/icip.1996.561073openalex-snapshot
High performance VLSI architecture for the trellis coded quantization
inferred← citeshttps://doi.org/10.1109/iscas.2000.858801openalex-snapshot
Scalable interconnection networks for partial column array processor architectures
inferred← citeshttps://doi.org/10.20868/upm.thesis.57219openalex-snapshot
Efficient hardware architectures for the computation of the FFT and other related signal processing algorithms in real time
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
inferred← citeshttps://doi.org/10.9790/4200-04514653openalex-snapshot
FPGA Implementation of Viterbi Algorithm for Decoding of Convolution Codes
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.