On the public citation graph
On the fixed-point-error analysis of several fast DCT algorithms
0 signed · 60 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/0165-1684(84)90059-8openalex-snapshot
Simple FFT and DCT algorithms with reduced number of operations
inferredcites →https://doi.org/10.1016/0165-1684(90)90111-bopenalex-snapshot
Fixed-point error analysis of fast Hartley transform
inferredcites →https://doi.org/10.1080/00207219208925553openalex-snapshot
Fixed-point round-off error analysis for the discrete cosine transform
inferredcites →https://doi.org/10.1109/29.45624openalex-snapshot
DCT algorithms for VLSI parallel implementations
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/82.224317openalex-snapshot
On the regular structure for the fast 2-D DCT algorithm
inferredcites →https://doi.org/10.1109/icassp.1981.1171100openalex-snapshot
Limited wordlength and FDCT processing accuracy
inferredcites →https://doi.org/10.1109/icassp.1985.1168211openalex-snapshot
Fast 2-D discrete cosine transform
inferredcites →https://doi.org/10.1109/icassp.1986.1169112openalex-snapshot
Performance of fixed-point FFT's: Rounding and scaling considerations
inferredcites →https://doi.org/10.1109/icassp.1989.266571openalex-snapshot
Error analysis and comparison of FFT implementation structures
inferredcites →https://doi.org/10.1109/icassp.1990.115696openalex-snapshot
Polynomial transform computation of the 2-D DCT
inferredcites →https://doi.org/10.1109/proc.1972.8820openalex-snapshot
Effects of finite register length in digital filtering and the fast 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.1164737openalex-snapshot
A two-dimensional fast cosine transform
inferredcites →https://doi.org/10.1109/tassp.1987.1165060openalex-snapshot
A fast recursive algorithm for computing the discrete cosine transform
inferredcites →https://doi.org/10.1109/tassp.1987.1165074openalex-snapshot
Quantization errors in the computation of the discrete Hartley transform
inferredcites →https://doi.org/10.1109/tcom.1977.1093763openalex-snapshot
Adaptive Coding of Monochrome and Color Images
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.1978.1094144openalex-snapshot
On the Computation of the Discrete Cosine Transform
inferredcites →https://doi.org/10.1109/tcom.1986.1096636openalex-snapshot
An Analysis of Error Behavior in the Implementation of 2-D Orthogonal Transformations
inferredcites →https://doi.org/10.1117/12.24228openalex-snapshot
VLSI architecture and implementation of a multifunction, forward/inverse discrete cosine transform processor
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-1-4419-6345-1_25openalex-snapshot
Optimization of Number Representations
inferred← citeshttps://doi.org/10.1007/978-1-4614-6859-2_40openalex-snapshot
Optimization of Number Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-91734-4_31openalex-snapshot
Optimization of Number Representations
inferred← citeshttps://doi.org/10.1007/s00034-021-01718-5openalex-snapshot
A Structured Fast Algorithm for the VLSI Pipeline Implementation of Inverse Discrete Cosine Transform
inferred← citeshttps://doi.org/10.1016/b978-0-12-396502-8.00008-5openalex-snapshot
Modern Transform Design for Practical Audio/Image/Video Coding Applications
inferred← citeshttps://doi.org/10.1016/b978-0-32-391772-8.00014-4openalex-snapshot
Modern transform design for practical audio/image/video coding applications
inferred← citeshttps://doi.org/10.1016/b978-012373624-6/50003-5openalex-snapshot
Discrete Cosine and Sine Transforms
inferred← citeshttps://doi.org/10.1109/26.387423openalex-snapshot
Discrete cosine transform in error control coding
inferred← citeshttps://doi.org/10.1109/5.687834openalex-snapshot
Algorithm-based low-power and high-performance multimedia signal processing
inferred← citeshttps://doi.org/10.1109/76.350776openalex-snapshot
High-throughput VLSI architectures for the 1-D and 2-D discrete cosine transforms
inferred← citeshttps://doi.org/10.1109/76.736720openalex-snapshot
Fixed-point error analysis and word length optimization of 8×8 IDCT architectures
inferred← citeshttps://doi.org/10.1109/78.558495openalex-snapshot
Fast algorithm for computing discrete cosine transform
inferred← citeshttps://doi.org/10.1109/78.969511openalex-snapshot
Fast multiplierless approximations of the DCT with the lifting scheme
inferred← citeshttps://doi.org/10.1109/82.475243openalex-snapshot
On the fixed-point error analysis of several fast IDCT algorithms
inferred← citeshttps://doi.org/10.1109/82.735357openalex-snapshot
Fixed-point optimization utility for C and C++ based digital signal processing programs
inferred← citeshttps://doi.org/10.1109/92.736144openalex-snapshot
Algorithm-based low-power transform coding architectures: the multirate approach
inferred← citeshttps://doi.org/10.1109/acssc.1994.471437openalex-snapshot
Fixed-point simulation utility for C and C++ based digital signal processing programs
inferred← citeshttps://doi.org/10.1109/acssc.1995.540815openalex-snapshot
Optimum wordlength determination of 8×8 IDCT architectures conforming to the IEEE standard specifications
inferred← citeshttps://doi.org/10.1109/apccas.1994.514527openalex-snapshot
A linear systolic array for the 2-D discrete cosine transform
inferred← citeshttps://doi.org/10.1109/asap.1996.542799openalex-snapshot
Finite word-length effects of an unified systolic array for 2-D DCT/IDCT
inferred← citeshttps://doi.org/10.1109/glocom.1998.776850openalex-snapshot
A fast algorithm for reduced-complexity programmable DSP implementation of the IFFT/FFT in DMT systems
inferred← citeshttps://doi.org/10.1109/icassp.2005.1416237openalex-snapshot
Simulation of DSP Algorithms on Fixed Point Architectures
inferred← citeshttps://doi.org/10.1109/iscas.1996.541814openalex-snapshot
Finite wordlength effects analysis and wordlength optimization of a multiplier-adder based 8×8 2D-IDCT architecture
inferred← citeshttps://doi.org/10.1109/iscas.1998.698796openalex-snapshot
Finite wordlength effects analysis and wordlength optimization of Dolby digital audio decoder
inferred← citeshttps://doi.org/10.1109/norchp.2008.4738293openalex-snapshot
Comparison of Fixed-Point Arithmetic Errors for the FPGA-Based CRAIMOT Basis Function Generators
inferred← citeshttps://doi.org/10.1109/tc.2017.2731770openalex-snapshot
Approximate DCT Image Compression Using Inexact Computing
inferred← citeshttps://doi.org/10.1109/tcsi.2003.820232openalex-snapshot
Fixed-Point Error Analysis of CORDIC Processor Based on the Variance Propagation Formula
inferred← citeshttps://doi.org/10.1109/tcsi.2008.2002918openalex-snapshot
Mixed-Radix Algorithm for the Computation of Forward and Inverse MDCTs
inferred← citeshttps://doi.org/10.1109/vlsisp.1996.558372openalex-snapshot
Fixed-point error analysis and wordlength optimization of a distributed arithmetic based 8×8 2D-IDCT architecture
inferred← citeshttps://doi.org/10.1117/1.2227000openalex-snapshot
Directionally classified eigenblocks for localized feature analysis in face recognition
inferred← citeshttps://doi.org/10.1145/3369412.3395059openalex-snapshot
Photo Forensics From Rounding Artifacts
inferred← citeshttps://doi.org/10.1155/s111086570220503xopenalex-snapshot
A Reduced-Complexity Fast Algorithm for Software Implementation of the IFFT/FFT in DMT Systems
inferred← citeshttps://doi.org/10.1186/s13639-016-0047-5openalex-snapshot
FPGA implementation of JPEG encoder architectures for wireless networks
inferred← citeshttps://doi.org/10.3390/jlpea2020127openalex-snapshot
VLSI Architecture for 8-Point AI-based Arai DCT having Low Area-Time Complexity and Power at Improved Accuracy
inferred← citeshttps://doi.org/10.48175/ijarsct-22970openalex-snapshot
Analysis and Implementation of Image Compression Approach Inexact Computing
inferred← citeshttps://doi.org/10.63844/ijaitr.v3.i1.2026.123-128openalex-snapshot
A Three Level Inexact Computing Framework for Efficient and Accurate Digital Image Compression Using Approximate DCT
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.