Fast algorithms for the discrete cosine transformation
This paper proposes fast algorithms for the forward and inverse discrete cosine transform. These algorithms consist of ``butterfly'' operations with cosine (rather than cosecant) multiplers, and thereby, they can reduce the necessary number of algebraic operations.
scientific article; zbMATH DE number 468716
scientific article