Data compression by using bit stuffing with threshold criteria in run length encoding scheme

Faisal Fayyaz Qureshi; Muhammad Nabeel Asghar; Fiaz Hussain; Ghazanfar A. Safdar; Syed Stiwat Shah

Data compression by using bit stuffing with threshold criteria in run length encoding scheme

Faisal Fayyaz Qureshi
, Muhammad Nabeel Asghar
, Fiaz Hussain
, Ghazanfar A. Safdar
, Syed Stiwat Shah

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Energy is predominantly a scarce resource; there is a strong need for efficient data compression schemes that could be used for energy conservation. This paper proposes a solution to the limitations and problems of original run length encoding scheme has been suggested and performed for each problem to achieve intelligent and efficient coding. Bit stuffing with threshold is introduced as a proposed technique called Bit stuffing with threshold in Run Length Encoding (BST-RLE), with a segment size and the minimum number of similar bits to represent in a segment is known as threshold. Function of bit stuffing in BST-RLE, is to bring the similar bits of same value into a common standard of 7 bits called segment size but ensuring that the minimum numbers of similar value bits meet the threshold criteria(L>=3).. The output of BST-RLE resulted in 15836 bits saved for transmission of same data out of 37146 bits. This means that modified techniques brings 42.6% compression in size of data as compare to its original data size.

Original language	English
Title of host publication	Proceedings of the IADIS International Conference Information Systems 2012, IS 2012
Editors	Pedro Isaias, Luis Rodrigues, Miguel Baptista Nunes, Philip Powell
Publisher	IADIS
Pages	357-361
Number of pages	5
ISBN (Electronic)	9789728939687
Publication status	Published - 2012
Externally published	Yes
Event	IADIS International Conference on Information Systems 2012, IS 2012 - Berlin, Germany Duration: 10 Mar 2012 → 12 Mar 2012

Publication series

Name	Proceedings of the IADIS International Conference Information Systems 2012, IS 2012

Conference

Conference	IADIS International Conference on Information Systems 2012, IS 2012
Country/Territory	Germany
City	Berlin
Period	10/03/12 → 12/03/12

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

BS-RLE
Bit stuffing
Data compression
Energy efficiency
RLE

Cite this

Qureshi, F. F., Asghar, M. N., Hussain, F., Safdar, G. A., & Shah, S. S. (2012). Data compression by using bit stuffing with threshold criteria in run length encoding scheme. In P. Isaias, L. Rodrigues, M. B. Nunes, & P. Powell (Eds.), Proceedings of the IADIS International Conference Information Systems 2012, IS 2012 (pp. 357-361). (Proceedings of the IADIS International Conference Information Systems 2012, IS 2012). IADIS.

Qureshi, Faisal Fayyaz ; Asghar, Muhammad Nabeel ; Hussain, Fiaz et al. / Data compression by using bit stuffing with threshold criteria in run length encoding scheme. Proceedings of the IADIS International Conference Information Systems 2012, IS 2012. editor / Pedro Isaias ; Luis Rodrigues ; Miguel Baptista Nunes ; Philip Powell. IADIS, 2012. pp. 357-361 (Proceedings of the IADIS International Conference Information Systems 2012, IS 2012).

@inproceedings{8281d670a6bb4c86b0e7086ea92b1dbd,

title = "Data compression by using bit stuffing with threshold criteria in run length encoding scheme",

abstract = "Energy is predominantly a scarce resource; there is a strong need for efficient data compression schemes that could be used for energy conservation. This paper proposes a solution to the limitations and problems of original run length encoding scheme has been suggested and performed for each problem to achieve intelligent and efficient coding. Bit stuffing with threshold is introduced as a proposed technique called Bit stuffing with threshold in Run Length Encoding (BST-RLE), with a segment size and the minimum number of similar bits to represent in a segment is known as threshold. Function of bit stuffing in BST-RLE, is to bring the similar bits of same value into a common standard of 7 bits called segment size but ensuring that the minimum numbers of similar value bits meet the threshold criteria(L>=3).. The output of BST-RLE resulted in 15836 bits saved for transmission of same data out of 37146 bits. This means that modified techniques brings 42.6\% compression in size of data as compare to its original data size.",

keywords = "BS-RLE, Bit stuffing, Data compression, Energy efficiency, RLE",

author = "Qureshi, \{Faisal Fayyaz\} and Asghar, \{Muhammad Nabeel\} and Fiaz Hussain and Safdar, \{Ghazanfar A.\} and Shah, \{Syed Stiwat\}",

note = "Publisher Copyright: {\textcopyright} 2012 IADIS.; IADIS International Conference on Information Systems 2012, IS 2012 ; Conference date: 10-03-2012 Through 12-03-2012",

year = "2012",

language = "English",

series = "Proceedings of the IADIS International Conference Information Systems 2012, IS 2012",

publisher = "IADIS",

pages = "357--361",

editor = "Pedro Isaias and Luis Rodrigues and Nunes, \{Miguel Baptista\} and Philip Powell",

booktitle = "Proceedings of the IADIS International Conference Information Systems 2012, IS 2012",

}

Qureshi, FF, Asghar, MN, Hussain, F, Safdar, GA & Shah, SS 2012, Data compression by using bit stuffing with threshold criteria in run length encoding scheme. in P Isaias, L Rodrigues, MB Nunes & P Powell (eds), Proceedings of the IADIS International Conference Information Systems 2012, IS 2012. Proceedings of the IADIS International Conference Information Systems 2012, IS 2012, IADIS, pp. 357-361, IADIS International Conference on Information Systems 2012, IS 2012, Berlin, Germany, 10/03/12.

Data compression by using bit stuffing with threshold criteria in run length encoding scheme. / Qureshi, Faisal Fayyaz; Asghar, Muhammad Nabeel; Hussain, Fiaz et al.
Proceedings of the IADIS International Conference Information Systems 2012, IS 2012. ed. / Pedro Isaias; Luis Rodrigues; Miguel Baptista Nunes; Philip Powell. IADIS, 2012. p. 357-361 (Proceedings of the IADIS International Conference Information Systems 2012, IS 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Data compression by using bit stuffing with threshold criteria in run length encoding scheme

AU - Qureshi, Faisal Fayyaz

AU - Asghar, Muhammad Nabeel

AU - Hussain, Fiaz

AU - Safdar, Ghazanfar A.

AU - Shah, Syed Stiwat

PY - 2012

Y1 - 2012

N2 - Energy is predominantly a scarce resource; there is a strong need for efficient data compression schemes that could be used for energy conservation. This paper proposes a solution to the limitations and problems of original run length encoding scheme has been suggested and performed for each problem to achieve intelligent and efficient coding. Bit stuffing with threshold is introduced as a proposed technique called Bit stuffing with threshold in Run Length Encoding (BST-RLE), with a segment size and the minimum number of similar bits to represent in a segment is known as threshold. Function of bit stuffing in BST-RLE, is to bring the similar bits of same value into a common standard of 7 bits called segment size but ensuring that the minimum numbers of similar value bits meet the threshold criteria(L>=3).. The output of BST-RLE resulted in 15836 bits saved for transmission of same data out of 37146 bits. This means that modified techniques brings 42.6% compression in size of data as compare to its original data size.

AB - Energy is predominantly a scarce resource; there is a strong need for efficient data compression schemes that could be used for energy conservation. This paper proposes a solution to the limitations and problems of original run length encoding scheme has been suggested and performed for each problem to achieve intelligent and efficient coding. Bit stuffing with threshold is introduced as a proposed technique called Bit stuffing with threshold in Run Length Encoding (BST-RLE), with a segment size and the minimum number of similar bits to represent in a segment is known as threshold. Function of bit stuffing in BST-RLE, is to bring the similar bits of same value into a common standard of 7 bits called segment size but ensuring that the minimum numbers of similar value bits meet the threshold criteria(L>=3).. The output of BST-RLE resulted in 15836 bits saved for transmission of same data out of 37146 bits. This means that modified techniques brings 42.6% compression in size of data as compare to its original data size.

KW - BS-RLE

KW - Bit stuffing

KW - Data compression

KW - Energy efficiency

KW - RLE

UR - https://www.scopus.com/pages/publications/84944128074

M3 - Conference contribution

AN - SCOPUS:84944128074

T3 - Proceedings of the IADIS International Conference Information Systems 2012, IS 2012

SP - 357

EP - 361

BT - Proceedings of the IADIS International Conference Information Systems 2012, IS 2012

A2 - Isaias, Pedro

A2 - Rodrigues, Luis

A2 - Nunes, Miguel Baptista

A2 - Powell, Philip

PB - IADIS

T2 - IADIS International Conference on Information Systems 2012, IS 2012

Y2 - 10 March 2012 through 12 March 2012

ER -

Qureshi FF, Asghar MN, Hussain F, Safdar GA, Shah SS. Data compression by using bit stuffing with threshold criteria in run length encoding scheme. In Isaias P, Rodrigues L, Nunes MB, Powell P, editors, Proceedings of the IADIS International Conference Information Systems 2012, IS 2012. IADIS. 2012. p. 357-361. (Proceedings of the IADIS International Conference Information Systems 2012, IS 2012).

Data compression by using bit stuffing with threshold criteria in run length encoding scheme

Abstract

Publication series

Conference

UN SDGs

Keywords

Other files and links

Cite this