Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of the fault model and the structure of a circuit-under-test. Experimental results of the compression ratio and the size of the encoder for the proposed ...

In this paper, we propose a new compression technique based on transliteration of Bengali text to English. Compared to Bengali, English is a less symbolic language. Thus transliteration of Bengali text to English reduces the number of characters to be coded. Huffman coding is well known for producing optimal compression. When Huffman principal is applied on transliterated text significant perfo...

There has been much interest in recent years in bounds on the redundancy of Huffman codes, given only partial information about the source word distribution, such as the probability of the most likely source. This work determines upper and lower bounds for the redundancy of Huffman codes of source words which are binomially distributed. Since the complete distribution is known, it is possible t...

Image secret sharing is a technique to share a secret image among the group of participants. These individual shares are useless on their own, but when specified numbers of shares are combined together it gives the original secret image. These image shares has size greater than or equal to size of original image, it require high bandwidth while transmission. Because of the excessive bandwidth r...

In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of ...

This paper proposes a novel compression combined digital image watermarking scheme based on singular value replacement technique. Image compression is achieved using Huffman encoding technique. Huffman encoding is an entropy encoding algorithm offering lossless image compression. The proposed watermarking scheme combines Integer wavelet transform (IWT) with singular value decomposition (SVD). F...

Lossless text data compression is an important field as it significantly reduces storage requirement and communication cost. In this work, the focus is directed mainly to different file compression coding techniques and comparisons between them. Some memory efficient encoding schemes are analyzed and implemented in this work. They are: Shannon Fano Coding, Huffman Coding, Repeated Huffman Codin...

Image compression is an application of data compression that encodes the original image with few bits. The objective of image compression is to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. So image compression can reduce the transmit time over the network and increase the speed of transmission. In Lossless image compress...

Given an tilphabet C = (al! . . . , a,) and a corresponding list of weights [WI, . . . , w,], a Huffman code for this alphabet is a prefix code that minimizes the weighted length of a code string, defined to be Cr.., wili, where li is the length of the code assigned to ai. A. Huffman code can be generated in O(n log n) time for an unsorted list of weights alld in Cl(n) time if the weights are a...

Lake-effect snow is an important constraint on ecological and socio-economic systems near the North American Great Lakes. Little is known about the Holocene history of lake-effect snowbelts, and it is difficult to decipher how lake-effect snowfall abundance affected ecosystem development. We conducted oxygen-isotope analysis of calcite in lake-sediment cores from northern Lower Michigan to infe...