Rearrangement and Grouping of Data Bits for Efficient Lossless Encoding

2016 International Conference on Communication, Image and Signal Processing

物理学;无线电电子学;计算机科学

Shenoy, Ajitha K.B.^1 ; Ajith, Meghana^2 ; Mantoor, Vinayak M.^1

Department of Information and Communication Technology, Manipal Institute of Technology, Manipal University, Manipal, Karnataka, India^1

Department of Computer Applications, Manipal Institute of Technology, Manipal University, Manipal, Karnataka, India^2

关键词: Arithmetic Coding;    Data bits;    Huffman coding;    Lossless encoding;    Non-redundant;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/787/1/012029/pdf
DOI  :  10.1088/1742-6596/787/1/012029

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

This paper describes the efficacy of rearranging and grouping of data bits. Lossless encoding techniques like Huffman Coding, Arithmetic Coding etc., works well on data which contains redundant information. The idea behind these techniques is to encode more frequently occurring symbols with less number of bits and more seldom occurring symbols with more number of bits. Most of the methods fail if there is a non-redundant data. We propose a method to re arrange and group data bits there by making the data redundant and then different lossless encoding techniques can be applied. In this paper we propose three different methods to rearrange the data bits, and efficient way of grouping them. This is first such attempt. We also justify the need of rearranging and grouping data bits for efficient lossless encoding.