Comments on fast algorithms and implementation of 2-D discrete cosine transform

This letter shows that using the Loeffler's one-dimensional (1-D) 8-point discrete cosine transform (DCT) algorithm [4] in Cho and Lee's two-dimensional (2-D) 8 × 8-point DCT algorithm in the above paper1 will result in an optimal algorithm in the sense of multiplicative complexity theory. © 1998 IEEE.