scholarly journals Huffman Encoding using VLSI

2012 ◽  
pp. 143-145
Author(s):  
Shilpa.K. Meshram ◽  
Meghana .A. Hasamnis
Keyword(s):  
Binary Tree ◽  
Input Data ◽  
Huffman Coding ◽  
Specific Method ◽  
Prefix Code ◽  
Huffman Encoding ◽  
Lossless Data Compression ◽  
Variable Length Coding ◽  
Entropy Encoding ◽  
Tree Method

Huffman coding is entropy encoding algorithm used for lossless data compression. It basically uses variable length coding which is done using binary tree method. In our implementation of Huffman encoder, more frequent input data is encoded with less number of binary bits than the data with less frequency.This way of coding is used in JPEG and MPEG for image compression. Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code. Prefix-free codes means the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol.

scholarly journals Constructing Binary Huffman Tree

2013 ◽  
Vol 21 (2) ◽  
pp. 133-143
Author(s):  
Hiroyuki Okazaki ◽  
Yuichi Futa ◽  
Yasunari Shidama
Keyword(s):  
Data Compression ◽  
Binary Code ◽  
Lossless Compression ◽  
Huffman Coding ◽  
Compression Algorithms ◽  
Huffman Encoding ◽  
Lossless Data Compression ◽  
Entropy Encoding

Summary Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

Huffman Tree Visualization

2012 ◽  
Vol 468-471 ◽  
pp. 1883-1886
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen
Keyword(s):  
Binary Tree ◽  
Path Length ◽  
Object Oriented ◽  
Visual Image ◽  
Huffman Coding ◽  
Object Oriented Method ◽  
Complete Binary Tree ◽  
Coding Method ◽  
Lossless Data Compression ◽  
Tree Visualization

Huffman tree is also called the optimal binary tree, is a kind of weighted shortest path length of the binary tree; Huffman coding is a coding method, which is used for a lossless data compression entropy coding ( right encoding ) optimal coding method. The realization of Huffman tree visualization is of great significance, this paper uses the object-oriented method, using a complete binary tree of Huffman tree visualization, visual image display of the Huffman coding process.

scholarly journals A New Coding Technique and Analysis of Trees

2020 ◽  
Vol 8 (4S5) ◽  
pp. 72-75
Keyword(s):  
Binary Tree ◽  
Rooted Trees ◽  
Huffman Coding ◽  
Prefix Code ◽  
Symmetric Key

A message is encoded using one-time pad Cipher and Huffman coding with certain algorithm. Encoding process is done using a symmetric key known to sender and receiver. Then we get the encoded message as Ciphertext with a binary tree. Using the binary tree we form a prefix code of Huffman coding and we define a new labeling function of edge and vertex labeling. In this paper, we discuss the two methods of encoding algorithm and investigate Tree, Rooted trees, properties, theorem and Median of Huffman binary tree.

Automatic Ship Routing with High Reliability and Efficiency between Two Arbitrary Points at Sea

2018 ◽  
Vol 72 (2) ◽  
pp. 430-446
Author(s):  
Shuaidong Jia ◽  
Zeyuan Dai ◽  
Lihua Zhang
Keyword(s):  
Binary Tree ◽  
High Reliability ◽  
Spatial Database ◽  
Experimental Results ◽  
Ship Routing ◽  
Shortest Distance ◽  
Tree Index ◽  
Tree Method

Due to the limitations of the existing methods (for example, the route binary tree method) that can only automatically generate routes based on a single chart, a method for automatically generating the shortest distance route based on an obstacle spatial database is proposed. Using this proposed method, the route between two arbitrary points at sea can be automatically generated. First, the differences in accuracy and updating time of charts are quantitatively analysed. Next, the mechanism for updating obstacles is designed, an obstacle spatial database is constructed, and the obstacle data extracted from multiple charts are fused. Finally, considering the effect of efficiency on the amount of obstacle data, a route window and an improved R-tree index are designed for quickly extracting and querying the obstacle database. The experimental results demonstrate that compared with existing methods, the proposed method can generate the shortest distance between two arbitrary points at sea and eliminates the limitation of the area of the chart. In addition, with data from multiple charts, the route generated by the proposed method is more reliable than that of the existing methods, and it is more efficient.

Study on Data Compression Algorithm Based on Semantic Analysis

2013 ◽  
Vol 842 ◽  
pp. 712-716
Author(s):  
Qi Hong ◽  
Xiao Lei Lu
Keyword(s):  
Data Compression ◽  
Semantic Analysis ◽  
Traditional Approach ◽  
Basic Element ◽  
Compression Algorithm ◽  
Huffman Coding ◽  
Text Compression ◽  
C Language ◽  
Lossless Data Compression ◽  
Compression Coding

As a lossless data compression coding, Huffman coding is widely used in text compression. Nevertheless, the traditional approach has some deficiencies. For example, same compression on all characters may overlook the particularity of keywords and special statements as well as the regularity of some statements. In terms of this situation, a new data compression algorithm based on semantic analysis is proposed in this paper. The new kind of method, which takes C language keywords as the basic element, is created for solving the text compression of source files of C language. The results of experiment show that the compression ratio has been improved by 150 percent roughly in this way. This method can be promoted to apply to text compression of the constrained-language.

scholarly journals Novel Multiple Bypass Bin Scheme and Low-power Approach for HEVC CABAC Binary Arithmetic Encoder

2018 ◽  
Vol 13 (3) ◽  
pp. 1-11
Author(s):  
Fábio Luís Livi Ramos ◽  
Bruno Zatt ◽  
Marcelo Schiavon Porto ◽  
Sergio Bampi
Keyword(s):  
Low Power ◽  
Video Processing ◽  
Input Data ◽  
Arithmetic Coding ◽  
Video Sequences ◽  
Critical Part ◽  
Binary Arithmetic ◽  
Coding Standards ◽  
Entropy Encoding ◽  
The Cost

HEVC is one of the most recent video coding standards, designed to face a new age of video processing challenges, such as higher video resolutions and limited traffic share bandwidth. The HEVC standard is divided into multiple steps, whereas the entropy encoding is the final stage before the coded bitstream generation. The CABAC (Context Adaptive Binary Arithmetic Coding) is the sole algorithm used for the entropy encoding at HEVC, providing reduced final bitstream generation, at the cost of increasing computational complexity and difficulties for parallelism opportunities. One of the novelties of the CABAC for the HEVC is the increase of certain types of input data (called bins), which have smaller dependencies among them (i.e. bypass bins), thus leading to the possibility to process multiples of them in parallel at once. The present work introduces a novel scheme for multiple bypass bins processing at once, leading to increasing bins-per-cycle throughput compared to related works. Moreover, the new technique is suitable for achieving a BAE (Binary Arithmetic Encoder) architecture (the CABAC critical part) able to process 8K UHD videos. Along with the multiple bypass bins technique, a low-power approach is achieved, based on statistical analysis of the recommended test video sequences, accomplishing around 15%of power savings.

scholarly journals USE OF NEW EFFICIENT LOSSLESS DATA COMPRESSION METHOD IN TRANSMITTING ENCRYPTED BAPTISTA SYMMETRIC CHAOTIC CRYPTOSYSTEM DATA

2016 ◽  
Vol 78 (6-4) ◽  
Author(s):  
Muhamad Azlan Daud ◽  
Muhammad Rezal Kamel Ariffin ◽  
S. Kularajasingam ◽  
Che Haziqah Che Hussin ◽  
Nurliyana Juhan ◽  
...  
Keyword(s):  
Data Compression ◽  
Data Transmission ◽  
Compression Algorithm ◽  
Huffman Coding ◽  
Compression Method ◽  
Compression Technique ◽  
Chaotic Dynamical System ◽  
Fast Encoding ◽  
Compression Mechanism ◽  
Lossless Data Compression

A new compression algorithm used to ensure a modified Baptista symmetric cryptosystem which is based on a chaotic dynamical system to be applicable is proposed. The Baptista symmetric cryptosystem able to produce various ciphers responding to the same message input. This modified Baptista type cryptosystem suffers from message expansion that goes against the conventional methodology of a symmetric cryptosystem. A new lossless data compression algorithm based on theideas from the Huffman coding for data transmission is proposed.This new compression mechanism does not face the problem of mapping elements from a domain which is much larger than its range.Our new algorithm circumvent this problem via a pre-defined codeword list.  The purposed algorithm has fast encoding and decoding mechanism and proven analytically to be a lossless data compression technique.

scholarly journals A Recursive Binary Tree Method for Age Classification of Child Faces

2016 ◽  
Vol 8 (10) ◽  
pp. 56-66 ◽  
Author(s):  
Olufade F.W. Onifade ◽  
◽  
Joseph D. Akinyemi ◽  
Olashile S. Adebimpe
Keyword(s):  
Binary Tree ◽  
Tree Method

scholarly journals Burrows–Wheeler Transform Based Lossless Text Compression Using Keys and Huffman Coding

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1654
Author(s):  
Md. Atiqur Rahman ◽  
Mohamed Hamada
Keyword(s):  
Compression Ratio ◽  
State Of The Art ◽  
Huffman Coding ◽  
Text Compression ◽  
Small Problem ◽  
Research Fields ◽  
Huffman Encoding ◽  
Significant Research ◽  
Burrows Wheeler Transform ◽  
Use Of Internet

Text compression is one of the most significant research fields, and various algorithms for text compression have already been developed. This is a significant issue, as the use of internet bandwidth is considerably increasing. This article proposes a Burrows–Wheeler transform and pattern matching-based lossless text compression algorithm that uses Huffman coding in order to achieve an excellent compression ratio. In this article, we introduce an algorithm with two keys that are used in order to reduce more frequently repeated characters after the Burrows–Wheeler transform. We then find patterns of a certain length from the reduced text and apply Huffman encoding. We compare our proposed technique with state-of-the-art text compression algorithms. Finally, we conclude that the proposed technique demonstrates a gain in compression ratio when compared to other compression techniques. A small problem with our proposed method is that it does not work very well for symmetric communications like Brotli.

Sign in / Sign up

Export Citation Format

Share Document