Results 161 to 170 of about 23,946 (190)

Low-Complexity Huffman Coding-Based Adaptive Spatial Modulation

IEEE Communications Letters
Yuyang Peng, Poongundran Selvaprabhu, Han Hai   +2 more
exaly   +2 more sources

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

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
Donald L. Duttweiler, Christodoulos Chamzas   +1 more
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

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.
Domenico Cantone, Simone Faro, Emanuele Giaquinta   +2 more
openaire   +3 more sources

Analysis and comparison of adaptive huffman coding and arithmetic coding algorithms

2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2017
One ongoing problem with digital image file sizes is the cost of transferring data over a network. Larger image file sizes result in larger webpage file sizes. Larger webpage file sizes take more time to load and users incur higher data transfer costs when opening these larger webpages.
Phyela Mbewe, Sampson D. Asare
openaire   +1 more source

Adaptive Spatial Modulation Combining BCH Coding and Huffman Coding

2018 IEEE 23rd International Conference on Digital Signal Processing (DSP), 2018
Spatial modulation (SM), a modulation scheme that maps transmitted information onto the antenna parameter, appears as an attractive option for the emerging large-scale multiple-input multiple-output (MIMO) systems. Due to the reduced inter-channel interference (ICI) and signal processing complexity, SM has attracted vast attention to motivate further ...
Tong Xue, Yaping Zhang, Yifei Shen, Zaichen Zhang, Xiaohu You 0001, Chuan Zhang 0001   +5 more
openaire   +1 more source

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

An adaptive, memory-efficient and fast algorithm for Huffman decoding and its implementation

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, 2009
This paper proposes an adaptive algorithm for Huffman decoding and its implementation based on Single-side Growing Huffman Coding approach which provides a memory efficient and highspeed decoding algorithm. The search time of the proposed algorithm for finding a symbol is [CL/4] where CL is the code length of the corresponding symbol. This algorithm is
Hoang-Anh Pham, Van-Hieu Bui, Anh-Vu Dinh-Duc   +2 more
openaire   +1 more source

An adaptive Huffman algorithm for data compression in wireless sensor networks

ISSCS 2011 - International Symposium on Signals, Circuits and Systems, 2011
The major problem in wireless sensor networks (WSN) is the limited energy supply. As the transmission of the data is the largest energy consumption, many studies have turned attention on reducing the amount of bits transmitted. The solution consists in data compression. This article presents a dynamic algorithm based on an adaptive dictionary.
Dragos Ioan Sacaleanu, Rodica Stoian, Dragos Mihai Ofrim   +2 more
openaire   +1 more source