Fast Algorithm Designs for Low-Complexity 4×4 Discrete Cosine Transform(Digital Signal Processing)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2005-11-01

著者

• Fan Chih-peng

  Department Of Electrical Engineering National Chung Hsing University

• Fan Chih-peng

  Department Of Electrical Engineering National Cheng Kung University

関連論文

• Implementations of Low-Cost Hardware Sharing Architectures for Fast 8×8 and 4×4 Integer Transforms in H.264/AVC(Digital Signal Processing)
• Fast 2-Dimensional 8×8 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions(Image Processing and Video Processing)
• Centralized Fast Slant Transform Algorithms
• Fast Algorithm Designs for Low-Complexity 4×4 Discrete Cosine Transform(Digital Signal Processing)

スポンサーリンク