The general method of efficient computation discrete cosine transform using of circular convolutions is considered. The method is based on the presentation of the matrix of arguments and signs of the real harmonic transform basis to the equivalent cyclic sections.
1. S. Lawrence Marple, Jr., Digital spectral analysis with applications, NJPrentice-Hall, 1987. 2. Bjeng Gi Lee, A new algorithm to compute the discrete cosine transform./IEEE Trans. On Ac.,Sp., and Sign. Proc. – 1984. – №6, vol. 32. – Р. 1243–1245. 3. Rader C.M. Discrete Fourier transform when the number of data samples is prime. Proc. IEEE. – 1968. – 56. 4. Gilbert Strang, The Discrete cosine transform / SIAM Review. – 1999. – Vol. 41. – Р. 135–147. 5. Макклеллан Дж.Х., Рейдер Ч.М. Применение теории чисел в цифровой обработке сигналов: Пер. с англ. – М.: Радио и связь, 1983.