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

This paper shows that using the Loeffler's (see Proc. IEEE ICASSP, vol.2, p.988-91, 1989) one-dimensional (1-D) 8-point discrete cosine transform (DCT) algorithm in Cho and Lee's (see ibid., vol.38, p.297-305, 1991) two-dimensional (2-D) 8/spl times/8-point DCT algorithm will result in an optimal algorithm in the sense of multiplicative complexity theory.