Constant geometry algorithm for discrete cosine transform

Modification to the architecture-oriented fast algorithm for discrete cosine transform of type II from Astola and Akopian is presented, which results in a constant geometry algorithm with simplified parameterized node structure. Although the proposed algorithm does not reach the theoretical lower bound for the number of multiplications, the algorithm possesses the regular structure of the Cooley–Tukey FFT algorithms. Therefore, the FFT implementation principles can also be applied to the discrete cosine transform.