With the developments of Internet Things (IoT) and cloud-computing technologies, cloud servers need storage a huge volume IoT data with high throughput robust security. Joint Compression Encryption (JCAE) scheme based on Huffman algorithm has been regarded as promising technology to enhance method. Existing JCAE schemes still have following limitations: (1) The keys in would be cracked by physi...

An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresponding images, we generated Huffman tables for three images classes: landscape, portrait and document. Comparisons between the new tables and the JPEG standard coding tables, using also different quality settings, hav...

The Huffman tree is a well known concept in data compression discovered by David Huffman in 1952 [7]. A Huffman tree is a binary tree and represents the most efficient binary code for a given alphabetwith respect to a distribution of frequency of its characters. In this paper, we associate any Huffman tree of n leaves with the point in Qn having as coordinates the length of the paths from the r...

In this paper, complementary Huffman coding techniques are proposed for test data compression/decompression of complex SOC designs during manufacturing testing. Instead of the compatible relationship between test data blocks, complementary features between test blocks are also exploited. Based on this property, more test data blocks can share the same codeword and the size of the modified Huffm...

The Adaptive Wavelet Image Compression (AWIC) algorithm is a fast, simple waveletbased image compression technique that follows the classical paradigm of image transformation, quantization, and entropy encoding. A key component of AWIC is a technique of channel symbol definition that provides greatly reduced Huffman table encoding costs, allowing optimal Huffman codewords to be generated and us...

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

This document is disseminated under the sponsorship of the Department of Transportation in the interest of information exchange. The United States Government assumes no liability for its contents or use thereof. Providing an accurate picture of the weather conditions in the pilot's area ofinterest is a highly useful application for ground-ta-air datalinks. The problem with using data links to t...

Although a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Hu...

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