CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Cascading of the PDLZW Compression Algorithm with Arithmetic Coding

by Niralithakkar, Malay Bhatt
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 46 - Number 16
Year of Publication: 2012
Authors: Niralithakkar, Malay Bhatt
10.5120/6994-9523

Niralithakkar, Malay Bhatt . Cascading of the PDLZW Compression Algorithm with Arithmetic Coding. International Journal of Computer Applications. 46, 16 ( May 2012), 21-24. DOI=10.5120/6994-9523

@article{ 10.5120/6994-9523,
author = { Niralithakkar, Malay Bhatt },
title = { Cascading of the PDLZW Compression Algorithm with Arithmetic Coding },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 46 },
number = { 16 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume46/number16/6994-9523/ },
doi = { 10.5120/6994-9523 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:39:55.104733+05:30
%A Niralithakkar
%A Malay Bhatt
%T Cascading of the PDLZW Compression Algorithm with Arithmetic Coding
%J International Journal of Computer Applications
%@ 0975-8887
%V 46
%N 16
%P 21-24
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposes the cascading of two algorithms that combines the features of both PDLZW and Arithmetic coding and also compares this with deflate which is a cascading of LZ77 and Huffman Coding. In PDLZW algorithm, the dictionary is divided into several dictionaries based on the size of the words. With the hierarchical parallel dictionary set, the search time can be reduced significantly. All this dictionaries are operated independently with each other. The results generated by Arithmetic Coding are close to the optimal value (as predicted by entropy in information theory).

References
  1. M. B. Lin, Jang-Feng Lee and Gene Eu Jan, "A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture", IEEE Transections on VLSI Systems, vol. 14, No. 9, pp. 925-936, Sep. 2006.
  2. M. Nelson and Jean-Loup Gailly , "The Data Compression Book", 2nd ed. , BPB publications, 1996.
  3. P. Vichitkraivin and O. Chitsobhuk, "An Improvement of PDLZW Implementation with a Modified WSC Updating Technique on FPGA", World Academy of Science, Engineering and Technology, 2009.
  4. M. B. Lin, "A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionary," Journal of VLSI Signal Processing 26, pp. 369-381, 2000.
  5. D. Salomon, "Data Compression the Complete Reference", 4th ed. , Springer, 2007.
  6. N. S. Thakkar, M. S. Bhatt, "Two-Stage Algorithm for Data Compression", International Conference on Advances on Computer, Electronics and Electrical Engineering, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Arithmetic Coding huffman Coding Lossless Data Compression Lossy Data Compression Parallel Dictionary Lzw (pdlzw) Word-based Dynamic Lzw (wdlzw).

Powered by PhDFocusTM