Fast Algorithm Designs for Low-Complexity 4 x 4 Discrete Cosine Transform

Abstract

In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 4 × 4 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 4 × 4 DCT algorithm can be developed from the proposed fast 1-D 4 × 4 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 4 × 4 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.