Fast and stable algorithms for discrete sine transformations having orthogonal factors

DOI10.1007/978-3-319-12307-3_50MaRDI QIDQ3459745zbMATH OpenOpenAlexFDO

Authors Sirani M. Perera, V. Olshevsky

Publication date 11 January 2016

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12307-3_50

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast and numerically stable algorithms for discrete cosine transforms
• Fast discrete sine transform algorithms
• A fast recursive algorithm for the discrete sine transform
• scientific article; zbMATH DE number 1190625
• scientific article; zbMATH DE number 613348

Cites work

• 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?)
• 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

Cited in

(5)

• Signal flow graph approach to efficient and forward stable DST algorithms
• Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
• A prime-factor decomposed algorithm for the discrete sine transform
• Lowest complexity self-recursive radix-2 DCT II/III algorithms
• Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms

This page was built for publication: Fast and stable algorithms for discrete sine transformations having orthogonal factors

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