The week's pick
Reseach Article
Novel bit-level Adaptive and Asymmetric Data Compression Technique
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 177 - Number 35 |
| Year of Publication: 2020 |
| Authors: Shashwat Tiwari, Ayushi Lal, Shivani Agarwal, Ayush Kumar, Anupam Singh, Nitin Arora |
10.5120/ijca2020919832
|
Shashwat Tiwari, Ayushi Lal, Shivani Agarwal, Ayush Kumar, Anupam Singh, Nitin Arora . Novel bit-level Adaptive and Asymmetric Data Compression Technique. International Journal of Computer Applications. 177, 35 ( Feb 2020), 14-17. DOI=10.5120/ijca2020919832
Abstract
This paper works on a detailed and per-formative evaluation of a bit-level, adaptive, and asymmetric data compression scheme that is based on the adaptive character word length algorithm. It can be used with statistical compression techniques to increase efficiency. In this mathematical technique, the data word is converted into codewords (Binary form) then the binary coded file is compressed using 8 bits character word length. In this new Algorithm, an optimum character word length b is calculated where (b>8), so that a factor of (b/8) increases the compression ratio. To validate this algorithm, it is used as a complementary with Huffman code to compress a source text file with randomly distributed characters of different frequencies. This scheme is used to compress several text files into smaller bit-level files and can be used to achieve higher competitive skills more than state-of-art tools.
References
- M.K. Pandya, Data compression: efficiency of varied compression techniques, Formal Report, Brunel University, 2000
- www.vectorsite.net/ttdcmp1.html
- www.data-compression.com/lossless.shtml
- Hussein Al-Bahadilia, Shakir M. Hussainb, An adaptive character wordlength algorithm for data compression, Computers and Mathematics with Applications 55 (2008) 1250–1256
- Hussein Al-Bahadili1 Shakir M. Hussain2, A Bit-level Text Compression Scheme Based on the ACW Algorithm, International Journal of Automation and Computing, 7(1), February 2010, 123-131 DOI: 10.1007/s11633-010-0123-6
- H. Plantinga. An asymmetric, semi-adaptive text compression algorithm. In Proceedings of IEEE Data Compression Conference, 1994.
- J. Adiego, P. de la Feunte. On the use of words as source alphabet symbols in PPM. In Proceedings of Data Compression Conference, IEEE, pp. 435, 2006.
- S. Nofal. Bit-level text compression. In Proceedings of the 1st International Conference on Digital Communications and Computer Applications, Irbid, Jordan, pp. 486–488, 2007.
- Arora, N., Tamta, V., and Kumar S., 2012. A Novel Sorting Algorithm and Comparison with Bubble Sort and Selection Sort. International Journal of Computer Applications. Vol 45. No 1. 31-32
- Arora, Nitin &Kumar Tamta, Vivek & Kumar, Suresh. (2012). Modified non-recursive algorithm for reconstructing a binary tree. International Journal of Computer Applications. 43. 25-28. 10.5120/6141-8386.
- Arora, N., Kaushik, P.K., Kumar, S.: Iterative method for recreating a binary Tree from its traversals. International Journal of Computer Applications 57(11), 6–13 (2012).
- Garima Pandey, Nitin Arora, Mamta Martolia. “A Novel String Matching Algorithm and Comparison with KMP Algorithm” in International Journal of Computer Applications (0975 – 8887) Volume 179 – No.3, December 2017.
Index Terms
Keywords