In this article, the authors consider the following question about Huffman coding, which is an important technique for compressing data from a discrete source. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be? It is shown that if p is in the range 0 < p _< I/2, and if K is the unique index such that I/FI<+3 < p _< 1/FK+2, where FK denotes the...

We show that the space of all binary Huffman codes for a finite alphabet defines a lattice, ordered by the imbalance of the code trees. Representing code trees as path-length sequences, we show that the imbalance ordering is closely related to a majorization ordering on real-valued sequences that correspond to discrete probability density functions. Furthermore, this tree imbalance is a partial...

In this paper, we propose a media-specific forward error correction (FEC) method based on Huffman coding for distributed speech recognition (DSR). In order to mitigate the performance degradation of DSR in noisy channel environments, the importance of each subvector for the DSR system is first explored. As a result, the first subvector information for the mel-frequency cepstral coefficients (MF...

Greedy Algorithms: In an optimization problem, we are given an input and asked to compute a structure, subject to various constraints, in a manner that either minimizes cost or maximizes profit. Such problems arise in many applications of science and engineering. Given an optimization problem, we are often faced with the question of whether the problem can be solved efficiently (as opposed to a...

Given nonnegative weights (wr, . . . , w,,), the well-known algorithm of Huffman [2] can be used to construct a binary tree with n external nodes and n 1 internal nodes, where the external nodes are labeled with the weights (wr, . . . , w,) in some order. Huffman’s tree has the minimum value of WJ, + * * . + w,,l, over all such binary trees, where lj is the level at which wj occurs in the tree....

A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...

Exposing and exploiting instruction-level parallelism (ILP) is a key component of high performance for modern processors. For example, wide-issue superscalar, VLIW, and dataflow processors only attain high performance when they execute nearby instructions in parallel. This paper shows how to use and modify the Huffman coding tree weight minimization algorithm to expose ILP. We apply Huffman to ...

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

In an earlier work [6] we presented a simple FM-index variant, based on the idea of Huffman-compressing the text and then applying the Burrows-Wheeler transform over it. The main drawback of using Huffman was its lack of synchronizing properties, forcing us to supply another bit stream indicating the Huffman codeword boundaries. In this way, the resulting index needed O(n(H0+1)) bits of space b...

The demand for handling images in digital form has increased dramatically in recent years. Image compression is an effective technique of reducing or less the amount of image information that are required to represent/show an image in better format ,after compression image size get reduced.The objective of image compression is to reduce the amount of digital images information and therefore red...