Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"

DOI10.1109/TCOM.1986.1096496zbMATH Open0588.68016OpenAlexW2032748734MaRDI QIDQ3716293FDOQ3716293

Authors: Zhongde Wang 

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1109/tcom.1986.1096496

Recommendations

• Fast discrete sine transform algorithms
• Fast algorithm for real joint time–frequency transformations of time-varying signals
• A fast algorithm for the discrete sine transform implemented by the fast cosine transform
• A fast recursive algorithm for the discrete sine transform
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms

zbMATH Keywords

efficient algorithmdiscrete sine transformsparse matrix factorization

Mathematics Subject Classification ID

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

Cited In (3)

• Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
• Comments on ``Fixed-point error analysis of fast Hartley transform
• Comments on On the computation and the effectiveness of discrete sine transform

This page was built for publication: Comments on "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 Q3716293)