BITSTREAMS Compression of RLE with Bitstuffing

Recent technological breakthrough in high speed processing units and communication devices have enabled the development of high data compression schemes. This paper presents a modified scheme for Run length encoding (RLE). Run length encoding algorithm performs compression of input data based on sequences of identical values. RLE is having some limitations and they have been highlighted and discussed in detail in this paper. In RLE largest number of sequences may increase the number of bits to represents the length of each run, which may increase the size of memory stack which may results in performance degradation. For n-bit run it requires 2n memory stack. If run is greater than n bits we require 2n+1 memory stack to store the run value. An efficient coding technique, Bitstuffing has been suggested in this paper. A new bit different from the original sequence is added in between reduces the repeat length, thereby with the same stack we can represent length as well. This technique is described using VHDL and is implemented on Saprtan3 FPGA