On the public citation graph

Fast radix-p discrete cosine transform

https://doi.org/10.1007/bf01189022
0 signed · 33 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-0348-5685-0_22openalex-snapshot
Fast Algorithms for One- and Two-Dimensional Discrete Cosine Transforms
inferredcites →https://doi.org/10.1016/0022-247x(79)90230-0openalex-snapshot
On the L2 convergence of collocation for the generalized airfoil equation
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/b978-0-08-092534-9.50007-2openalex-snapshot
DISCRETE COSINE TRANSFORM
inferredcites →https://doi.org/10.1090/s0025-5718-1991-1052103-1openalex-snapshot
A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
inferredcites →https://doi.org/10.1093/imanum/8.4.473openalex-snapshot
Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
inferredcites →https://doi.org/10.1109/29.21686openalex-snapshot
Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
inferredcites →https://doi.org/10.1109/t-c.1974.223784openalex-snapshot
Discrete Cosine Transform
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/tc.1980.1675565openalex-snapshot
A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-7643-7398-9_4openalex-snapshot
On the Numerical Solution of a Nonlinear Integral Equation of Prandtl’s Type
inferred← citeshttps://doi.org/10.1007/978-3-030-04306-3_6openalex-snapshot
Chebyshev Methods and Fast DCT Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_13openalex-snapshot
Efficient Split-Radix and Radix-4 DCT Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-77497-4_7openalex-snapshot
Collocation and Collocation-Quadrature Methods for Strongly Singular Integral Equations
inferred← citeshttps://doi.org/10.1007/978-3-031-35005-4_6openalex-snapshot
Chebyshev Methods and Fast DCT Algorithms
inferred← citeshttps://doi.org/10.1007/bf02109186openalex-snapshot
Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
inferred← citeshttps://doi.org/10.1007/s10444-004-1828-2openalex-snapshot
Interpolating polynomial wavelets on [?1,1]
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00696-6openalex-snapshot
Fast polynomial multiplication and convolutions related to the discrete cosine transform
inferred← citeshttps://doi.org/10.1016/j.laa.2003.09.017openalex-snapshot
Fast scattered data approximation with Neumann and other boundary conditions
inferred← citeshttps://doi.org/10.1016/j.laa.2004.07.015openalex-snapshot
Fast and numerically stable algorithms for discrete cosine transforms
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10013-1openalex-snapshot
Fast and stable algorithms for discrete spherical Fourier transforms
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10024-6openalex-snapshot
Representations of Toeplitz-plus-Hankel matrices using trigonometric transformations with application to fast matrix-vector multiplication
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10025-8openalex-snapshot
Uniform convergence of a fast algorithm for Cauchy singular integral equations
inferred← citeshttps://doi.org/10.1016/s0377-0427(03)00546-6openalex-snapshot
Fast spherical Fourier algorithms
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00124-0openalex-snapshot
A fast algorithm for Prandtl's integro-differential equation
inferred← citeshttps://doi.org/10.1023/a:1021949431143openalex-snapshot
Simultaneous Polynomial Approximation in the Weighted Chebyshev Norm
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00975-2openalex-snapshot
Fast algorithms for discrete polynomial transforms
inferred← citeshttps://doi.org/10.1109/icassp.2003.1202413openalex-snapshot
Cooley-Tukey FFT like algorithms for the DCT
inferred← citeshttps://doi.org/10.1109/tsp.2007.907919openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
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.1137/100805777openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey-Type Algorithms for Polynomial Transforms Based on Induction
inferred← citeshttps://doi.org/10.48550/arxiv.math/0301152openalex-snapshot
Fast multi-dimensional scattered data approximation with Neumann boundary conditions
inferred← citeshttps://doi.org/10.53846/goediss-7572openalex-snapshot
Sparse Fast Trigonometric Transforms
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.