Modern processors use two or more levels of cache memories to bridge the rising disparity between processor and memory speeds. Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memory. Accessing off-chip memory generally takes an order of magnitude more time than accessin...

Preface In the past nine months, I carried out my the final year project of KTH international master's in SoC (System-on-Chip) at NXP Semiconductors Research (NXP), the Netherlands. Thanks to my supervisors, Prof. Axel Jantsch in KTH and Senior Scientist Tomas Henriksson in NXP. Also thanks to Pieter van der Wolf and Bram Riemens in NXP. During my internship they gave me a lot of help on the te...

hardware data compression algorithm and some algorithmic extensions This paper reports on work at IBM's Austin and Burlington laboratories concerning fast hardware implementations of general-purpose lossless data compression algorithms, particularly for use in enhancing the data capacity of computer storage devices or systems, and transmission data rates for networking or telecommunications cha...

Success of multimedia applications demand on-line transmission of image data. This demands online compression/decompression of image data files. Spatial redundancy of an image data file are detected and removed with a simple and elegant scheme that can be easily implemented on a compression algorithm. Compression hardware having throughput that can match the capacity of high-speed data communic...

The growth in the amount of information available on the Internet and thousands of user queries per second brings huge challenges to the index update and query processing of search engines. Index compression is partially responsible for the current performance achievements of existing search engines. The selection of the index compression algorithms must weigh three factors, i.e., compression r...

This paper describes an audio watermarking scheme based on lossy compression. The main idea is taken from an image watermarking approach where the JPEG compression algorithm is used to determine where and how the mark should be placed. Similarly, in the audio scheme suggested in this paper, an MPEG 1 Layer 3 algorithm is chosen for compression to determine the position of the mark bits and, thu...

RLE is very effective data compression algorithm for last many years. In this paper we proposed a modified and enhanced variation of RLE data compression algorithm. This replacement strategy will help to avoid long length strings with frequent different characters.

With the development of human communications the usage of Visual Communications has also increased. The advancement of image compression methods is one of the main reasons for the enhancement. This paper first presents the main modes of image compression methods such as JPEG and JPEG2000 without mathematical details. Also, the paper describes gradient Haar wavelet transforms in order to constru...

In this article we report on a study of how to use the context tree weight-ing (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modiica-tions of the bas...

In this paper the technique of Genetic Algorithm (GA) is applied for Fractal Image Compression (FIC). With the help of this evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. One of the image compression techniques in the spatial domain is Fractal Image Compression but the main drawback of FIC is that it involves more computat...