Split-radix fast cosine transform algorithm
A. N. SltODRAS, Charilaos A. Christopoulos · International Journal of Electronics · 1993
An extension of an existing fast algorithm for the computation of the discrete cosine transform is presented. The proposed algorithm has a structure similar to the split-radix algorithm used for the computation of the FFT, the same computational complexity as the direct fast cosine algorithms and a high regularity which facilitates its implementation in VLSI technology. A comparison on different computer architectures shows that the proposed algorithm is superior to existing algorithms in terms of execution time.