On the public citation graph
Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
0 signed · 59 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.1007/bf00288772openalex-snapshot
On the number of active *-operations needed to compute the discrete Fourier transform
inferredcites →https://doi.org/10.1007/bf01683270openalex-snapshot
Some bilinear forms whose multiplicative complexity depends on the field of constants
inferredcites →https://doi.org/10.1016/0001-8708(79)90037-9openalex-snapshot
On the multiplicative complexity of the Discrete Fourier Transform
inferredcites →https://doi.org/10.1016/0165-1684(84)90059-8openalex-snapshot
Simple FFT and DCT algorithms with reduced number of operations
inferredcites →https://doi.org/10.1016/0196-8858(80)90013-5openalex-snapshot
The multiplicative complexity of certain semilinear systems defined by Polynomials
inferredcites →https://doi.org/10.1016/0196-8858(84)90005-8openalex-snapshot
The multiplicative complexity of the Discrete Fourier Transform
inferredcites →https://doi.org/10.1017/cbo9780511760921openalex-snapshot
Fast Algorithms for Signal Processing
inferredcites →https://doi.org/10.1049/el:19840474openalex-snapshot
Existence of a 2 n FFT algorithm with a number of multiplications lower than 2 n +1
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/icassp.1980.1171044openalex-snapshot
Signal processing and complexity of computation
inferredcites →https://doi.org/10.1109/tassp.1976.1162805openalex-snapshot
A new principle for fast Fourier transformation
inferredcites →https://doi.org/10.1109/tassp.1984.1164395openalex-snapshot
Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
inferredcites →https://doi.org/10.1109/tassp.1986.1164785openalex-snapshot
On the number of multiplications necessary to compute a length-2nDFT
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.1145/322108.322118openalex-snapshot
Optimality of the Fast Fourier transform
inferredcites →https://doi.org/10.1145/364096.364118openalex-snapshot
Numerical Analysis: A fast fourier transform algorithm for real-valued series
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0165-1684(90)90158-uopenalex-snapshot
Fast fourier transforms: A tutorial review and a state of the art
inferred← citeshttps://doi.org/10.1016/j.phycom.2009.02.005openalex-snapshot
Practical architecture of a broadband sensing receiver for use in cognitive radio
inferred← citeshttps://doi.org/10.1016/s0165-1684(97)00162-xopenalex-snapshot
An FFT-based technique for fast fractal image compression
inferred← citeshttps://doi.org/10.1080/00207219308907161openalex-snapshot
Computing architectures for DFT-based HF-band energy detection
inferred← citeshttps://doi.org/10.1109/78.193235openalex-snapshot
The vector split-radix algorithm for 2D DHT
inferred← citeshttps://doi.org/10.1109/78.205744openalex-snapshot
The poorman's transform: approximating the Fourier transform without multiplication
inferred← citeshttps://doi.org/10.1109/78.212731openalex-snapshot
Basis-vector-decomposition based two-stage computational algorithms for DFT and DHT
inferred← citeshttps://doi.org/10.1109/82.877157openalex-snapshot
A new multidimensional FFT based on one-dimensional decompositions
inferred← citeshttps://doi.org/10.1109/artcom.2010.27openalex-snapshot
Improvement in Total Sensing Time of the Receiver in the Cognitive Radio
inferred← citeshttps://doi.org/10.1109/glsv.1991.143976openalex-snapshot
Discrete Fourier transform processors using CORDIC
inferred← citeshttps://doi.org/10.1109/icassp.1990.115696openalex-snapshot
Polynomial transform computation of the 2-D DCT
inferred← citeshttps://doi.org/10.1109/icassp.1991.150853openalex-snapshot
A fast algorithm for the implementation of filter banks based on 'time domain aliasing cancellation'
inferred← citeshttps://doi.org/10.1109/iccw.2008.102openalex-snapshot
Use of Dedicated Broadband Sensing Receiver in Cognitive Radio
inferred← citeshttps://doi.org/10.1109/iccw.2013.6649240openalex-snapshot
A software radio implementation for spectrum hole sensing in cognitive mobile networks
inferred← citeshttps://doi.org/10.1109/icicip.2010.5564348openalex-snapshot
Efficient systolic implementation of DFT using only the first-order moments
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/iscas.1999.778897openalex-snapshot
On the implementation of 2-band cyclic filterbanks
inferred← citeshttps://doi.org/10.1109/iscas.2004.1328947openalex-snapshot
An efficient memory compression scheme for 8 k FFT in a DVB-T receiver and the corresponding error model
inferred← citeshttps://doi.org/10.1109/iscas.2007.378754openalex-snapshot
A Parallel, Multi-Resolution Sensing Technique for Multiple Antenna Cognitive Radios
inferred← citeshttps://doi.org/10.1109/jlt.2015.2470114openalex-snapshot
Design Tradeoffs and Challenges in Practical Coherent Optical Transceiver Implementations
inferred← citeshttps://doi.org/10.1109/jlt.2024.3399032openalex-snapshot
Recent Advances in Low-Power Digital Signal Processing Technologies for Data Center Applications
inferred← citeshttps://doi.org/10.1109/jssc.2011.2176163openalex-snapshot
Power and Area Minimization of Reconfigurable FFT Processors: A 3GPP-LTE Example
inferred← citeshttps://doi.org/10.1109/tsp.2002.1011208openalex-snapshot
A new IDCT-DFT relationship reducing the IDCT computational cost
inferred← citeshttps://doi.org/10.1109/tsp.2002.806904openalex-snapshot
High-speed and low-power split-radix FFT
inferred← citeshttps://doi.org/10.1109/tsp.2005.859216openalex-snapshot
Computationally efficient systolic architecture for computing the discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tsp.2006.882087openalex-snapshot
A Modified Split-Radix FFT With Fewer Arithmetic Operations
inferred← citeshttps://doi.org/10.1109/tsp.2007.896110openalex-snapshot
A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$
inferred← citeshttps://doi.org/10.1109/tsp.2008.2006152openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
inferred← citeshttps://doi.org/10.1109/tsp.2020.3015419openalex-snapshot
Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field
inferred← citeshttps://doi.org/10.1109/wts.2007.4563300openalex-snapshot
Finite wordlength design for FFT/IFFT in UWB-OFDM systems
inferred← citeshttps://doi.org/10.1155/2009/309212openalex-snapshot
Optimization of Sensing Receiver for Cognitive Radio Applications
inferred← citeshttps://doi.org/10.14257/ijast.2013.61.06openalex-snapshot
Design and Simulation of FFT Processor Using Radix-4 Algorithm Using FPGA
inferred← citeshttps://doi.org/10.17632/svvjnx5n4r.1openalex-snapshot
Acoustic interferometer to mimic LIGO experiment
inferred← citeshttps://doi.org/10.3233/sat190084openalex-snapshot
Generating and Searching Families of FFT Algorithms
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.229-231.1772openalex-snapshot
Seismic Signal Wavelet-Packet Denoising and Fast Spectrum Analysis
inferred← citeshttps://doi.org/10.4208/jcm.v13.n4.p351openalex-snapshot
The Multiplicative Complexity and Algorithm of the Generalized Discrete Fourier Transform (GFT)
inferred← citeshttps://doi.org/10.4304/jetwi.3.4.263-267openalex-snapshot
Optimization of Spectrum Management Issues for Cognitive Radio (Invited Paper)
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.