Fast 2-Dimensional 8×8 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions(Image Processing and Video Processing)

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 8×8 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 8×8 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 8×8 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 8×8 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 8×8 integer transforms require fewer latency delays and provide a larger throughput rate than the rowcolumn based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC FRExt high-profile signal processing.

• 社団法人電子情報通信学会の論文
• 2006-12-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)

スポンサーリンク