High Acceleration for Video Processing Applications Using Specialized Instruction Set Based on Parallelism and Data Reuse

Authors:
Nicolas Beucher;Normand Bélanger;Yvon Savaria;Guy Bois
Affiliations:
Deparment of Electrical Engineering, Groupe de Recherche en Microélectronique, École Polytechnique de Montréal, Montreal, Canada;Deparment of Electrical Engineering, Groupe de Recherche en Microélectronique, École Polytechnique de Montréal, Montreal, Canada;Deparment of Electrical Engineering, Groupe de Recherche en Microélectronique, École Polytechnique de Montréal, Montreal, Canada;Deparment of Computer Engineering, Groupe de Recherche en Microélectronique, École Polytechnique de Montréal, Montreal, Canada
Venue:
Journal of Signal Processing Systems
Year:
2009

Citing 7
Cited 0

Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
Power and Performance Analysis of Motion Estimation Based on Hardware and Software Realizations

IEEE Transactions on Computers
Application Specific Instruction Set Processor for Adaptive Video Motion Estimation

DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
New frame rate up-conversion using bi-directional motion estimation

IEEE Transactions on Consumer Electronics
A novel four-step search algorithm for fast block motion estimation

IEEE Transactions on Circuits and Systems for Video Technology
A method for motion adaptive frame rate up-conversion

IEEE Transactions on Circuits and Systems for Video Technology
Using motion-compensated frame-rate conversion for the correction of 3: 2 pulldown artifacts in video sequences

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an application-specific instruction set for a configurable processor to accelerate motion-compensated frame rate conversion (MC-FRC) algorithms based on block motion estimation (BME). The paper shows that the key to achieve very high performance when creating new instructions is to leverage, at the same time, parallel computations, data reuse, and efficient cache use. This is supported by concrete examples that demonstrate how it can be done in the case of the two algorithms considered. The new instructions are used to implement two BME algorithms: one implements the full search (FS) block matching algorithm (BMA), while the other implements the One-Dimensional Full Search (ODFS) BMA. The obtained acceleration factors exceed one hundred for the MC-FRC algorithm embedding the FS algorithm and twenty for the ODFS algorithm. The results show that getting such global acceleration is the consequence of combining parallel computations, data reuse, and efficient cache use, not of only one of them.