论文信息 - Using the CS decomposition to compute the 8-point DCT

Using the CS decomposition to compute the 8-point DCT

The aim of this paper is to evaluate the cosine-sine (CS) decomposition as a means for computing the 8-point Discrete Cosine Transform (DCT). By iteratively decomposing matrices after reordering their columns or rows, novel factorizations of the DCT matrix have been obtained that describe interesting algorithms for computing the transform. Some of them are only characterized by regular, symmetric data-flows, whereas others require a few computations. This suggests that our method can be used to search for innovative algorithms for other block transforms and to optimize hardware implementations.

Marek Parfieniuk

[1] K. Rao,et al. Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations , 2006 .

[2] Alexander A. Petrovsky,et al. Quaternion Multiplier Inspired by the Lifting Implementation of Plane Rotations , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3] Kai-Kuang Ma,et al. On simplified order-one factorizations of paraunitary filterbanks , 2004, IEEE Transactions on Signal Processing.

[4] C. Paige,et al. History and generality of the CS decomposition , 1994 .

[5] Truong Q. Nguyen,et al. On factorization of M-channel paraunitary filterbanks , 2001, IEEE Trans. Signal Process..

[6] Kai-Kuang Ma,et al. A simplified lattice factorization for linear-phase paraunitary filter banks with pairwise mirror image frequency responses , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[7] Brian D. Sutton. Computing the complete CS decomposition , 2007, Numerical Algorithms.

[8] Alexander A. Petrovsky,et al. Short-critical-path and structurally orthogonal scaled CORDIC-based approximations of the eight-point discrete cosine transform , 2013, IET Circuits Devices Syst..