An adaptive character wordlength algorithm for data compression

✍ Scribed by Hussein Al-Bahadili; Shakir M. Hussain

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 350 KB
• Volume: 55
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/j.camwa.2007.05.014

✦ Synopsis

This paper presents a new and efficient data compression algorithm, namely, the adaptive character wordlength (ACW) algorithm, which can be used as complementary algorithm to statistical compression techniques. In such techniques, the characters in the source file are converted to a binary code, where the most common characters in the file have the shortest binary codes, and the least common have the longest; the binary codes are generated based on the estimated probability of the character within the file. Then, the binary coded file is compressed using 8 bits character wordlength. In this new algorithm, an optimum character wordlength, b, is calculated, where b > 8, so that the compression ratio is increased by a factor of b/8. In order to validate this algorithm, it is used as a complement algorithm to Huffman code to compress a source file having 10 characters with different probabilities, and these characters are randomly distributed within the source file. The results obtained and the factors that affect the optimum value of b are discussed, and, finally, conclusions are presented.