A Fast Computational Algorithm for the Discrete Sine Transform

DOI10.1109/TCOM.1980.1094656MaRDI QIDQ3856093zbMATH OpenFDO

Authors

Publication date 1980

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1980.1094656

zbMATH Keywords

discrete cosine transformdiscrete sine transformefficient algorithmsparse-matrix factorization

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• Fast progressive reconstruction of images using the DCT
• Signal flow graph approach to efficient and forward stable DST algorithms
• Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
• Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
• Lowest complexity self-recursive radix-2 DCT II/III algorithms

This page was built for publication: A Fast Computational Algorithm for the Discrete Sine Transform

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