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...

Novel maximal coding compression techniques for the most important file-the text file of any full-text retrieval system are discussed in this paper. As a continuation of our previous work, we show that the optimal maximal coding schemes coincide with the optimal uniquely decodable coding schemes. An efficient algorithm generating an optimal maximal code (or an optimal uniquely decodable code) i...

It has been widely seen that multimedia application has increased in hand held devices such as mobile devices, cellular phones, PDA’s , mobile audio / video player etc. These embedded devices and applications need a huge amount of power to function so improvement in power in these devices has turned out an important issue. This paper presents a novel approach for reducing the bit-width of the d...

We analyse a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. However, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be ma...

Data compression plays an important role in multimedia communication. A major compression technique is performed by converting the fixed-length codes to variable-length codes. Huffman coding is demonstrated to be a very efficient coding scheme and has been widely adopted. However, the variable-length codes increase the difficulties of fast decoding. In addition, the variable decoding time is no...

Traditional text compression algorithms such as Huffman and LZ variants are usually based on 8-bit characters sampling. However, under the unicode representation for multilingual information, the character set of each language such as Chinese and Japanese is consisted of a very number of distinct characters and thus 16-bit or 32-bit character sampling is needed. Consequently, when text compress...

−In this paper, the tolerance of Huffman Coding to memory faults is considered. Many pointer-based and array-based data structures are highly nonresilient to faults. A single fault in a memory array or atree node may result in loss of entire data or an incorrect code stream. In this paper, a fault tolerant designscheme is developed to protect the JPEG image compression system.

We present and apply an empirical methodology for evaluating the effectiveness of dialogues in spoken language systems. This methodology is suitable in particular for evaluation of dialogue-based systems that collect information from the user, such as an automated spoken questionnaire. Our method for assessing effectiveness involves coding answers from users for responsiveness. For this effort,...

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...

Recent advances in audio representation decompose the signal into a parallel combination of sinusoidal, transient, and noise components and then apply specialized techniques to analyze and synthesize each of these components (Levine and Smith 1999). With respect to time-varying sinusoids and wideband noise, knowledge about auditory perception has been used to optimize the representation. In con...