On the public citation graph

A new efficient algorithm to compute the two-dimensional discrete Fourier transform

0 signed · 74 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/978-3-662-00551-4openalex-snapshot
Fast Fourier Transform and Convolution Algorithms
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1109/tassp.1979.1163216openalex-snapshot
Fast computation of discrete Fourier transforms using polynomial transforms
inferredcites →https://doi.org/10.1109/tassp.1983.1164081openalex-snapshot
New algorithms for the multidimensional discrete Fourier transform
inferredcites →https://doi.org/10.1109/tassp.1986.1164800openalex-snapshot
Fast algorithms for digital signal processing

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jsid.680openalex-snapshot
Virtual viewpoints reconstruction via Fourier slice transformation
inferred← citeshttps://doi.org/10.1007/978-1-4612-1948-4_11openalex-snapshot
Implementation on Parallel Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4612-1948-4_7openalex-snapshot
Duality of Lines and Planes
inferred← citeshttps://doi.org/10.1007/978-1-4612-1948-4_8openalex-snapshot
Reduced Transform Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4684-0205-6_11openalex-snapshot
Implementation on Parallel Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4684-0205-6_7openalex-snapshot
Duality of Lines and Planes
inferred← citeshttps://doi.org/10.1007/978-1-4684-0205-6_8openalex-snapshot
Reduced Transform Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2767-8_8openalex-snapshot
Multiplicative Fourier Transform Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3854-4_8openalex-snapshot
Introduction to Multiplicative Fourier Transform Algorithm (MFTA)
inferred← citeshttps://doi.org/10.1007/978-94-010-0662-0_8openalex-snapshot
Lesser Known FFT Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-011-1028-0_19openalex-snapshot
Texture analysis with Hermite basic elementary functions
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90113-lopenalex-snapshot
A systolic array for inversion of a finite Radon transform
inferred← citeshttps://doi.org/10.1016/1047-3203(92)90027-qopenalex-snapshot
The finite Zak transform: An efficient tool for image representation and analysis
inferred← citeshttps://doi.org/10.1016/s0031-3203(97)00035-6openalex-snapshot
On the efficient computation of 2-d image moments using the discrete radon transform
inferred← citeshttps://doi.org/10.1016/s0065-2539(08)60607-1openalex-snapshot
Discrete Fast fourier Transorm Algorithms: A Tutorial Survey
inferred← citeshttps://doi.org/10.1016/s0165-1684(00)00110-9openalex-snapshot
Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution
inferred← citeshttps://doi.org/10.1016/s0165-1684(02)00498-xopenalex-snapshot
Orthogonal discrete periodic Radon transform. Part I: theory and realization
inferred← citeshttps://doi.org/10.1016/s1076-5670(07)00403-xopenalex-snapshot
Generalized Discrete Radon Transforms and Applications to Image Processing
inferred← citeshttps://doi.org/10.1016/s1076-5670(08)70132-0openalex-snapshot
Group Invariant Fourier Transform Algorinthms
inferred← citeshttps://doi.org/10.1017/cbo9780511760921openalex-snapshot
Fast Algorithms for Signal Processing
inferred← citeshttps://doi.org/10.1049/el:19891140openalex-snapshot
New fast algorithm to compute two-dimensional discrete Hartley transform
inferred← citeshttps://doi.org/10.1049/el:19900358openalex-snapshot
Fast discrete Radon transform and 2-D discrete Fourier transform
inferred← citeshttps://doi.org/10.1049/el:19901150openalex-snapshot
Algorithm for computing two-dimensional discrete Hartley transform of size p n × p n
inferred← citeshttps://doi.org/10.1049/iet-cvi.2013.0101openalex-snapshot
Exact image representation via a number‐theoretic Radon transform
inferred← citeshttps://doi.org/10.1049/ip-vis:19990021openalex-snapshot
Recursive fast computation of the two-dimensional discrete cosine transform
inferred← citeshttps://doi.org/10.1080/1206212x.2007.11441846openalex-snapshot
Parallel Implementations of 1-D Fast Fourier Transform Without Interprocessor Communication
inferred← citeshttps://doi.org/10.1109/12.795223openalex-snapshot
Parallel implementation of multidimensional transforms without interprocessor communication
inferred← citeshttps://doi.org/10.1109/43.31549openalex-snapshot
Design automation tools for efficient implementation of logic functions by decomposition
inferred← citeshttps://doi.org/10.1109/71.80164openalex-snapshot
A parallel algorithm for 2-D DFT computation with no interprocessor communication
inferred← citeshttps://doi.org/10.1109/78.124963openalex-snapshot
On the efficiency of 'A new efficient algorithm to compute the two-dimensional discrete Fourier transform'
inferred← citeshttps://doi.org/10.1109/78.205759openalex-snapshot
Hexagonal fast Fourier transform with rectangular output
inferred← citeshttps://doi.org/10.1109/78.277855openalex-snapshot
Two-dimensional linear prediction and spectral estimation on a polar raster
inferred← citeshttps://doi.org/10.1109/78.365307openalex-snapshot
A new approach for computing multidimensional DFT's on parallel machines and its implementation on the iPSC/860 hypercube
inferred← citeshttps://doi.org/10.1109/78.370632openalex-snapshot
Prime-factor DCT algorithms
inferred← citeshttps://doi.org/10.1109/78.539055openalex-snapshot
The discrete periodic Radon transform
inferred← citeshttps://doi.org/10.1109/78.796458openalex-snapshot
A parallel implementation of the 2-D discrete wavelet transform without interprocessor communications
inferred← citeshttps://doi.org/10.1109/78.942642openalex-snapshot
Prime factor algorithm for multidimensional discrete cosine transform
inferred← citeshttps://doi.org/10.1109/dicta.2009.67openalex-snapshot
A Fast Number Theoretic Finite Radon Transform
inferred← citeshttps://doi.org/10.1109/icassp.1990.115919openalex-snapshot
A method for fast approximate computation of discrete time transforms
inferred← citeshttps://doi.org/10.1109/icassp.1993.319490openalex-snapshot
A hybrid parallel M-D FFT algorithm without interprocessor communication
inferred← citeshttps://doi.org/10.1109/icassp.1996.543671openalex-snapshot
Fast algorithm for 2-D image moments via the Radon transform
inferred← citeshttps://doi.org/10.1109/icif.2007.4408067openalex-snapshot
A novel image fusion algorithm using FRIT AND PCA
inferred← citeshttps://doi.org/10.1109/icip.2014.7025241openalex-snapshot
A scalable architecture for implementing the fast discrete periodic radon transform for prime sized images
inferred← citeshttps://doi.org/10.1109/icita.2005.32openalex-snapshot
A New Digital Implementation of Ridgelet Transform for Images of Dyadic Length
inferred← citeshttps://doi.org/10.1109/iscas.1991.176357openalex-snapshot
An efficient algorithm for computing two-dimensional discrete cosine transforms
inferred← citeshttps://doi.org/10.1109/iscas.1991.176416openalex-snapshot
Polynomial transform fast Hartley transform
inferred← citeshttps://doi.org/10.1109/iscas.1992.230149openalex-snapshot
An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform
inferred← citeshttps://doi.org/10.1109/iscas.1995.523787openalex-snapshot
On the convolution property of a new discrete Radon transform and its efficient inversion algorithm
inferred← citeshttps://doi.org/10.1109/iscas.1995.523853openalex-snapshot
Alternative architectures for the 2-D DCT algorithm
inferred← citeshttps://doi.org/10.1109/lsp.2014.2313341openalex-snapshot
Robust Digital Image Reconstruction via the Discrete Fourier Slice Theorem
inferred← citeshttps://doi.org/10.1109/lsp.2023.3311349openalex-snapshot
Non-Separable Two-Dimensional Hadamard Transform via a Discrete Hadamard Slice Theorem
inferred← citeshttps://doi.org/10.1109/lwc.2025.3644298openalex-snapshot
Two-Dimensional Frequency-Domain Adaptive Multi-Branch Sparse Equalization for OTFS Underwater Acoustic Communication
inferred← citeshttps://doi.org/10.1109/tencon.1990.152600openalex-snapshot
Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon transform
inferred← citeshttps://doi.org/10.1109/tip.2002.806252openalex-snapshot
The finite ridgelet transform for image representation
inferred← citeshttps://doi.org/10.1109/tip.2011.2128334openalex-snapshot
Principle of Superposition by Direction Images
inferred← citeshttps://doi.org/10.1109/tip.2012.2206033openalex-snapshot
Recovering Missing Slices of the Discrete Fourier Transform Using Ghosts
inferred← citeshttps://doi.org/10.1109/tip.2015.2501725openalex-snapshot
Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform
inferred← citeshttps://doi.org/10.1109/tsp.2002.1003072openalex-snapshot
Fast algorithms of multidimensional discrete nonseparable /spl Kscr/-wave transforms
inferred← citeshttps://doi.org/10.1109/tsp.2010.2059021openalex-snapshot
Reply to “Comments on ‘The Discrete Periodic Radon Transform’”
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.668006openalex-snapshot
A novel algorithm of image fusion using finite ridgelet transform
inferred← citeshttps://doi.org/10.1117/12.962331openalex-snapshot
Image Scanning According To Lines On Finite Fields
inferred← citeshttps://doi.org/10.2316/journal.202.2007.2.202-1995openalex-snapshot
PARALLEL IMPLEMENTATIONS OF 1-D FAST FOURIER TRANSFORM WITHOUT INTERPROCESSOR COMMUNICATION
inferred← citeshttps://doi.org/10.26053/0h-48tm-s7g0openalex-snapshot
Improving the image and quantitative data of magnetic resonance imaging through hardware and physics techniques
inferred← citeshttps://doi.org/10.3390/math11153336openalex-snapshot
On a Fast Hough/Radon Transform as a Compact Summation Scheme over Digital Straight Line Segments
inferred← citeshttps://doi.org/10.35530/it.073.02.202050openalex-snapshot
Development of a hat style recognition system based on image processing and machine learning
inferred← citeshttps://doi.org/10.48550/arxiv.1006.1965openalex-snapshot
Fast Mojette Transform for Discrete Tomography
inferred← citeshttps://doi.org/10.5075/epfl-thesis-2500openalex-snapshot
Directional multiresolution image representations
inferred← citeshttps://doi.org/10.5075/epfl-thesis-2555openalex-snapshot
Nondyadic and nonlinear multiresolution image approximations
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.