Fast discrete cosine transform pruning
Athanassios N. Skodras · IEEE Transactions on Signal Processing · 1994
A new fast pruning algorithm is proposed for computing the N/sub 0/ lowest frequency components of a length-N discrete cosine transform, where N/sub 0/ is any integer less than or equal to N, and N=2/sup m/. The computational complexity of the developed algorithm is lower than any of the existing algorithms, resulting in significant time savings. In the special case that N/sub 0/=2/sup m0/, the required number of multiplications and additions is 1/2 m/sub 0/N and (m/sub 0/+1)N+( 1/2 m/sub 0/-2)N/sub 0/+1, respectively.>