Nadarajan, Krishnaveny and Ahmad Zukarnain, Zuriati (2008) Analysis of string matching compression algorithms. Journal of Computer Science, 4 (3). pp. 205-210. ISSN 1549-3636
Full text not available from this repository.
The improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resources effectively, data compression can be applied. Through compression, the data can be compressed by eliminating redundant elements. Thus, this study incorporates compression to main memory in order to fully utilize its resources and improve performance of data access. This project evaluates the performance of the compression algorithms in order to increase the performance of memory access. The compression algorithms are string matching based which are LZW and LZSS. Through simulation, the effectiveness and compressibility of the algorithms were compared. The performances of the algorithms were evaluated in term of compression time, decompression time and compressed size. The simulation result shows that LZSS is an efficient compression algorithm compared to LZW.
|Keyword:||LZSS; LZW; String matching; Lossless compression|
|Subject:||Data compression (Computer science)|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Deposited By:||Umikalthom Abdullah|
|Deposited On:||17 Feb 2012 08:55|
|Last Modified:||12 Nov 2012 06:33|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 17 Feb 2012 08:55.