Fast polynomial multiplication and convolutions related to the discrete cosine transform (Q676009): Difference between revisions

The authors deal with properties of the algebra \(\{{\mathbf C}^I_N (\text{diag} {\mathbf d}) {\mathbf C}^I_N: {\mathbf d} \in\mathbb{R}\}\), where \({\mathbf C}^I_N: =\sqrt {2\over N} (\varepsilon_{N,k} \cos {jk\pi\over N})^N_{j,k=0}\) \((\varepsilon_{N,0}= \varepsilon_{N,N} =1/2\), \(\varepsilon_{N,k} =1\) \((k=1, \dots, N-1))\) denotes the transform matrix corresponding to the discrete cosine transform (DCT) of type I. Based on an efficient DCT-I algorithm they introduce an algorithm for the fast multiplication of polynomials in Chebyshev form.