Программный пакет генерации целочисленных преобразований
Abstract
Пакет дает возможность в зависимости от диапазона представления чисел данной системы, генерировать матрицы целочисленных преобразования Фурье, DCT-1-4, DST-1-4 и Хаарa порядка 2n .
References
John Miano, “Compressed Image File Fоrmat”, Addison-Wesley 2003.
Михаил Гук, “Процессоры Pentium 4 Athlon и Duron”, Питер 2001. [3] Emmanual C. Ifeachor, “Digital Signal Processing, A Practical Aproach”, Prentice Hall, 2002
Flores I., “The Logic of Computer Arithmetic”. Prentice Hall, 1963
L. Cheng, Y. Zeng. Fast Multiplierless Approximations of DCT. IEEE Trans. Circuits and Systems-II. 2002.
Ahmed,Rao. Orthogonal Transforms for Digital Signal Processing. New York. 1975
S. Oriantara, Y. J. Chen, Truong Nguyen,.”Integer Fast Fourier Transform”, IEEE 2001.
K.R. Rao, P.C. Yip, “The transform and data compression handbook”, CRC Press 2001
G.A. Petrosyan, H.G. Sarukhanyan, IDCT-II And Realization Using MMX Technology, Information Technologies and Management. Number 3, 38–43 pages. 2004.
K.Komatsu and K.Sezaki, “Reversible Subband Coding of Images”, Proc. SPIE VCIP, vol.2501, pp.676-684, May 1995.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
