On the public citation graph

The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms

0 signed · 39 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/bf01599167openalex-snapshot
Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
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.1080/00207217808900821openalex-snapshot
Comparative performance of various trigonometric unitary transforms for transform image coding
inferredcites →https://doi.org/10.1109/icassp.1985.1168246openalex-snapshot
DIF Algorithms for DCT and DST
inferredcites →https://doi.org/10.1109/t-c.1974.223784openalex-snapshot
Discrete Cosine Transform
inferredcites →https://doi.org/10.1109/tassp.1984.1164399openalex-snapshot
Fast algorithms for the discrete W transform and for the discrete Fourier transform
inferredcites →https://doi.org/10.1109/tassp.1984.1164443openalex-snapshot
A new algorithm to compute the discrete cosine Transform
inferredcites →https://doi.org/10.1109/tassp.1985.1164710openalex-snapshot
On computing the discrete Fourier and cosine transforms
inferredcites →https://doi.org/10.1109/tassp.1986.1164854openalex-snapshot
Fast algorithms for the DFT and other sinusoidal transforms
inferredcites →https://doi.org/10.1109/tc.1980.1675570openalex-snapshot
A Symmetric Cosine Transform
inferredcites →https://doi.org/10.1109/tcom.1976.1093409openalex-snapshot
A Fast Karhunen-Loeve Transform for a Class of Random Processes
inferredcites →https://doi.org/10.1109/tcom.1977.1093941openalex-snapshot
A Fast Computational Algorithm for the Discrete Cosine Transform
inferredcites →https://doi.org/10.1109/tcom.1980.1094656openalex-snapshot
A Fast Computational Algorithm for the Discrete Sine 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/3-540-45350-4_14openalex-snapshot
Code Generators for Automatic Tuning of Numerical Kernels: Experiences with FFTW Position Paper
inferred← citeshttps://doi.org/10.1007/bf00930645openalex-snapshot
Multidimensional fourier transforms by systolic architectures
inferred← citeshttps://doi.org/10.1007/bf01599762openalex-snapshot
Fast prime factor decomposition algorithms for a family of discrete trigonometric transforms
inferred← citeshttps://doi.org/10.1007/s11045-014-0291-6openalex-snapshot
An orthogonal 16-point approximate DCT for image and video compression
inferred← citeshttps://doi.org/10.1007/s11045-018-0601-5openalex-snapshot
Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
inferred← citeshttps://doi.org/10.1007/s11265-023-01848-wopenalex-snapshot
Extensions on Low-Complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
inferred← citeshttps://doi.org/10.1007/s40314-019-0971-9openalex-snapshot
The eigen-structures of real (skew) circulant matrices with some applications
inferred← citeshttps://doi.org/10.1016/b978-0-08-092534-9.50028-xopenalex-snapshot
REFERENCES
inferred← citeshttps://doi.org/10.1016/j.proeng.2012.01.883openalex-snapshot
Systolic Architecture for Implementation of 2-D Discrete Sine Transform
inferred← citeshttps://doi.org/10.1016/s0165-1684(03)00109-9openalex-snapshot
The fast DCT-IV/DST-IV computation via the MDCT
inferred← citeshttps://doi.org/10.1049/ip-f-2.1990.0063openalex-snapshot
Direct methods for computing discrete sinusoidal transforms
inferred← citeshttps://doi.org/10.1080/00207219208925663openalex-snapshot
A fault detecting DCT architecture
inferred← citeshttps://doi.org/10.1109/78.298269openalex-snapshot
Restructured recursive DCT and DST algorithms
inferred← citeshttps://doi.org/10.1109/78.301848openalex-snapshot
Efficient direction-finding methods employing forward/backward averaging
inferred← citeshttps://doi.org/10.1109/78.80852openalex-snapshot
Cepstrum analysis using discrete trigonometric transforms
inferred← citeshttps://doi.org/10.1109/78.942628openalex-snapshot
Automatic generation of fast discrete signal transforms
inferred← citeshttps://doi.org/10.1109/82.127302openalex-snapshot
Fast algorithms for computing the discrete cosine transform
inferred← citeshttps://doi.org/10.1109/acssc.1989.1200843openalex-snapshot
Split-radix algorithms for DCT and DST
inferred← citeshttps://doi.org/10.1109/icassp.1991.150852openalex-snapshot
Regular FFT-related transform kernels for DCT/DST-based polyphase filter banks
inferred← citeshttps://doi.org/10.1109/naecon.1995.521959openalex-snapshot
A new radix-3 fast algorithm for computing the DST-II
inferred← citeshttps://doi.org/10.1109/rteict.2016.7808042openalex-snapshot
FPGA based area optimized parallel pipelined radix-22feed forward FFT architecture
inferred← citeshttps://doi.org/10.1109/tmm.2003.819761openalex-snapshot
Low-Complexity and High-Quality Frame-Skipping Transcoder for Continuous Presence Multipoint Video Conferencing
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/s009753970139272xopenalex-snapshot
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
inferred← citeshttps://doi.org/10.1145/212066.212071openalex-snapshot
Algorithm 749: fast discrete cosine transform
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.