Research on Fast 2-D DCT Algorithm Based on Parallel Computing

Now, 2-D DCT is applied widely in the field of signal processing. But the transformation is operated by twice 1-D DCT successively, which limits the operation efficiency to improve farther. To overcome such drawbacks, a new method based on parallel computing is proposed in the paper. First, a sort of new matrix operation algorithm and a new transformation matrix are defined in the interest of convenient parallel computing. Then, 2-D DCT is operated integrally based on the new transformation matrix and new matrix operation criterion. The theoretical analysis shows that the calculating amount of the proposed method to compute 2-D DCT only needs one equivalent multiplication and a few equivalent additions, and the operation efficiency relative to other fast algorithms is improved notably.