| Hi-index | 35.68 |
A new fast pruning algorithm is proposed for computing the N0 lowest frequency components of a length-N discrete cosine transform, where N0 is any integer less than or equal to N, and N=2m. 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 N0=2m0, the required number of multiplications and additions is ½m0N and (m0+1)N+(½m 0-2)N0+1, respectively