By Topic

A parallel version of the MPEG-2 encoding algorithm formally analyzed using algebraic specifications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Katerina Ksystra ; School of Electrical and Computer Engineering, National Technical University of Athens, Greece ; Petros Stefaneas ; Iakovos Ouranos ; Panayiotis Frangos

MPEG-2 is a wide used group of standards, established by the Moving Picture Experts Group (MPEG), for the digital compression of broadcast-quality full-motion video. Due to its high acceptance, it is very important to ensure that it behaves in a correct manner. To avoid vulnerability problems the MPEG-2 encoding algorithm has been already formally specified and verified for its correctness. In this paper, we propose the use of the OTS/CafeOBJ Method in order to prove that two MPEG-2 encoding algorithms for the same input produce the same output. Our approach is based on a simplified parallel version of the MPEG-2 encoder. Also, we have proved a mutual exclusion property for this parallel algorithm.

Published in:

Signal Processing and Multimedia Applications (SIGMAP), Proceedings of the 2010 International Conference on

Date of Conference:

26-28 July 2010