Results 191 to 200 of about 1,866 (211)

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 0003, 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

Comments on "Probability estimation in arithmetic and adaptive-Huffman entropy coders"

IEEE Transactions on Image Processing, 1997
This comment points out some omissions in the work of Duttweiler and Chazmas (see ibid., vol.4, p.237, 1995) on credit related to scaled-count estimators that perform count-scaling when the count of the less probable symbol (LPS) reaches a limiting value.
openaire   +2 more sources

A memory-efficient adaptive Huffman coding algorithm for very large sets of symbols

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002
Summary form only given. The problem of computing the minimum redundancy codes as we observe symbols one by one has received a lot of attention. However, existing algorithms implicitly assumes that either we have a small alphabet or that we have an arbitrary amount of memory at our disposal for the creation of a coding tree.
Steven Pigeon, Yoshua Bengio
openaire   +1 more source

Implementation of Adaptive Huffman Codes for PAPR Reduction in OFDM Systems

2020
Orthogonal Frequency Division Multiplexing (OFDM) is one of the upcoming techniques for achieving large data rates in 4G/5G wireless communication. In OFDM system, the data are transmitted over sizable subcarriers and modulated with low symbol rate. High-peak-to-average-power ratio (PAPR) is the major disadvantage in OFDM systems that results in out of
S. P. Vimal, N. Sathish Kumar, M. Kasiselvanathan   +2 more
openaire   +1 more source

Adaptive Huffman coding of 2-D DCT coefficients for image sequence compression

Signal Processing: Image Communication, 1995
Abstract This paper presents a new approach to adaptive Huffman coding of 2-D DCT coefficients for image sequence compression. Based on the popular motion-compensated interframe coding, the proposed method employs self-switching multiple Huffman codebooks for entropy coding of quantized transform coefficients.
Jechang Jeong, Jae Moon Jo
openaire   +1 more source

An efficient and selective image compression scheme using Huffman and adaptive interpolation

2009 24th International Conference Image and Vision Computing New Zealand, 2009
This paper proposes a hybrid approach to compression. It incorporates lossy as well as lossless compression. Various parts of image are compressed in either way, depending on the amount of information held in that part. This scheme consists of two stages. In the first stage the image is filtered by a high pass filter to find the areas that have details.
Sunil Bhooshan, Shipra Sharma
openaire   +1 more source

Compression of text and binary files using adaptive Huffman coding techniques

Conference Proceedings '88., IEEE Southeastcon, 2003
The authors measure the amount of compression that can be accomplished by the use of Huffman coding, and the effects of adaption based on the statistics of the input file. The coding algorithm has been designed to generate codes for character strings instead of for a single character. Each compressed file has a unique set of Huffman codes.
A. Desoky, M. Gregory
openaire   +1 more source