Bit Stuffing Code Implementation in Java

By -
This is an implementation of the Bit Stuffing popularly used in data communication, also known as one of the concepts of Framing data bits. To know more please click here.

Sample Output:

This is a sample output with data binary data entered as 11001111110.


Program Code:


import java.util.*;
public class BitStuffing
{
       public static void main(String[] args)
      {
              System.out.print("Enter the Binary message: ");
              Scanner sn=new Scanner(System.in);
              String data = sn.nextLine();
              String res = new String();
              String out=new String();
              int counter = 0;
              for(int i=0;i<data.length();i++)
              {    if (data.charAt(i)!='1' && data.charAt(i)!='0')
                        {
                            System.out.println("Enter only Binary values!!!");
                            return;
                        }
                   if(data.charAt(i) == '1')
                        {
                            counter++;
                            res = res + data.charAt(i);
                        }
                   else
                        {
                            res = res + data.charAt(i);
                            counter = 0;
                        }
                   if(counter == 5)
                        {
                            res = res + '0';
                            counter = 0;
                        }
                }
            String inc="01111110"+res+"01111110";
            System.out.println("The Message to be transfered: " +inc);
            System.out.println("Sending Message....");
            counter=0;
            for(int i=0;i<res.length();i++)
            {
                   
                    if(res.charAt(i) == '1')
                        {
                            
                            counter++;
                            out = out + res.charAt(i);
                           
                        }
                    else
                        {
                             out = out + res.charAt(i);
                             counter = 0;
                        }
                   if(counter == 5)
                        {
                              if((i+2)!=res.length())
                              out = out + res.charAt(i+2);
                              else
                              out=out + '1';
                              i=i+2;
                              counter = 1;
                        }
            }
          
             System.out.println("Message Received...Successfully!!!");
             System.out.println("The Destuffed Message is: "+out);
       }
}

Description:

Data Entered is : 11001111110
Flag : 01111110
So basically we look for six consecutive 1's in our data and stuff or insert a "0" after five 1's to distinguish the data from the flag.
While transmitting we insert the flag at both starting and beginning.

At the Receiver's side, we have to destuff our encoded message.
Hence we discard the flag and the stuffed "0" to get our original data. 

Comments

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t
Read more

Employee Management System Using Inheritance in Java

By Sidharth Patnaik -
Image
This program will help you in creating an simple Employee Management System using java language. In this program a class emp is used which has name, id and salary as data members. inside it there are two methods namely get() and disp() which work as getting user input and displaying the output. Scanner class is used as well. This program is an implementation of array of objects. Sample Output : The Code here: import java.util.*; class emp { public String name; public int id,sal; public void get() { Scanner s=new Scanner(System.in); System.out.print("Enter The Name: "); name=s.next(); System.out.print("Enter The id: "); id=s.nextInt(); System.out.print("Enter The sal: "); sal=s.nextInt(); s.close(); } public void disp() { System.out.println("The Name of the employee is "+name+" having id: "+id+"and a salary worth to: "+sal); } } class MainClass extends emp { publ
Read more