Efficient Architecture Design of Motion-Compensated Temporal Filtering/Motion Compensated Prediction Engine

Abstract

Abstract-Since motion-compensated temporal filtering (MCTF) becomes an important temporal prediction scheme in video coding algorithms, this paper presents an efficient temporal prediction engine which not only is the first MCTF hardware work but also supports traditional motion-compensated prediction (MCP) scheme to provide computation scalability. For the prediction stage of MCTF and MCP schemes, modified extended double current Frames is adopted to reduce the system memory bandwidth, and a frame-interleaved macroblock pipelining scheme is proposed to eliminate the induced data buffer overhead. In addition, the proposed update stage architecture with pipelined scheduling and motion estimation (ME) -

VLSI implementation of high‐throughput parallel H.264/AVC baseline intra‐predictor

“…To ensure a cost-effective intra-prediction, this study proposes a fast intra-mode decision algorithm to reduce the computation required for 4 × 4 luminance blocks. The H.264/AVC standard includes nine predicted-modes for 4 × 4 block, each of which is assigned a number from 0 to 8: vertical (0), horizontal (1), DC (2), diagonal down-left (3), diagonal down-right (4), vertical-right (5), horizontaldown (6), vertical left (7) and horizontal-up (8). Intra-prediction processing includes the generation of prediction pixels, the sum of absolute differences (SADs) operations and RD cost computation.…”

“…Video coding techniques have progressed from H.261 (in 1990) [1], MPEG-1 and MPEG-2 [2], H.263 and H.263 + + [ 3], MPEG-4 [4] to H.264/MPEG-4 Part-10 (in 2004) [5,6]. Many advanced techniques have been adopted to improve the coding efficiency of H.264/AVC, including intra-prediction, integer transform, adaptive variable length coding, various block sizes and multi-frame reference [7][8][9][10]. The H.264/AVC standard can reduce bit-rates by 64, 49 and 39%, compared with MPEG-2 [2], H.263 [3] and MPEG-4 [4], respectively.…”

“…However, the computational requirements of a H.264/AVC system are far more complex than those of previous standards [1][2][3][4]. Fast algorithms have recently been developed to include intra-prediction, inter-mode decision, motion estimation, transform and rate-distortion optimisation (RDO) [7][8][9][10][11][12]. These algorithms can reduce computational complexity of H.264/AVC codec.…”

A New Frame Memory Compression Algorithm with DPCM and VLC in a 4×4 Block

“…The pixel values quantized with QP = 1 (i.e., shifted once to the right) are also shown in Figure 5 Table 1 shows the Golomb-Rice codewords for the DPCM results. For example, the fourth DPCM result, DPCM [4], is −9. From (1), the source for this value is 17.…”

“…Frame memory size and bandwidth requirements often limit the performance of a video processor designed for implementing a video compression standard such as MPEG-2, MPEG-4, and H.263 or H.264/AVC [1][2][3][4]. Frame memory compression (FMC) is a technique to reduce frame memory size by compressing the data to be stored in frame memory.…”