A Fast Computational Algorithm for the Discrete Sine Transform
From MaRDI portal
Publication:3856093
DOI10.1109/TCOM.1980.1094656zbMath0422.68008MaRDI QIDQ3856093
No author found.
Publication date: 1980
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (8)
The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ Signal flow graph approach to efficient and forward stable DST algorithms ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems ⋮ Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors ⋮ Fast progressive reconstruction of images using the DCT ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
This page was built for publication: A Fast Computational Algorithm for the Discrete Sine Transform
