NDLI: High-speed statistical compression using self-organized rules and predetermined code tables

Content Provider	IEEE Xplore Digital Library
Author	Murashita, K. Satoh, N. Okada, Y. Yoshida, S.
Copyright Year	1996
Description	Author affiliation: Fujitsu Labs. Ltd., Atsugi, Japan (Murashita, K.; Satoh, N.; Okada, Y.; Yoshida, S.)
Abstract	Statistical compression methods using arithmetic coding have a high-compression ratio. However, their complexity limits their application due to the inherent computation overhead for a software implementation. There is an increasing need for faster data compression methods to improve the capabilities of existing data storage and communications technology. We have examined a statistical method which focuses on speed rather than compression performance. To obtain both a good compression ratio and fast processing speed, we previously proposed a simple statistical compression scheme using high-order context modeling and splay coding. However, splay coding still had a large processing overhead, even though it used binary code tree conversion instead of complicated statistical calculations. We aim to enhance the processing speed of our scheme while maintaining its high compression performance.
File Size	81880
File Format	PDF
ISBN	0818673583
ISSN	10680314
DOI	10.1109/DCC.1996.488381
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-03-31
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data compression Context modeling Frequency Laboratories Arithmetic Application software Memory Communications technology Statistical analysis Binary codes
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Grouping algorithm for lossless data compression

Using Fibonacci Compression Codes as Alternatives to Dense Codes

Self-organized dynamic Huffman coding without frequency counts

Context-dependent vs. context-free: performance comparison of grammar-based codes

PPM model cleaning

The B-coder: an improved binary arithmetic coder and probability estimator

Reduced code transmission and high speed reconstruction of Huffman tables

A New Efficient Algorithm for Lossless Binary Image Compression

Low-complexity compression of short messages

High-speed statistical compression using self-organized rules and predetermined code tables

Similar Documents

Grouping algorithm for lossless data compression

Using Fibonacci Compression Codes as Alternatives to Dense Codes

Self-organized dynamic Huffman coding without frequency counts

Context-dependent vs. context-free: performance comparison of grammar-based codes

PPM model cleaning

The B-coder: an improved binary arithmetic coder and probability estimator

Reduced code transmission and high speed reconstruction of Huffman tables

A New Efficient Algorithm for Lossless Binary Image Compression

Low-complexity compression of short messages

High-speed statistical compression using self-organized rules and predetermined code tables