Signal flow graph approach to efficient and forward stable DST algorithms

DOI10.1016/j.laa.2017.05.050zbMath1416.65569OpenAlexW2623981645MaRDI QIDQ2002787

Sirani M. Perera

Publication date: 12 July 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.050

zbMATH Keywords

arithmetic complexitydiscrete sine transformsignal flow graphsefficient and recursive algorithmserror bound and stabilitysparse and orthogonal matrices

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (1)

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

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art
• A tutorial overview on the properties of the discrete cosine transform for encoded image and video processing
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
• Fast Fourier transform: algorithms and applications
• The discrete W transform
• 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
• Fast and Stable Algorithms for Discrete Sine Transformations having Orthogonal Factors
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Sinusoidal Family of Unitary Transforms
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• 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 Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Jointly Optimized Spatial Prediction and Block Transform for Video and Image Coding

This page was built for publication: Signal flow graph approach to efficient and forward stable DST algorithms