• DocumentCode
    2708341
  • Title

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

  • Author

    Zeinalabedin, Farid Haji ; Eftekhari, Nassrin ; Haghighat, Abolfazl Torghi

  • Author_Institution
    Comput. & Electron. Dept., Islamic Azad Univ., Qazvin, Iran
  • fYear
    2010
  • fDate
    7-10 May 2010
  • Firstpage
    12
  • Lastpage
    16
  • Abstract
    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.
  • Keywords
    data compression; optimisation; statistical analysis; ECF; adaptive character wordlength calculation; estimated compressed file size; optimum character word length; statistical compression algorithms; Bandwidth; Binary codes; Compression algorithms; Data compression; Dictionaries; Entropy; Frequency; Huffman coding; Probability; Research and development; ACW algorithm; Data compression; ECF algorithm; entropy; header file; statistical technique;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Research and Development, 2010 Second International Conference on
  • Conference_Location
    Kuala Lumpur
  • Print_ISBN
    978-0-7695-4043-6
  • Type

    conf

  • DOI
    10.1109/ICCRD.2010.7
  • Filename
    5489426