Efficient implementation of discrete cosine transform using recursive filter structure

Abstract

In this paper, we generalize a formulation for converting a length-2ⁿ discrete cosine transform into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2[sup n-1], 2[sup n-2],... 2[sup 0] respectively, while their structures are extremely regular. The realization can then be converted into recursive filter form, which is of particularly simple for practical implementation.