Performance Assessment of Various Encoding Schemes with Bit Stuffing

This paper discusses the implementation of a novel technique of encoding data bits using the concept of bit stuffing in addition to the conventional methods of source coding. This technique can be applied to any of the existing methods of source encoding under controlled conditions. In particular, the method is very efficient when the encoded bits have more number of ones or zeros than a predefined threshold, at any point of time and in any part of the stream. Usually, bit stuffing is a common method used for data compression in data communication layers to reduce the bandwidth. In this paper, we have attempted to incorporate bit stuffing in various encoding schemes and have compared the improvement in performance with and without bit stuffing. The software used for simulation is MATLAB. The primary motivation of this work is to determine the maximum amount of bandwidth savings that can be achieved due to bit stuffing for a random series of alphabets.