首页> 外文期刊>Signal Processing. Image Communication: A Publication of the the European Association for Signal Processing >A fast block-matching algorithm based on adaptive search area and its VLSI architecture for H.264/AVC
【24h】

A fast block-matching algorithm based on adaptive search area and its VLSI architecture for H.264/AVC

机译:H.264 / AVC的基于自适应搜索区域的快速块匹配算法及其VLSI架构

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we propose a fast block-matching algorithm based on search center prediction and search early termination, called center-prediction and early-termination based motion search algorithm (CPETS). The CPETS satisfies high performance and efficient VLSI implementation. It makes use of the spatial and temporal correlation in motion vector (MV) fields and feature of all-zero blocks to accelerate the searching process. This paper describes the CPETS with three levels. At the coarsest level, which happens when center prediction fails, the search area is defined to enclose all original search range, At the middle level, the search area is defined as a 7 × 7-pels square area around the predicted center. At the finest level, a 5 × 5-pels search area around the predicted center is adopted. At each level, 9-points uniformly allocated search pattern is adopted. The experiment results show that the CPETS is able to achieve a reduction of 95.67% encoding time in average compared with full-search scheme, with a negligible peak signal-noise ratio (PSNR) loss and bitrate increase. Also, the efficiency of CPETS outperforms some popular fast algorithms such as: three-step search, new three-step search, four-step search evidently. This paper also describes an efficient four-way pipelined VLSI architecture based on the CPETS for H.264/AVC coding. The proposed architecture divides current block and search area into four sub-regions, respectively, with 4:1 sub-sampling and processes them in parallel. Also, each sub-region is processed by a pipelined structure to ensure the search for nine candidate points is performed simultaneously, By adopting search early-termination strategy, the architecture can compute one MV for 16 × 16 block in 81 clock cycles in the best case and 901 clock cycles in the poorest case. The architecture has been designed and simulated with VHDL language. Simulation results show that the proposed architecture achieves a high performance for real-time motion estimation. Only 47.3 K gates and 1624 × 8 bits on-chip RAM are needed for a search range of (-15, +15) with three reference frames and four candidate block modes by using 36 processing elements.
机译:在本文中,我们提出了一种基于搜索中心预测和搜索提前终止的快速块匹配算法,称为基于中心预测和提前终止的运动搜索算法(CPETS)。 CPETS满足了高性能和高效的VLSI实现。它利用运动矢量(MV)字段中的空间和时间相关性以及全零块的特征来加快搜索过程。本文介绍了三个级别的CPETS。在最粗略的级别(发生中心预测失败时),将搜索区域定义为包围所有原始搜索范围;在中等级别,将搜索区域定义为围绕预测中心的7×7像素正方形区域。在最好的水平上,采用围绕预测中心的5×5像素搜索区域。在每个级别,采用9点均匀分配的搜索模式。实验结果表明,与全搜索方案相比,CPETS平均可减少95.67%的编码时间,而峰值信噪比(PSNR)损失和比特率增加可忽略不计。而且,CPETS的效率明显优于一些流行的快速算法,例如:三步搜索,新的三步搜索,四步搜索。本文还描述了一种基于CPETS的高效四向流水线式VLSI架构,用于H.264 / AVC编码。所提出的架构将当前块和搜索区域分别以4:1的子采样划分为四个子区域,并对其进行并行处理。此外,每个子区域都通过流水线结构进行处理,以确保同时执行对9个候选点的搜索。通过采用搜索提前终止策略,该架构可以在81个时钟周期内以16×16块的最佳速度计算一个MV。最坏的情况下为901个时钟周期。该体系结构已使用VHDL语言进行了设计和仿真。仿真结果表明,所提出的体系结构实现了实时运动估计的高性能。通过使用36个处理元件,对于具有三个参考帧和四个候选块模式的(-15,+ 15)搜索范围,仅需要47.3 K门和1624×8位片上RAM。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号