A Fast Computational Algorithm for the Discrete Sine Transform
Copyright policy )A Fast Computational Algorithm for the Discrete Sine Transform
A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic operations compared to that for the discrete cosine transform (DCT).
- McMaster University Canada
- University of Technology Russian Federation
discrete sine transform, efficient algorithm, Analysis of algorithms and problem complexity, Numerical methods for trigonometric approximation and interpolation, sparse-matrix factorization, discrete cosine transform
discrete sine transform, efficient algorithm, Analysis of algorithms and problem complexity, Numerical methods for trigonometric approximation and interpolation, sparse-matrix factorization, discrete cosine transform
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).59 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!