By Topic

A New Algorithm for Calculating Adaptive Character Wordlength via Estimating Compressed File Size

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 $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

3 Author(s)
Zeinalabedin, F.H. ; Comput. & Electron. Dept., Islamic Azad Univ., Qazvin, Iran ; Eftekhari, N. ; Haghighat, A.T.

In statistical compression algorithms, character word length of 8 bit is being used. Using an optimum character word length, b, where b>8, will improve compression ratio. There are different ways to calculate optimum character word length. In this paper we introduce a new algorithm named Estimated Compressed File Size (ECF) to find optimum character word length by estimating compressed file size. In this new algorithm, different metrics such as header file size and entropy are effective to determine optimum character word length. The ECF algorithm is a good lower bound for estimating compressed file size. ECF is a rapid algorithm for large files and does not depend to statistical algorithms.

Published in:

Computer Research and Development, 2010 Second International Conference on

Date of Conference:

7-10 May 2010