On the public citation graph
Split vector-radix fast Fourier transform
0 signed · 66 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.1007/978-3-662-00551-4openalex-snapshot
Fast Fourier Transform and Convolution Algorithms
inferredcites →https://doi.org/10.1049/el:19901233openalex-snapshot
Polynomial transform fast Hartley transform
inferredcites →https://doi.org/10.1109/29.17500openalex-snapshot
Split-radix algorithms for length-p/sup m/ DFT's
inferredcites →https://doi.org/10.1109/29.31283openalex-snapshot
On the two-dimensional vector split-radix FFT algorithm
inferredcites →https://doi.org/10.1109/29.31295openalex-snapshot
The structure of vector radix fast Fourier transforms
inferredcites →https://doi.org/10.1109/29.7552openalex-snapshot
In-place butterfly-style FFT of 2-D real sequences
inferredcites →https://doi.org/10.1109/icassp.1977.1170190openalex-snapshot
An algorithm for the two dimensional FFT
inferredcites →https://doi.org/10.1109/icassp.1977.1170349openalex-snapshot
Vector radix fast Fourier transform
inferredcites →https://doi.org/10.1109/icassp.1987.1169345openalex-snapshot
Split vector radix 2D fast Fourier transform
inferredcites →https://doi.org/10.1109/proc.1986.13541openalex-snapshot
Vector-radix algorithm for a 2-D discrete Hartley transform
inferredcites →https://doi.org/10.1109/tassp.1977.1162951openalex-snapshot
Direct fast Fourier transform of bivariate functions
inferredcites →https://doi.org/10.1109/tassp.1985.1164687openalex-snapshot
On computing the discrete Hartley transform
inferredcites →https://doi.org/10.1109/tassp.1986.1164804openalex-snapshot
On computing the split-radix FFT
inferredcites →https://doi.org/10.1109/tassp.1986.1164811openalex-snapshot
Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data
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/tcs.1987.1086228openalex-snapshot
Split-vector radix 2-D fast Fourier 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-0-8176-8220-0_3openalex-snapshot
Fast Fourier Transform Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-8176-8220-0_5openalex-snapshot
Fast Algorithms for MD Discrete Hartley Transform
inferred← citeshttps://doi.org/10.1007/978-3-319-04960-1_18openalex-snapshot
Efficient Hardware Implementation of 1024 Point Radix-4 FFT
inferred← citeshttps://doi.org/10.1007/s10851-006-5150-0openalex-snapshot
Representation of the Fourier Transform by Fourier Series
inferred← citeshttps://doi.org/10.1007/s10851-010-0235-1openalex-snapshot
Two Classes of Elliptic Discrete Fourier Transforms: Properties and Examples
inferred← citeshttps://doi.org/10.1007/s11128-019-2322-6openalex-snapshot
Paired quantum Fourier transform with log2N Hadamard gates
inferred← citeshttps://doi.org/10.1007/s11265-006-7510-9openalex-snapshot
Error Analysis and Efficient Realization of the Multiplier-Less FFT-Like Transformation (ML-FFT) and Related Sinusoidal Transformations
inferred← citeshttps://doi.org/10.1016/j.cam.2006.11.025openalex-snapshot
Vector coding algorithms for multidimensional discrete Fourier transform
inferred← citeshttps://doi.org/10.1016/j.sigpro.2003.11.018openalex-snapshot
A novel algorithm for computing the 2D split-vector-radix FFT
inferred← citeshttps://doi.org/10.1016/j.sigpro.2007.05.012openalex-snapshot
Pruning fast Fourier transform algorithm design using group-based method
inferred← citeshttps://doi.org/10.1016/s0165-1684(01)00211-0openalex-snapshot
Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
inferred← citeshttps://doi.org/10.1016/s0165-1684(96)00139-9openalex-snapshot
Split-radix algorithm for 2-D discrete Hartley transform
inferred← citeshttps://doi.org/10.1109/42.875190openalex-snapshot
Real-time image reconstruction for spiral MRI using fixed-point calculation
inferred← citeshttps://doi.org/10.1109/78.542443openalex-snapshot
A new multidimensional fast convolution algorithm
inferred← citeshttps://doi.org/10.1109/78.815487openalex-snapshot
Split manageable efficient algorithm for Fourier and Hadamard transforms
inferred← citeshttps://doi.org/10.1109/78.902116openalex-snapshot
2-D and 1-D multipaired transforms: frequency-time type wavelets
inferred← citeshttps://doi.org/10.1109/82.664256openalex-snapshot
Fast center weighted Hadamard transform algorithms
inferred← citeshttps://doi.org/10.1109/82.877157openalex-snapshot
A new multidimensional FFT based on one-dimensional decompositions
inferred← citeshttps://doi.org/10.1109/apccas.2006.342240openalex-snapshot
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
inferred← citeshttps://doi.org/10.1109/ccece.2004.1345319openalex-snapshot
An efficient FFT algorithm based on the radix-2/4 DIF approach for computing 3D DFT
inferred← citeshttps://doi.org/10.1109/ciss.2006.286625openalex-snapshot
Nonlinear Approach Of Construction of Fast Unitary Transforms
inferred← citeshttps://doi.org/10.1109/dsp.1994.379886openalex-snapshot
Selection of a processor for a portable MaxiCode reader
inferred← citeshttps://doi.org/10.1109/icdcsyst.2014.6926131openalex-snapshot
Efficient hardware implementation of scalable FFT using configurable Radix-4/2
inferred← citeshttps://doi.org/10.1109/icecs.2002.1046404openalex-snapshot
Parallelisation of the 1-D block filter algorithm to run on multiple DSPs
inferred← citeshttps://doi.org/10.1109/icecs.2010.5724617openalex-snapshot
Vector-radix-22×22 fast Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/icip.1994.413742openalex-snapshot
A new 1D FFT-based algorithm for computing the MD FFT on arbitrary lattices
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346084openalex-snapshot
Elliptic discrete fourier transforms of type II
inferred← citeshttps://doi.org/10.1109/iscas.1991.176416openalex-snapshot
Polynomial transform fast Hartley transform
inferred← citeshttps://doi.org/10.1109/iscas.2002.1010567openalex-snapshot
A multiplier-less 1-D and 2-D fast Fourier transform-like transformation using sum-of-powers-of-two (SOPOT) coefficients
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205115openalex-snapshot
A split-radix algorithm for 2-D DFT
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205822openalex-snapshot
Multiplier-less real-valued FFT-like transformation (ML-RFFT) and related real-valued transformations
inferred← citeshttps://doi.org/10.1109/iscas.2006.1693733openalex-snapshot
Design of a multidimensional split vector-radix decimation-in-frequency FFT algorithm
inferred← citeshttps://doi.org/10.1109/lsp.2004.826652openalex-snapshot
Split Vector-Radix-2/8 2-D Fast Fourier Transform
inferred← citeshttps://doi.org/10.1109/lsp.2004.842289openalex-snapshot
A note on "Split vector-radix-2/8 2-D Fast Fourier Transform"
inferred← citeshttps://doi.org/10.1109/tcsi.2005.853949openalex-snapshot
New radix-(2/spl times/2/spl times/2)/(4/spl times/4/spl times/4) and radix-(2/spl times/2/spl times/2)/(8/spl times/8/spl times/8) DIF FFT algorithms for 3-D DFT
inferred← citeshttps://doi.org/10.1109/tcsii.2003.821514openalex-snapshot
Improved Approximate QR-LS Algorithms for Adaptive Filtering
inferred← citeshttps://doi.org/10.1109/tsp.2004.838970openalex-snapshot
Method of flow graph simplification for the 16-point discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tsp.2007.898784openalex-snapshot
Novel Reversible Integer Fourier Transform With Control Bits
inferred← citeshttps://doi.org/10.1109/tsp.2016.2598325openalex-snapshot
New Look on $q2^r$ -Point Fast Fourier Transforms
inferred← citeshttps://doi.org/10.1109/vtsa.1993.263607openalex-snapshot
A novel systolic architecture for the 2-D discrete Fourier transform
inferred← citeshttps://doi.org/10.1117/12.2083471openalex-snapshot
Algorithms of theq2r× q2r-point 2D discrete Fourier transform
inferred← citeshttps://doi.org/10.1117/12.2083543openalex-snapshot
Fourier transforms with rotations on circles or ellipses in signal and image processing
inferred← citeshttps://doi.org/10.1155/2016/2416286openalex-snapshot
Vector Radix 2 × 2 Sliding Fast Fourier Transform
inferred← citeshttps://doi.org/10.12928/telkomnika.v18i6.16100openalex-snapshot
Direct split-radix algorithm for fast computation of type-II discrete Hartley transform
inferred← citeshttps://doi.org/10.32657/10356/41750openalex-snapshot
Processing algorithms for signals with time-varying frequencies.
inferred← citeshttps://doi.org/10.5755/j01.eee.21.4.12784openalex-snapshot
A New Relation between “Twiddle Factors” in the Fast Fourier Transformation
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.