Enhancing adaptive huffman coding through word by word compression for textual data
| Autor: | Devi Dath, J Vinitha Panicker |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
021110 strategic
defence & security studies Computer science Speech recognition 0211 other engineering and technologies Byte Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Huffman coding symbols.namesake Encoding (memory) Compression (functional analysis) Compression ratio symbols Word (computer architecture) Volume (compression) Data compression |
| Zdroj: | 2017 International Conference on Communication and Signal Processing (ICCSP). |
| DOI: | 10.1109/iccsp.2017.8286534 |
| Popis: | Nowadays, the volume of information that is being processed is increasing exponentially. And hence, the significance of data compression algorithms is also increasing. Data compression algorithms aim at reducing the size of data at the cost of increased computational efforts. In this paper, we propose an enhanced version of adaptive Huffman encoding technique for improving the efficiency of text file compression. In the proposed encoding technique, we devise a mechanism for compressing the text files word by word rather than the existing byte by byte compression technique. The proposed method is implemented and the results showed better performance in terms of compression ratio as well as execution time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|