Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms

DOI10.1137/17M1114557zbMath1391.65121MaRDI QIDQ4643325

Sirani M. Perera, Jianhua Liu

Publication date: 24 May 2018

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

image compressiondiscrete cosine transformsignal flow graphlowest multiplication complexityradix-2 algorithmself-recursive algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Orthogonal matrices (15B10) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning
• Fast Fourier transform: algorithms and applications
• Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type
• Fast and numerically stable algorithms for discrete cosine transforms
• Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors
• Algebraic Signal Processing Theory: Cooley–Tukey-Type Algorithms for Polynomial Transforms Based on Induction
• Deblurring Images
• Fast and Stable Algorithms for Discrete Sine Transformations having Orthogonal Factors
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• On computing the discrete Fourier and cosine transforms
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Sinusoidal Family of Unitary Transforms
• A Fast Computational Algorithm for the Discrete Cosine Transform
• The Discrete Cosine Transform
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
• Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
• A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
• Discrete Cosine Transform
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• Jointly Optimized Spatial Prediction and Block Transform for Video and Image Coding

This page was built for publication: Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms