Results 151 to 160 of about 23,892 (198)

Weighted Adaptive Huffman Coding

2020 Data Compression Conference (DCC), 2020
Huffman coding is known to be optimal in case the alphabet is known in advance, the set of codewords is fixed and each codeword consists of an integral number of bits. If one of these conditions is violated, optimality is not guaranteed. In the dynamic variant of Huffman coding the encoder and decoder maintain identical copies of the model; at each ...
Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira   +3 more
openaire   +1 more source

Algorithms for adaptive Huffman codes

Information Processing Letters, 1984
L'algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de transmissions connues. On considere ici seulement les codes d'Huffman binaires. On decrit un algorithme qui peut etre generalise, mais le systeme binaire reste certainement le mieux adapte aux applications ...
Gordon V. Cormack, R.Nigel Horspool
openaire   +1 more source

Adaptive image compression using Adaptive Huffman and LZW

2016 International Conference on Information & Communication Technology and Systems (ICTS), 2016
In this digital era, the need of storing data has increased rapidly. This circumstance is proportional to the size of files and their storage. In order to decrease the required big size of storage, the file size should be reduced by still considering the quality of the respective data.
Djuned Fernando Djusdek, Hudan Studiawan, Tohari Ahmad   +2 more
openaire   +1 more source

Adaptive Spatial Modulation Using Huffman Coding

2016 IEEE Global Communications Conference (GLOBECOM), 2016
Antenna switch enables multiple antennas to share a common RF chain, thus an additional spatial dimension, i.e., antenna index, can be utilized in the design of single RF chain MIMO and information can be conveyed via both signal space and spatial dimension.
Wei Wang, Wei Zhang
openaire   +1 more source

A fast-adaptive Huffman coding algorithm

IEEE Transactions on Communications, 1993
The Huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to be encoded is necessary, and the encoded data propagate errors. The first problem can be solved by adaptive coding, while the second problem can be partly solved by segmenting data into segments.
Lu, Wei-Wei, Gough, M. P.
openaire   +2 more sources

Dynamic mapping technique for adaptive Huffman code

Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation, 2002
A new adaptive Huffman code which has low hardware cost and high compression efficiency is proposed. The adaptation principle of this code is to dynamically change the mapping relationship between symbols and codewords while keeping all codewords unchanged.
null Liang-Wei Lee, null Liang-Ying Liu, null Jhing-Fa Wang, null Jau-Yien Lee   +3 more
openaire   +1 more source

Probability estimation in arithmetic and adaptive-Huffman entropy coders

IEEE Transactions on Image Processing, 1995
Entropy coders, such as Huffman and arithmetic coders, achieve compression by exploiting nonuniformity in the probabilities under which a random variable to be coded takes on its possible values. Practical realizations generally require running adaptive estimates of these probabilities. An analysis of the relationship between estimation quality and the
D L, Duttweiler, C, Chamzas
openaire   +2 more sources

Data compression through adaptive Huffman coding schemes

2000 TENCON Proceedings. Intelligent Systems and Technologies for the New Millennium (Cat. No.00CH37119), 2002
A number of data compression techniques have been introduced to reduce the text/data storage and transmission costs. This paper describes the development of a data compression system that employs adaptive Huffman method for generating variable-length codes. Construction of the tree is discussed for gathering latest information about the entered message.
M.Y. Javed, A. Nadeem
openaire   +1 more source

ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS

International Journal of Foundations of Computer Science, 2012
In this paper we propose an efficient approach to the compressed string matching problem on Huffman encoded texts, based on the BOYER-MOORE strategy. Once a candidate valid shift has been located, a subsequent verification phase checks whether the shift is codeword aligned by taking advantage of the skeleton tree data structure.
CANTONE, Domenico, FARO, SIMONE, Giaquinta E.   +2 more
openaire   +2 more sources

An Adaptive Huffman Decoding Algorithm for MP3 Decoder

2010 Fifth IEEE International Symposium on Electronic Design, Test & Applications, 2010
This paper proposes a novel array data structure to represent Huffman code table and an adaptive algorithm for Huffman decoding based on Single-side Growing Huffman Coding approach which provides a memory efficient and high-speed decoding algorithm. The search time of the proposed algorithm for finding a symbol is the ceiling of (CL/4) where CL is the ...
Hoang-Anh Pham, Van-Hieu Bui, Anh-Vu Dinh-Duc   +2 more
openaire   +1 more source