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

Discrete cosine transform (DCT) is applied widely in the field of signal processing. But the transform operation is complicated, and a large amount of multiply operation and addition operation affect largely the transform efficiency. To overcome such drawback, a new method based on parallel operation is proposed in the paper. First, a new transform matrix and a sort of new matrix operation principle are defined in the interest of convenient parallel operation. Then, DCT is accomplished by parallel operation tidily based on the new transform matrix and the new matrix operation principle. The theoretical analysis shows that the computation sum of the proposed method to compute DCT only needs one equivalent multiplication and a few equivalent additions, and the operation efficiency relative to other fast algorithm is improved markedly.