Improved UMHexagonS algorithm and architecture for low power H.264 video compression

Video has been part of our daily life either for entertainment, work, or communication. The video can be used in form of television, movies, streaming video, video call or even for personal recording. The process of recording and transferring the video data requires a lot of resources such as comput...

Full description

Saved in:
Bibliographic Details
Main Author: Arief Affendi, Juri
Format: Thesis
Language:English
Published: Universiti Malaysia Perlis (UniMAP) 2014
Subjects:
Online Access:http://dspace.unimap.edu.my:80/dspace/handle/123456789/31928
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimap-31928
record_format dspace
spelling my.unimap-319282014-02-14T02:26:13Z Improved UMHexagonS algorithm and architecture for low power H.264 video compression Arief Affendi, Juri Video compression Video encoding Motion estimation (ME) Fast search algorithms Video data transferring Video has been part of our daily life either for entertainment, work, or communication. The video can be used in form of television, movies, streaming video, video call or even for personal recording. The process of recording and transferring the video data requires a lot of resources such as computational time, storage space and bandwidth (bit rate). This process has become more complex since the demand for better quality and faster video encoding is increasing. The latest video compression standard, H.264, is able to meet this demand but at the cost of increasing computational complexity. This in turn increases the energy consumption of this video compression standard. Motion estimation (ME) is the module that consumes the most of encoding time and computational complexity in video compression. To overcome the increase in computational complexity of ME, H.264 reference software has implemented fast search algorithm known as Unsymmetrical Multi Hexagon-grid Search (UMHexagonS) as the main motion estimation engine. This thesis proposes several improvements for the UMHexagonS in term of algorithms and architectures. The proposed algorithms reduce the computational complexity of the UMHexagonS by reducing the number of search candidate up to 58.54% compared to the conventional UMHexagonS algorithm. It is able to reduce the motion estimation encoding time (MET) up to 28.66% when simulated using H.264 reference software. In addition, the proposed UMHexagonS architectures implement the proposed algorithms efficiently. The proposed architecture is able to reduce the clock cycle up to 87.80% with total energy saving up to 78.79% as compared to the conventional UMHexagonS architecture. 2014-02-14T02:26:13Z 2014-02-14T02:26:13Z 2013 Thesis http://dspace.unimap.edu.my:80/dspace/handle/123456789/31928 en Universiti Malaysia Perlis (UniMAP) School of Microelectronic Engineering
institution Universiti Malaysia Perlis
building UniMAP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Perlis
content_source UniMAP Library Digital Repository
url_provider http://dspace.unimap.edu.my/
language English
topic Video compression
Video encoding
Motion estimation (ME)
Fast search algorithms
Video data transferring
spellingShingle Video compression
Video encoding
Motion estimation (ME)
Fast search algorithms
Video data transferring
Arief Affendi, Juri
Improved UMHexagonS algorithm and architecture for low power H.264 video compression
description Video has been part of our daily life either for entertainment, work, or communication. The video can be used in form of television, movies, streaming video, video call or even for personal recording. The process of recording and transferring the video data requires a lot of resources such as computational time, storage space and bandwidth (bit rate). This process has become more complex since the demand for better quality and faster video encoding is increasing. The latest video compression standard, H.264, is able to meet this demand but at the cost of increasing computational complexity. This in turn increases the energy consumption of this video compression standard. Motion estimation (ME) is the module that consumes the most of encoding time and computational complexity in video compression. To overcome the increase in computational complexity of ME, H.264 reference software has implemented fast search algorithm known as Unsymmetrical Multi Hexagon-grid Search (UMHexagonS) as the main motion estimation engine. This thesis proposes several improvements for the UMHexagonS in term of algorithms and architectures. The proposed algorithms reduce the computational complexity of the UMHexagonS by reducing the number of search candidate up to 58.54% compared to the conventional UMHexagonS algorithm. It is able to reduce the motion estimation encoding time (MET) up to 28.66% when simulated using H.264 reference software. In addition, the proposed UMHexagonS architectures implement the proposed algorithms efficiently. The proposed architecture is able to reduce the clock cycle up to 87.80% with total energy saving up to 78.79% as compared to the conventional UMHexagonS architecture.
format Thesis
author Arief Affendi, Juri
author_facet Arief Affendi, Juri
author_sort Arief Affendi, Juri
title Improved UMHexagonS algorithm and architecture for low power H.264 video compression
title_short Improved UMHexagonS algorithm and architecture for low power H.264 video compression
title_full Improved UMHexagonS algorithm and architecture for low power H.264 video compression
title_fullStr Improved UMHexagonS algorithm and architecture for low power H.264 video compression
title_full_unstemmed Improved UMHexagonS algorithm and architecture for low power H.264 video compression
title_sort improved umhexagons algorithm and architecture for low power h.264 video compression
publisher Universiti Malaysia Perlis (UniMAP)
publishDate 2014
url http://dspace.unimap.edu.my:80/dspace/handle/123456789/31928
_version_ 1643796407471046656
score 13.214268