Shortening the critical path in CORDIC-based approximations of the eight-point DCT

This paper presents a novel family of CORDIC-based multiplierless algorithms for computing good approximations of the eight-point DCT. The shortened critical paths of the corresponding circuits are the main improvement over known solutions, but the total number of adders can also be reduced at the same time. A unique property of the proposed schemes is the inherent orthogonality (losslessness) of computations, i.e. energy preservation between the signal and transform domains, regardless of the accuracy of DCT approximation.