By Topic

A hardware implementation of a run length encoding compression algorithm with parallel inputs

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
$31 $31
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)
Trein, J. ; Sch. of Electron. & Commun. Eng., Dublin Inst. of Technol., Dublin ; Schwarzbacher, A.T. ; Hoppe, B. ; Noffz, K.-H.

Run length encoding can be found in numerous applications such as data transfer or image storing (Sayood, 2002). It is a well known, easy and efficient compression method based on the assumption of long data sequences without the change of content. These sequences can be described by their position and length of appearance. Implementations using dedicated logic are optimised for parallel data processing. Here, images are transferred in blocks of multiple pixels in parallel. A compression of these streams into a run length code requires an encoder with a parallel input. This run length encoder has to compress the sequence at a minimum of clock cycles to avoid long inhibit intervals at the input. This paper describes a hardware algorithm performing a high performance run length encoding for binary images using a parallel input.

Published in:

Signals and Systems Conference, 208. (ISSC 2008). IET Irish

Date of Conference:

18-19 June 2008