DocumentCode
561279
Title
Modified run length encoding scheme with introduction of bit stuffing for efficient data compression
Author
Amin, Asjad ; Qureshi, Haseeb Ahmad ; Junaid, Muhammad ; Habib, Muhammad Yasir ; Anjum, Waqas
Author_Institution
Dept. of Telecommun. & Electron. Eng., Islamia Univ. of Bahawalpur, Bahawalpur, Pakistan
fYear
2011
fDate
11-14 Dec. 2011
Firstpage
668
Lastpage
672
Abstract
This paper presents a modified scheme for run length encoding. A significant improvement in compression ratio for almost any kind of data can be achieved by the proposed scheme. All the limitations and problems in the original run length encoding scheme have been highlighted and discussed in detail in this research paper. A proposed solution has been suggested and performed for each problem to achieve intelligent and efficient coding. One of the major problems with original design is that a larger number of bits are used to represent length of each run. This has been resolved by introducing bit stuffing in RLE. Such larger sequences that affects compression ratio are broken into small sequences using bit stuffing. To allow more compression and flexibility, the length of maximum allowable bit sequence is not fixed and can be adjusted with input. Secondly we ignore the large numbers of small sequences that are largely responsible for expansion of data instead of compression. Four random sequences have been analyzed and when applied by modified scheme, a compression ratio of as high as 50% is observed.
Keywords
data compression; encoding; RLE; bit stuffing; data compression ratio; maximum allowable bit sequence; random sequences; run length encoding scheme; Bit rate; Computer science; Data compression; Encoding; Image coding; Memory; Receivers;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet Technology and Secured Transactions (ICITST), 2011 International Conference for
Conference_Location
Abu Dhabi
Print_ISBN
978-1-4577-0884-8
Type
conf
Filename
6148417
Link To Document