Arithmetic Coding-An Enhanced Implementation Using Locality
2013-06-03 16:34:16   来源：   评论：0 点击：

Abstract—The amount of data that is being stored and transmitted is increasing day by day. This increasing rate affects the performance of every application which depends on storage devices and networks. It has become a necessity to represent more amount of information using the available units of resources. Hence data compression is playing an important role in the information and communication technologies. There are many advantages from using data compression, like gaining space on hard drives or lowering use of transmission bandwidth in the network. There are also many algorithms and tools that are used today in this field. This paper focuses on lossless data compression techniques and suggests a technique to improve the computational efficiency of arithmetic compression scheme employing locality. A comparative study with the basic algorithm demonstrates improved compression performance of the proposed algorithm.

Index Terms—data compression, Huffman coding, arithmetic coding, locality, Burrows-Wheeler, LZ77, LZ78, LZW.

Cite: Lakshmi Sasilal and V. K. Govindan, "Arithmetic Coding-An Enhanced Implementation Using Locality," Lecture Notes on Information Theory, Vol.1, No.3, pp. 136-139, Sept. 2013. doi: 10.12720/lnit.1.3.136-139