Learn More
An extension of one of the fastest existing algorithms for the computation of the two-dimensional (2D) discrete cosine transform (DCT) is presented and a 2D fast cosine transform (FCT) pruning algorithm is derived. The proposed vector-radix FCT algorithm has the same computational complexity as the fastest existing 2D algorithms, but outperforms them in(More)
  • 1