IEEE Transactions on Computers
Hi-index | 0.00 |
A general solution is proposed to realize the discrete cosine transform of any length via cyclic convolutions in this paper. This algorithm is not optimal in minimizing any measure of computational complexity, but it involves some regular forms that are most suitable for the realization using technologies and structures which are well suited for doing convolutions, such as the distributed arithmetic and the systolic array. On the other hand, this algorithm is much more flexible than any available DCT algorithm as it can be applied to realize DCT/IDCT with any length.