Results 111 to 120 of about 3,671 (229)

Kompresi Citra Lossless Menggunakan Improved Huffman Coding [PDF]

, 2013
ABSTRAKSI: Diprediksikan global ip traffic akan mencapai 80.5 exabytes per bulan pada tahun 2015, meningkat tiga kali lipat dibandingkan rata-ata penggunaan per bulan pada tahun 2010.
Andaru Putra Farera
core  

Lightweight Data Compression in Wireless Sensor Networks Using Huffman Coding

International Journal of Distributed Sensor Networks, 2014
This paper presents a lightweight data compression method for wireless sensor networks monitoring environmental parameters with low resolution sensors. Instead of attempting to devise novel ad hoc algorithms, we show that, given general knowledge of the ...
Henry Ponti Medeiros, Marcos Costa Maciel, Richard Demo Souza, Marcelo Eduardo Pellenz   +3 more
doaj   +1 more source

Iterative Construction of Reversible Variable-Length Codes and Variable-Length Error-Correcting Codes

, 2004
We propose a generic algorithm for the construction of efficient reversible variable-length codes (RVLCs) and variable-length error-correcting (VLEC) codes, which optimizes the codeword length distribution.
Wang, J., Yang, L-L., Hanzo, L.
core  

Pembuatan Program Kompresi dengan Metode Huffman Coding

, 2012
A common compression method is Huffman coding. This method replace data component with a code called Huffman code. The code found from binary tree traversal. The code is stored in file as harder of life.
Tjhe, Jap Wie
core  

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

, 2021
Today’s high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage ...
Liang, Xin, Rivera, Cody, Tian, Jiannan, Di, Sheng, Tao, Dingwen, Cappello, Franck, Chen, Jieyang   +6 more
core   +1 more source

ON THE CODING GAIN OF DYNAMIC HUFFMAN CODING APPLIED TO A WAVELET-BASED PERCEPTUAL AUDIO CODER

, 2008
This paper evaluates the coding gain of using a dynamic Huffman entropy coder in an audio coder that uses a wavelet-packet decomposition that is close to the subband decomposition made by the human ear. The subband audio signals are modeled as samples of
M. Rosa Zurera, N. Ruiz Reyes, P. Vera C, P. Jarabo Amores, F. López Ferreras   +4 more
core  

Huffman Deep Compression of Edge Node Data for Reducing IoT Network Traffic

IEEE Access
Data compression at the Internet of Things (IoT) edge node aims to minimize data traffic in smart cities. The traditional Huffman Coding Algorithm (HCA) is shown as the most effective compression algorithm for sensor data.
Ammar Said Nasif, Zulaiha Ali Othman, Nor Samsiah Sani, Mohammad Kamrul Hasan, Yousra Abudaqqa   +4 more
doaj   +1 more source

158 LETTER Huffman-Based Test Response Coding

, 2005
SUMMARY Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of
Tomoo Inoue, Hideyuki Ichihara †a, Michihiro Shintani   +2 more
core  

Semantic Huffman Coding using Synonymous Mapping

Semantic communication stands out as a highly promising avenue for future developments in communications. Theoretically, source compression coding based on semantics can achieve lower rates than Shannon entropy.
Liang, Zijian, Xu, Jin, Niu, Kai, Zhang, Ping   +3 more
core   +1 more source

Compression and Decompression of Color MRI Image by Huffman Coding

, 2018
MRI image (Magnetic Resonance Imaging) as a universal body checkup method in modern medicine. It can help doctors to analyze the condition of patients as soon as possible. As the medical images, the MRI images have high quality and a large amount of data,
Zou, Xin
core