A Recursive DCT Algorithm with New Distributed Arithmetic

In this work a recursive DCT algorithm based upon both decomposition and new distributed arithmetic (NEDA) is presented. In the proposed algorithm, the computation of the DCT coefficient is firstly decomposed into small matrices and then the NEDA structure is employed to compute the coefficient. As a result less computational or hardware complexity is required for the DCT implementation as compared to the NEDA approach without decomposition. In addition, with the same bit precision (quantization) the proposed algorithm can achieve a better PSNR performance over the NEDA approach.