Learn More
This paper presents an efficient algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) of size p<sup>r</sup> &#x00D7; p<sup>r</sup>, where p is a prime. The algorithm decomposes the 2-D DCT outputs into three parts: the first part contains outputs whose indices are both multiples of p and forms a 2-D DCT of size p<sup>r-1</sup>(More)
  • 1