On the public citation graph

On Computing the Discrete Fourier Transform

0 signed · 283 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/bf01683270openalex-snapshot
Some bilinear forms whose multiplicative complexity depends on the field of constants
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/proc.1968.6477openalex-snapshot
Discrete Fourier transforms when the number of data samples is prime
inferredcites →https://doi.org/10.1145/322003.322014openalex-snapshot
Algebras Having Linear Multiplicative Complexities

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0470841834.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-09519-5_85openalex-snapshot
Symbolic-numeric interface: A review
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_59openalex-snapshot
Fast integer multiplication by block recursive, number theoretical transforms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3854-4_9openalex-snapshot
MFTA: The Prime Case
inferred← citeshttps://doi.org/10.1007/978-3-032-16883-2_7openalex-snapshot
Application of Classifiers Based on Artificial Neural Networks for Recognition and Classification of Objects in High Spatial Resolution Space Images
inferred← citeshttps://doi.org/10.1007/bf02998221openalex-snapshot
Un algorithme de transformation de Fourier rapide à double base
inferred← citeshttps://doi.org/10.1007/bfb0057595openalex-snapshot
Two-Dimensional Convolution and DFT Computation
inferred← citeshttps://doi.org/10.1007/s44218-023-00029-3openalex-snapshot
Spatiotemporal variability of pH in coastal waters of New Brunswick (Canada) and potential consequences for oyster aquaculture
inferred← citeshttps://doi.org/10.1016/0893-9659(91)90135-iopenalex-snapshot
Discrete convolution with modulo operations
inferred← citeshttps://doi.org/10.1016/b978-0-12-396960-6.00024-9openalex-snapshot
Optical Fiber Telecommunications VIB
inferred← citeshttps://doi.org/10.1017/cbo9781139171502.027openalex-snapshot
Related work and references
inferred← citeshttps://doi.org/10.1037/aca0000511openalex-snapshot
The aesthetic quality model: Complexity and randomness as foundations of visual beauty by signaling quality.
inferred← citeshttps://doi.org/10.1049/ip-vis:20050039openalex-snapshot
Flexible-length fast Fourier transform for mapping onto single-instruction multiple-data computing architecture
inferred← citeshttps://doi.org/10.1090/s0025-5718-07-01956-4openalex-snapshot
Fast convolutions meet Montgomery
inferred← citeshttps://doi.org/10.1090/s0025-5718-1991-1052103-1openalex-snapshot
A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1192969-xopenalex-snapshot
Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
inferred← citeshttps://doi.org/10.1090/s0894-0347-1990-1030655-4openalex-snapshot
Efficient Computation of the Fourier Transform on Finite Groups
inferred← citeshttps://doi.org/10.1109/11.992857openalex-snapshot
Design of a 3780-point IFFT processor for TDS-OFDM
inferred← citeshttps://doi.org/10.1109/12.53602openalex-snapshot
Being stingy with multipliers
inferred← citeshttps://doi.org/10.1109/12.61045openalex-snapshot
Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition
inferred← citeshttps://doi.org/10.1109/12.795223openalex-snapshot
Parallel implementation of multidimensional transforms without interprocessor communication
inferred← citeshttps://doi.org/10.1109/18.133245openalex-snapshot
The Gleason-Prange theorem
inferred← citeshttps://doi.org/10.1109/18.144722openalex-snapshot
On the multiplicative complexity of discrete cosine transforms
inferred← citeshttps://doi.org/10.1109/26.129200openalex-snapshot
Predictive ordering technique and feedback transform coding for data compression of still pictures
inferred← citeshttps://doi.org/10.1109/29.103058openalex-snapshot
Fast Fourier transforms over finite groups by multiprocessor systems
inferred← citeshttps://doi.org/10.1109/29.45624openalex-snapshot
DCT algorithms for VLSI parallel implementations
inferred← citeshttps://doi.org/10.1109/3.391083openalex-snapshot
A computational Fourier series solution of the BenDaniel-Duke Hamiltonian for arbitrary shaped quantum wells
inferred← citeshttps://doi.org/10.1109/30.793422openalex-snapshot
Performance of OFDM/CDMA system with turbo coding in a multipath fading channel
inferred← citeshttps://doi.org/10.1109/31.85638openalex-snapshot
On indexing the prime factor fast Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/4.994openalex-snapshot
A 70-MHz 1.2- mu m CMOS 16-point DFT processor
inferred← citeshttps://doi.org/10.1109/5.364464openalex-snapshot
JAGUAR: a fully pipelined VLSI architecture for JPEG image compression standard
inferred← citeshttps://doi.org/10.1109/76.856453openalex-snapshot
A fast algorithm for DCT-domain inverse motion compensation based on shared information in a macroblock
inferred← citeshttps://doi.org/10.1109/78.139244openalex-snapshot
On prime factor mapping for the discrete Hartley transform
inferred← citeshttps://doi.org/10.1109/78.157181openalex-snapshot
Computation of an odd-length DCT from a real-valued DFT of the same length
inferred← citeshttps://doi.org/10.1109/78.157218openalex-snapshot
Fast algorithms for the discrete cosine transform
inferred← citeshttps://doi.org/10.1109/78.157241openalex-snapshot
A prime factor fast W transform algorithm
inferred← citeshttps://doi.org/10.1109/78.193205openalex-snapshot
FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
inferred← citeshttps://doi.org/10.1109/78.205723openalex-snapshot
Efficient computation of the DFT with only a subset of input or output points
inferred← citeshttps://doi.org/10.1109/78.224245openalex-snapshot
An analysis for the realization of an in-place and in-order prime factor algorithm
inferred← citeshttps://doi.org/10.1109/78.301838openalex-snapshot
An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
inferred← citeshttps://doi.org/10.1109/78.476453openalex-snapshot
A block multirate paradigm for efficient parallel algorithm development
inferred← citeshttps://doi.org/10.1109/78.923301openalex-snapshot
A fast efficient computation of cubic-spline interpolation in image codec
inferred← citeshttps://doi.org/10.1109/82.281844openalex-snapshot
Generalized Fermat-Mersenne number theoretic transform
inferred← citeshttps://doi.org/10.1109/82.329735openalex-snapshot
Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
inferred← citeshttps://doi.org/10.1109/92.250197openalex-snapshot
The design and implementation of the Arithmetic Cube II, a VLSI signal processing system
inferred← citeshttps://doi.org/10.1109/access.2018.2873815openalex-snapshot
Integrated Virtual Laboratory in Engineering Mathematics Education: Fourier Theory
inferred← citeshttps://doi.org/10.1109/access.2020.2994550openalex-snapshot
Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
inferred← citeshttps://doi.org/10.1109/access.2020.3022618openalex-snapshot
Acoustic Fingerprints for Access Management in Ad-Hoc Sensor Networks
inferred← citeshttps://doi.org/10.1109/access.2022.3183993openalex-snapshot
A Scalable Emulator for Quantum Fourier Transform Using Multiple-FPGAs With High-Bandwidth-Memory
inferred← citeshttps://doi.org/10.1109/access.2024.3374768openalex-snapshot
Recognition of Arabic Accents From English Spoken Speech Using Deep Learning Approach
inferred← citeshttps://doi.org/10.1109/access.2024.3410231openalex-snapshot
DCT-ViT: High-Frequency Pruned Vision Transformer With Discrete Cosine Transform
inferred← citeshttps://doi.org/10.1109/acii55700.2022.9953819openalex-snapshot
ALOE: Active Learning based Opportunistic Experience Sampling for Smartphone Keyboard driven Emotion Self-report Collection
inferred← citeshttps://doi.org/10.1109/acssc.1985.671414openalex-snapshot
A New Pipeline/parallel Architecture For Prime Factor Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1109/acssc.1991.186424openalex-snapshot
Algorithms for length 15 and 30 discrete cosine transform
inferred← citeshttps://doi.org/10.1109/arrays.1988.18104openalex-snapshot
Systolic array system for vector quantization using transformed sub-band coding
inferred← citeshttps://doi.org/10.1109/asap.1991.238888openalex-snapshot
The Arithmetic Cube: error analysis and simulation
inferred← citeshttps://doi.org/10.1109/asicon.2017.8252654openalex-snapshot
Neural networks: Efficient implementations and applications
inferred← citeshttps://doi.org/10.1109/ccece.2003.1226376openalex-snapshot
Implementation of high-peed multi-level QAM modems based on Xilinx Virtex-II FPGA
inferred← citeshttps://doi.org/10.1109/ciccas.1991.184301openalex-snapshot
Address generation of prime factor algorithm in a multiprocessor system
inferred← citeshttps://doi.org/10.1109/cisp.2012.6469906openalex-snapshot
A novel overall in-place in-order prime factor FFT algorithm
inferred← citeshttps://doi.org/10.1109/cnmt.2009.5374790openalex-snapshot
Low-Power High-Speed Radix-2 DIT FFT Suitable for AAC/DRA Audio Decoding
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00873openalex-snapshot
FALCON: A Fourier Transform Based Approach for Fast and Secure Convolutional Neural Network Predictions
inferred← citeshttps://doi.org/10.1109/dcis62603.2024.10769152openalex-snapshot
A Hardware-Efficient 1200-point FFT Architecture that Combines the Prime Factor and Cooley-Tukey Algorithms
inferred← citeshttps://doi.org/10.1109/dicta.2009.67openalex-snapshot
A Fast Number Theoretic Finite Radon Transform
inferred← citeshttps://doi.org/10.1109/eit.2006.252206openalex-snapshot
A Modified FFT Algorithm for Efficient Computation of Narrow Band Spectrum
inferred← citeshttps://doi.org/10.1109/elmar52657.2021.9550946openalex-snapshot
Discrete Cosine Transform Hardware Accelerator in Parallel Ultra-low Power System
inferred← citeshttps://doi.org/10.1109/embc.2014.6944459openalex-snapshot
Low complexity underdetermined blind source separation system architecture for emerging remote healthcare applications
inferred← citeshttps://doi.org/10.1109/embc.2015.7319614openalex-snapshot
Fast underdetermined BSS architecture design methodology for real time applications
inferred← citeshttps://doi.org/10.1109/embeddedsys.2014.6953043openalex-snapshot
ASIC implementation of high speed fast fourier transform based on Split-radix algorithm
inferred← citeshttps://doi.org/10.1109/fpl.2009.5272266openalex-snapshot
Implementation of a reconfigurable Fast Fourier Transform application to digital terrestrial television broadcasting
inferred← citeshttps://doi.org/10.1109/fpt.2015.7393123openalex-snapshot
Accelerated cell imaging and classification on FPGAs for quantitative-phase asymmetric-detection time-stretch optical microscopy
inferred← citeshttps://doi.org/10.1109/globalsip.2013.6737133openalex-snapshot
Pipelined FFT for wireless communications supporting 128–2048 / 1536 -point transforms
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037359openalex-snapshot
Nested sampling for higher-order statistics with application to LTE channel estimation
inferred← citeshttps://doi.org/10.1109/hpec55821.2022.9926310openalex-snapshot
Design and Implementation of a Real-time Parallel FFT for a Direction-Finding System on an FPGA
inferred← citeshttps://doi.org/10.1109/icaict.2010.5611806openalex-snapshot
Hardware design and implementation of 3780 points FFT based on FPGA in DTTB
inferred← citeshttps://doi.org/10.1109/icalip.2008.4590245openalex-snapshot
Efficient algorithms for MPEG-4 AAC-ELD, AAC-LD and AAC-LC filterbanks
inferred← citeshttps://doi.org/10.1109/icassp.1977.1170333openalex-snapshot
A method for programming the complex general-N Winograd Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/icassp.1979.1170654openalex-snapshot
New polynomial transform algorithms for fast DFT computation
inferred← citeshttps://doi.org/10.1109/icassp.1979.1170668openalex-snapshot
On complexity of fast convolution algorithms
inferred← citeshttps://doi.org/10.1109/icassp.1980.1170995openalex-snapshot
Floating point error bound in the prime factor FFT
inferred← citeshttps://doi.org/10.1109/icassp.1980.1171044openalex-snapshot
Signal processing and complexity of computation
inferred← citeshttps://doi.org/10.1109/icassp.1980.1171074openalex-snapshot
Doubling algorithms for Toeplitz and related equations
inferred← citeshttps://doi.org/10.1109/icassp.1981.1171232openalex-snapshot
Considerations in the implementation of an adaptive transform coder for speech in a 16-bit fixed point arithmetic microprocessor
inferred← citeshttps://doi.org/10.1109/icassp.1981.1171288openalex-snapshot
Cyclic convolution algorithms over finite fields: Multidimensional considerations
inferred← citeshttps://doi.org/10.1109/icassp.1982.1171518openalex-snapshot
A hardware digital processor for image bandwidth compression
inferred← citeshttps://doi.org/10.1109/icassp.1982.1171655openalex-snapshot
Two dimensional DFT using mixed time and frequency decimations
inferred← citeshttps://doi.org/10.1109/icassp.1982.1171668openalex-snapshot
A multi-channel microprogrammed FFT processor
inferred← citeshttps://doi.org/10.1109/icassp.1983.1172087openalex-snapshot
An in-place and in-order WFTA
inferred← citeshttps://doi.org/10.1109/icassp.1984.1172738openalex-snapshot
Hardware realization of Mersenne number transforms for fast digital convolution
inferred← citeshttps://doi.org/10.1109/icassp.1985.1168165openalex-snapshot
A systolic implementation of the Winograd Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/icassp.1985.1168329openalex-snapshot
Efficient architectures for implementing the prime-factor Fourier transform modules
inferred← citeshttps://doi.org/10.1109/icassp.1985.1168331openalex-snapshot
Multiply/Add tradeoffs in length-2>sup /sup
inferred← citeshttps://doi.org/10.1109/icassp.1986.1169079openalex-snapshot
Optimal design of multiplierless DFTS and FFTS
inferred← citeshttps://doi.org/10.1109/icassp.1986.1169089openalex-snapshot
FFT and convolution algorithms on DSP microprocessors
inferred← citeshttps://doi.org/10.1109/icassp.1988.196997openalex-snapshot
A nesting algorithm for very fast discrete Fourier transforms
inferred← citeshttps://doi.org/10.1109/icassp.1988.196998openalex-snapshot
Fast algorithms for the real discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/icassp.1989.266631openalex-snapshot
Implementing algorithms for convolution on arrays of adders
inferred← citeshttps://doi.org/10.1109/icassp.1990.115691openalex-snapshot
Yet a faster address generation scheme for the computation of prime factor algorithms
inferred← citeshttps://doi.org/10.1109/icassp.1990.115906openalex-snapshot
A new parallel algorithm for the multidimensional Fourier transform processing
inferred← citeshttps://doi.org/10.1109/icassp.1990.115996openalex-snapshot
VLSI architectures for digital image coding
inferred← citeshttps://doi.org/10.1109/icassp.1991.150564openalex-snapshot
The arithmetic cube II: a second generation VLSI DSP processor
inferred← citeshttps://doi.org/10.1109/icassp.1991.151080openalex-snapshot
The new algorithms for 2-dimensional FFT with prime size
inferred← citeshttps://doi.org/10.1109/icassp.2000.860100openalex-snapshot
Explicit Cook-Toom algorithm for linear convolution
inferred← citeshttps://doi.org/10.1109/icassp.2000.860116openalex-snapshot
A new radix-6 FFT algorithm suitable for multiply-add instruction
inferred← citeshttps://doi.org/10.1109/icassp.2002.1005369openalex-snapshot
Reduce FFT memory reference for low power applications
inferred← citeshttps://doi.org/10.1109/icassp.2003.1202454openalex-snapshot
A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method
inferred← citeshttps://doi.org/10.1109/icassp.2012.6288209openalex-snapshot
Correlation and convolution of image data using fermat number transform based on two's complement
inferred← citeshttps://doi.org/10.1109/icassp.2016.7471829openalex-snapshot
A generator of memory-based, runtime-reconfigurable 2N3M5KFFT engines
inferred← citeshttps://doi.org/10.1109/icc.2014.6884123openalex-snapshot
Co-prime sampling for higher-order statistics with application to LTE channel estimation
inferred← citeshttps://doi.org/10.1109/icdsp.2009.5201151openalex-snapshot
Radix-4 FFT algorithms with ordered input and output data
inferred← citeshttps://doi.org/10.1109/icdsp.2015.7251982openalex-snapshot
Cost-efficient mapping of 3- and 5-point DFTs to general baseband processors
inferred← citeshttps://doi.org/10.1109/icecc.2011.6066463openalex-snapshot
A high performance FFT library with single instruction multiple data (SIMD) architecture
inferred← citeshttps://doi.org/10.1109/icip40778.2020.9191304openalex-snapshot
Piecewise Polynomial Approximation Method for Convolution With Large Kernel
inferred← citeshttps://doi.org/10.1109/icme.2003.1221749openalex-snapshot
A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method
inferred← citeshttps://doi.org/10.1109/icsip.2010.5697523openalex-snapshot
FPGA implementation Of FFT processor with OFDM transceiver
inferred← citeshttps://doi.org/10.1109/icvd.1992.658051openalex-snapshot
ECube: An Efficient Architecture for Analyzing Time-Varying Spectra
inferred← citeshttps://doi.org/10.1109/icvd.1995.512112openalex-snapshot
JAGUAR: a high speed VLSI chip for JPEG image compression standard
inferred← citeshttps://doi.org/10.1109/imtc.2007.379470openalex-snapshot
Configurable and Expandable FFT Processor for Wideband Communication
inferred← citeshttps://doi.org/10.1109/indel.2016.7797810openalex-snapshot
Reduced FFT algorithm for network voltage disturbances detection
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015572openalex-snapshot
Twiddle-factor-based FFT algorithm with reduced memory access
inferred← citeshttps://doi.org/10.1109/ipps.1991.153775openalex-snapshot
Trade-offs in mapping FFT computations onto fixed size mesh processor array
inferred← citeshttps://doi.org/10.1109/iscas.1993.393766openalex-snapshot
Generation of equivalent block parallel digital filters and algorithms by a linear transformation
inferred← citeshttps://doi.org/10.1109/iscas.1993.394081openalex-snapshot
Systolic array for 2D circular convolution using the Chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/iscas.1993.692689openalex-snapshot
Generation of equivalent block parallel digital filters and algorithms by a linear transformation
inferred← citeshttps://doi.org/10.1109/iscas.1993.693006openalex-snapshot
Systolic array for 2-D circular convolution using the chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205932openalex-snapshot
A new memory reference reduction method for FFT implementation on DSP
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865556openalex-snapshot
The design of low complexity low power pipelined short length Winograd Fourier transforms
inferred← citeshttps://doi.org/10.1109/isce.2009.5156962openalex-snapshot
Memory usage reduction method for FFT implementations on DSP based embedded system
inferred← citeshttps://doi.org/10.1109/isce.2011.5973843openalex-snapshot
Pseudo-Radix FFT for multi-core embedded platform
inferred← citeshttps://doi.org/10.1109/isocc.2012.6407097openalex-snapshot
A multi-core mapping implementation of 3780-point FFT
inferred← citeshttps://doi.org/10.1109/issoc.2006.321993openalex-snapshot
Non-Power-of-Two FFTs: Exploring the Flexibility of the MONTIUM
inferred← citeshttps://doi.org/10.1109/isspit47144.2019.9001739openalex-snapshot
Fast Continuous Wavelet Transform for Brain Computer Interface using piecewise polynomials
inferred← citeshttps://doi.org/10.1109/jas.2024.124233openalex-snapshot
Learning Sequential and Structural Dependencies Between Nucleotides for RNA N6-Methyladenosine Site Identification
inferred← citeshttps://doi.org/10.1109/jlt.2012.2234083openalex-snapshot
Effect of Mode Coupling on Signal Processing Complexity in Mode-Division Multiplexing
inferred← citeshttps://doi.org/10.1109/jlt.2018.2877479openalex-snapshot
Low-Complexity Real-Time Receiver for Coherent Nyquist-FDM Signals
inferred← citeshttps://doi.org/10.1109/joe.2013.2278786openalex-snapshot
Image-Processing-Based Transceiver Design for Acoustic PPM Underwater Links
inferred← citeshttps://doi.org/10.1109/jproc.2004.840301openalex-snapshot
The Design and Implementation of FFTW3
inferred← citeshttps://doi.org/10.1109/jsac.2019.2904364openalex-snapshot
AuDI: Toward Autonomous IoT Device-Type Identification Using Periodic Communication
inferred← citeshttps://doi.org/10.1109/jssc.1984.1052211openalex-snapshot
A radix 4 delay commutator for fast Fourier transform processor implementation
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/lra.2021.3072570openalex-snapshot
DMD-Based Background Flow Sensing for AUVs in Flow Pattern Changing Environments
inferred← citeshttps://doi.org/10.1109/lsp.2004.833587openalex-snapshot
Multiplierless Winograd and Prime Factor FFT Implementation
inferred← citeshttps://doi.org/10.1109/lsp.2008.2003993openalex-snapshot
Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data
inferred← citeshttps://doi.org/10.1109/lsp.2024.3378104openalex-snapshot
HIFI-Net: A Novel Network for Enhancement to Underwater Optical Images
inferred← citeshttps://doi.org/10.1109/meco52532.2021.9460240openalex-snapshot
Rules for Optimal Static Tasks Scheduling in Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/ngcas.2017.38openalex-snapshot
Approximate Arai DCT Architecture for HEVC
inferred← citeshttps://doi.org/10.1109/percomworkshops48775.2020.9156144openalex-snapshot
Invited Paper: mmMoReEdge: A mmWave Modular and Reconfigurable Testbed Design using a Smart Edge Framework
inferred← citeshttps://doi.org/10.1109/proc.1985.13271openalex-snapshot
A prime factor FFT algorithm with real valued arithmetic
inferred← citeshttps://doi.org/10.1109/radar.2014.6875740openalex-snapshot
Efficient phase-modulated waveform design for active sensing systems
inferred← citeshttps://doi.org/10.1109/reconfig.2010.13openalex-snapshot
Accelerating 2D FFT with Non-Power-of-Two Problem Size on FPGA
inferred← citeshttps://doi.org/10.1109/reconfig.2014.7032558openalex-snapshot
Stochastically computing discrete Fourier transform with reconfigurable digital fabric
inferred← citeshttps://doi.org/10.1109/samos.2016.7818348openalex-snapshot
Hardware-efficient index mapping for mixed radix-2/3/4/5 FFTs
inferred← citeshttps://doi.org/10.1109/secon.1990.117916openalex-snapshot
Comparison of a new multiple radix fast Fourier number theoretic transform with FFT algorithms in terms of performance and hardware cost
inferred← citeshttps://doi.org/10.1109/sips.2016.43openalex-snapshot
Hardware-Efficient Twiddle Factor Generator for Mixed Radix-2/3/4/5 FFTs
inferred← citeshttps://doi.org/10.1109/sips.2017.8110009openalex-snapshot
Odd type DCT/DST for video coding: Relationships and low-complexity implementations
inferred← citeshttps://doi.org/10.1109/ssci.2017.8280890openalex-snapshot
Image approach to voice recognition
inferred← citeshttps://doi.org/10.1109/taslp.2014.2327300openalex-snapshot
Low Complexity Formant Estimation Adaptive Feedback Cancellation for Hearing Aids Using Pitch Based Processing
inferred← citeshttps://doi.org/10.1109/taslp.2014.2346314openalex-snapshot
Fast Algorithms for Low-Delay TDAC Filterbanks in MPEG-4 AAC-ELD
inferred← citeshttps://doi.org/10.1109/tassp.1978.1163150openalex-snapshot
A fast computation of complex convolution using a hybrid transform
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163216openalex-snapshot
Fast computation of discrete Fourier transforms using polynomial transforms
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163258openalex-snapshot
Some good fields and rings for computing number theoretic transforms
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163263openalex-snapshot
A winograd-Fourier transform algorithm for real-valued data
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163270openalex-snapshot
A prescription of winograd's discrete Fourier transform algorithm
inferred← citeshttps://doi.org/10.1109/tassp.1979.1163272openalex-snapshot
Bounds on the minimum number of data transfers in WFTA and FFT programs
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163372openalex-snapshot
Fast polynomial transform algorithms for digital convolution
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163425openalex-snapshot
Discrete transforms over polynomial rings with applications in computing multidimensional convolutions
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163436openalex-snapshot
High-speed computation of autocorrelation using rectangular transforms
inferred← citeshttps://doi.org/10.1109/tassp.1980.1163451openalex-snapshot
Complex rectangular transforms for digital convolution
inferred← citeshttps://doi.org/10.1109/tassp.1981.1163510openalex-snapshot
New polynomial transform algorithms for multidimensional DFT's and convolutions
inferred← citeshttps://doi.org/10.1109/tassp.1981.1163637openalex-snapshot
Floating point roundoff error in the prime factor FFT
inferred← citeshttps://doi.org/10.1109/tassp.1981.1163645openalex-snapshot
An in-place, in-order prime factor FFT algorithm
inferred← citeshttps://doi.org/10.1109/tassp.1982.1163875openalex-snapshot
A prime factor FTT algorithm using distributed arithmetic
inferred← citeshttps://doi.org/10.1109/tassp.1982.1163935openalex-snapshot
Very fast computation of the radix-2 discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tassp.1983.1164034openalex-snapshot
Recursive discrete Fourier transformation with unevenly spaced data
inferred← citeshttps://doi.org/10.1109/tassp.1983.1164054openalex-snapshot
Comments on "Selection criteria for efficient implementation of FFT algorithms
inferred← citeshttps://doi.org/10.1109/tassp.1983.1164071openalex-snapshot
The design of optimal DFT algorithms using dynamic programming
inferred← citeshttps://doi.org/10.1109/tassp.1983.1164081openalex-snapshot
New algorithms for the multidimensional discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tassp.1983.1164159openalex-snapshot
Number theoretic transforms for the calculation of convolutions
inferred← citeshttps://doi.org/10.1109/tassp.1984.1164353openalex-snapshot
Number theoretic techniques for computation of digital convolution
inferred← citeshttps://doi.org/10.1109/tassp.1984.1164395openalex-snapshot
Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tassp.1985.1164684openalex-snapshot
A new discrete Fourier transform algorithm using butterfly structure fast convolution
inferred← citeshttps://doi.org/10.1109/tassp.1985.1164687openalex-snapshot
On computing the discrete Hartley transform
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164785openalex-snapshot
On the number of multiplications necessary to compute a length-2nDFT
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164797openalex-snapshot
Higher radix aperiodic-convolution algorithms
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164804openalex-snapshot
On computing the split-radix FFT
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164811openalex-snapshot
Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164883openalex-snapshot
Fast algorithms for the multidimensional discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164888openalex-snapshot
A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165093openalex-snapshot
Architectures for multiplierless fast Fourier transform hardware implementation in VLSI
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165202openalex-snapshot
A two-stage representation of DFT and its applications
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165220openalex-snapshot
Real-valued fast Fourier transform algorithms
inferred← citeshttps://doi.org/10.1109/tc.1980.1675565openalex-snapshot
A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points
inferred← citeshttps://doi.org/10.1109/tc.1984.1676458openalex-snapshot
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
inferred← citeshttps://doi.org/10.1109/tc.1985.1676558openalex-snapshot
Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions
inferred← citeshttps://doi.org/10.1109/tc.1987.1676877openalex-snapshot
The Fast Hartley Transform Algorithm
inferred← citeshttps://doi.org/10.1109/tc.1987.5009467openalex-snapshot
VLSI Architectures for Multidimensional Fourier Transform Processing
inferred← citeshttps://doi.org/10.1109/tc.1987.5009473openalex-snapshot
The Arithmetic Cube
inferred← citeshttps://doi.org/10.1109/tcad.1986.1270211openalex-snapshot
A System for Designing, Simulating, and Testing High Performance VLSI Signal Processors
inferred← citeshttps://doi.org/10.1109/tce.2010.5681072openalex-snapshot
A power-of-two FFT algorithm and structure for DRM receiver
inferred← citeshttps://doi.org/10.1109/tce.2022.3163345openalex-snapshot
Hardware-Friendly Multiple Transform Selection Module for the VVC Standard
showing the first 200 of 279 · page through all 279
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.