A Fast DCT Algorithm for Watermarking in Digital Signal Processor

Table 1

The number of multiplications for 2D DCT by the algorithms of previous works and by the proposed FDCT algorithm.

Algorithm	Number of multiplications for; 2D DCT (8 × 8 block)
Direct computation	8^4 = 4,096
Direct computation; (with line-column separation)	2 × 8^3 = 1024
Jridi et al. [5]	256
Ko et al. [7]	31
Sung et al. [8]	25
Manoria and Dixit [9]	28
Khan et al. [10]	40
FDCT algorithm (this work)	24