Signal flow graph approach to efficient and forward stable DST algorithms

DOI10.1016/J.LAA.2017.05.050MaRDI QIDQ2002787zbMATH OpenOpenAlexFDO

Authors 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 transformefficient and recursive algorithmserror bound and stabilitysignal flow graphssparse and orthogonal matrices

Mathematics Subject Classification ID

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

Recommendations

• Fast and stable algorithms for discrete sine transformations having orthogonal factors
• A fast recursive algorithm for the discrete sine transform
• Fast discrete sine transform algorithms
• scientific article; zbMATH DE number 1737498
• Discrete sine transform and its inverse - realization through recursive algorithms

Cites work

• A Fast Computational Algorithm for the Discrete Cosine Transform
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• A Sinusoidal Family of Unitary Transforms
• 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
• Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
• Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Fast and numerically stable algorithms for discrete cosine transforms
• Fast and stable algorithms for discrete sine transformations having orthogonal factors
• Fast Fourier transform: algorithms and applications
• scientific article; zbMATH DE number 4002053 (Why is no real title available?)
• scientific article; zbMATH DE number 47594 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 1974609 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• Jointly Optimized Spatial Prediction and Block Transform for Video and Image Coding
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
• Roundoff error analysis for fast trigonometric transforms
• Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• The Discrete Cosine Transform
• The discrete W transform

Cited in

(4)

• Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
• scientific article; zbMATH DE number 35407 (Why is no real title available?)
• A low-complexity algorithm to search for Legendre pairs
• Algorithms for a small-sized type II discrete Fourier transform

Describes a project that uses

Uses Software

• mctoolbox

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002787)