A fast algorithm for the discrete sine transform implemented by the fast cosine transform
From MaRDI portal
Publication:3680226
DOI10.1109/TASSP.1982.1163963zbMath0565.65090OpenAlexW2022872995MaRDI QIDQ3680226
Publication date: 1982
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tassp.1982.1163963
Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (5)
Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms ⋮ Transform domain technique for windowing the DCT and DST ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms ⋮ Cosine manifestations of the Gelfand transform
This page was built for publication: A fast algorithm for the discrete sine transform implemented by the fast cosine transform