Lossless data compression for computer

Dissertant

Abd al-Karim, Ayman

University

University of Technology

Faculty

-

Department

Computer Sciences Department

University Country

Iraq

Degree

Master

Degree Date

2000

English Abstract

Data compression is considered one of the important fields of data processing and management due to the rapid development in the information technology nowadays.

This importance arises especially when there is a need for storing huge amount of data or transmitting through the communication lines for remote access purposes. In this work a study of several data compression techniques (the most commonly methods) is performed.

This study analyzes these techniques with illustrative examples, determines the best type of data that each method can work with and stating the conclusions and recommendations related to the selected techniques.

The Lemple Ziv class of adaptive dictionary data compression techniques has become very popular today..

In competition with these techniques arithmetic algorithm gives better compression but runs much more slowly.

This work drops the attention -to these two classes and shows how the algorithm that combines techniques from both classes provides higher performance (i.

e.

speed / compression trade off). A new technique for coding is proposed which guarantees a fully lossless data compression. The strength point in the proposed method is obtained form two powerful techniques (Arithmetic and an improved version of Lemple Ziv method) each of which achieves high compression in different domain. Arithmetic compression depends on assigning certain number to the entire data stream, which counted best method in the statistical types of data, compression.

Main Subjects

Information Technology and Computer Science

Topics

• Management
• Databases

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-306236