It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

Analysis of Lossless Reversible Transformation Algorithms to Enhance Data Compression | Perumal | Journal of Global Research in Computer Science

Analysis of Lossless Reversible Transformation Algorithms to Enhance Data Compression

Jeyanthi Perumal, Anuratha Vinodkumar

Abstract


In this paper we analyze and present the benefits offered in the lossless compression by applying a choice of preprocessing methods that exploits the advantage of redundancy of the source file. Textual data holds a number of properties that can be taken into account in order to improve compression. Preprocessing cope up with these properties by applying a number of transformations that make the redundancy “more visible” to the compressor. Many preprocessing algorithms come into being for text files which complement each other and are performed prior to actual compression. Here our focus is on the Length-Index Preserving Transform (LIPT), its derivatives ILPT, NIT & LIT and StarNT Transformation algorithm. The algorithms are briefly presented before calling attention to their analysis.

Full Text:

PDF2

Refbacks

  • There are currently no refbacks.


© 2011 Journal of Global Research in Computer Science (JGRCS)
Copyright Agreement & Authorship Responsibility