Fast Discrete Sine Transform
DOI:
https://doi.org/10.34767/SIMIS.2010.02.07Keywords:
Transformata sinusowa, transformata dyskretna, DSTAbstract
The aim of this work is to present a fast calculation method for DST-IV and inverse transform, whose complexity is
O(n*lgn) with regard to multiplication count. DST-IV was chosen due to lack of attractive dependencies in the matrix describing the transformation. Most works (both Polish and foreign [1,2,3]) elucidating effective methods of producing graphs describing the calculation process are based on DST-II/DST-III, whose analysis is by far less complicated. The proposed method will be presented in a mathematical form.
References
Xuancheng Shao, Steven G. Johnson. Type-II/III DCT/DST algorithms with reduced number of arithmetic operations. 2008. Signal Processing Volume 88 , Issue 6 (June 2008), pp 1553-1564, ISSN:0165-1684
Markus Päuschel, José M. F. Mouray. The algebraic approach to the discrete cosine and sine transforms and their fast algorithms. SIAM Journal of Computing 2003, Vol. 32, No. 5, pp. 1280-1316
Vladimir Britanak, Patrick C. Yip, K. R Rao, Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and IntegerApproximations ISBN-13: 978-0123736246, Academic Press (2006);
Ross J. Anderson, Fabien A.P. Petitcolas, On The Limits of Steganography IEEE Journal of Selected Areas in Communications,16(4):474-481, Maj 1998. Special Issue on Copyright & Privacy Protection. ISSN 0733-8716.
