On the public citation graph
New polynomial transform algorithm for multidimensional DCT
0 signed · 43 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.1016/0141-9331(85)90186-3openalex-snapshot
Fast algorithms for digital signal processing
inferredcites →https://doi.org/10.1109/31.101322openalex-snapshot
Fast algorithm and implementation of 2-D discrete cosine transform
inferredcites →https://doi.org/10.1109/36.368225openalex-snapshot
Compression of hyperspectral imagery using the 3-D DCT and hybrid DPCM/DCT
inferredcites →https://doi.org/10.1109/78.157218openalex-snapshot
Fast algorithms for the discrete cosine transform
inferredcites →https://doi.org/10.1109/82.769810openalex-snapshot
A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding
inferredcites →https://doi.org/10.1109/82.803476openalex-snapshot
Exploring scalable schedules for IIR filters with resource constraints
inferredcites →https://doi.org/10.1109/83.568933openalex-snapshot
Variable temporal-length 3-D discrete cosine transform coding
inferredcites →https://doi.org/10.1109/icassp.1990.115696openalex-snapshot
Polynomial transform computation of the 2-D DCT
inferredcites →https://doi.org/10.1109/icassp.1996.543676openalex-snapshot
A polynomial-transform based computation of the 2-D DCT with minimum multiplicative complexity
inferredcites →https://doi.org/10.1109/tassp.1981.1163510openalex-snapshot
New polynomial transform algorithms for multidimensional DFT's and convolutions
inferredcites →https://doi.org/10.1109/tassp.1984.1164443openalex-snapshot
A new algorithm to compute the discrete cosine 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/978-0-8176-8220-0_2openalex-snapshot
Polynomial Transforms and Their Fast Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-8176-8220-0_7openalex-snapshot
Fast Algorithms for MD Discrete Cosine Transform
inferred← citeshttps://doi.org/10.1007/978-0-8176-8220-0_8openalex-snapshot
Integer Transforms and Fast Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-23766-4_53openalex-snapshot
Novel Method for Fast 3D DCT for Video Compression
inferred← citeshttps://doi.org/10.1007/s00034-018-0768-xopenalex-snapshot
Pruned Discrete Tchebichef Transform Approximation for Image Compression
inferred← citeshttps://doi.org/10.1007/s00034-020-01557-wopenalex-snapshot
Performance Improvement of Vector-Radix Decimation-in-Frequency 3D-DCT/IDCT Using Variable Word Length
inferred← citeshttps://doi.org/10.1016/b978-012373624-6/50003-5openalex-snapshot
Discrete Cosine and Sine Transforms
inferred← citeshttps://doi.org/10.1016/j.dsp.2016.07.011openalex-snapshot
Two-dimensional discrete cosine transform on sliding windows
inferred← citeshttps://doi.org/10.1016/j.sigpro.2007.12.003openalex-snapshot
A fast algorithm for the computation of 2-D forward and inverse MDCT
inferred← citeshttps://doi.org/10.1016/j.sigpro.2012.08.023openalex-snapshot
Sampling rate conversion based on DFT and DCT
inferred← citeshttps://doi.org/10.1017/cbo9780511760921openalex-snapshot
Fast Algorithms for Signal Processing
inferred← citeshttps://doi.org/10.1049/ip-vis:20010317openalex-snapshot
New fast algorithm for multidimensional type-IV DCT
inferred← citeshttps://doi.org/10.1109/icassp.2001.941134openalex-snapshot
Integer sinusoidal transforms based on lifting factorization
inferred← citeshttps://doi.org/10.1109/icics.2009.5397517openalex-snapshot
Reassignment methods for robust time-frequency representations
inferred← citeshttps://doi.org/10.1109/iciea.2012.6360765openalex-snapshot
FFT-based sampling rate conversion
inferred← citeshttps://doi.org/10.1109/iciea.2013.6566584openalex-snapshot
Sampling rate conversion based on DCT-II/III
inferred← citeshttps://doi.org/10.1109/iscas.2004.1328769openalex-snapshot
Condensed recursive structures for computing multi-dimensional DCT with arbitrary length
inferred← citeshttps://doi.org/10.1109/spcom.2010.5560534openalex-snapshot
New polynomial transform algorithm for 2-D DCT using Ramanujan ordered numbers
inferred← citeshttps://doi.org/10.1109/tcsi.2005.852935openalex-snapshot
Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length
inferred← citeshttps://doi.org/10.1109/tip.2017.2679442openalex-snapshot
Low-Complexity Multidimensional DCT Approximations for High-Order Tensor Data Decorrelation
inferred← citeshttps://doi.org/10.1109/tsp.2002.806558openalex-snapshot
A fast algorithm for computing multidimensional dct on certain small sizes
inferred← citeshttps://doi.org/10.1109/tsp.2004.823472openalex-snapshot
Fast Algorithm for the 3-D DCT-II
inferred← citeshttps://doi.org/10.1109/tsp.2005.850355openalex-snapshot
Bidirectional conversion between DCT coefficients of blocks and their subblocks
inferred← citeshttps://doi.org/10.1109/tsp.2005.851115openalex-snapshot
Fast algorithms for multidimensional DCT-to-DCT computation between a block and its associated subblocks
inferred← citeshttps://doi.org/10.1117/1.2804710openalex-snapshot
Enlargement and reduction of image/video via discrete cosine transform pair, part 1: novel three-dimensional discrete cosine transform and enlargement
inferred← citeshttps://doi.org/10.1117/1.jei.33.1.013011openalex-snapshot
Robust video hashing based on deep feature and quaternion generic Fourier descriptor for copy detection
inferred← citeshttps://doi.org/10.1137/070693370openalex-snapshot
Fast Three-Dimensional Discrete Cosine Transform
inferred← citeshttps://doi.org/10.1137/s1064827501394830openalex-snapshot
Fast Computation of MD-DCT-IV/MD-DST-IV by MD-DWT or MD-DCT-II
inferred← citeshttps://doi.org/10.5772/50716openalex-snapshot
C-Space Compression for Robots Motion Planning
inferred← citeshttps://doi.org/10.7763/ijcee.2012.v4.545openalex-snapshot
Multidimensional Fast Multiplierless DCT Algorithm Using Ramanujan Ordered Numbers
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.