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

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.