Scribd
Upload
13 views

C++ Program - CRC

- CRC

Uploaded by

TEJAS .M.S.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

C++ Program - CRC

- CRC

Uploaded by

TEJAS .M.S.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include

using namespace std;


class CRC
{
public:
int nf, ng, frame[20], gen[10], temp[20], b;
char a;
int* divide(int n, int g, int temp[10], int gen[10]) {
for(int i=0; i<n; i++)
{
if(gen[0]==temp[i])
{
for(int j=0, k=i; j<g+1; j++, k++)
{
if(temp[k]^gen[j]==1)
temp[k]=1;
else
temp[k]=0;
}
}
}
return temp;
}
void input()
{
cout<<"Enter length of your frame:";
cin>>nf;
cout<<"Enter your frame:";
for(int i=0; i<nf; i++)
{
cin>>frame[i];
temp[i]=frame[i];
}
cout<<"Enter length of your generator:"; cin>>ng;
cout<<"Enter your generator:";
for(int i=0; i<ng; i++)
{
cin>>gen[i];
}
ng--;
for(int i=0; i<ng; i++)
{
temp[nf+i]=0;
}
}
void sender_side()
{
int* sender;
sender = divide(nf,ng,temp,gen);
cout<<endl<<"-----Senders Side-----\n"<<"CRC:";
for(int i=0; i<ng; i++)
{
frame[nf+i]=sender[nf+i];
cout<<sender[nf+i]<<' ';
}
cout<<endl<<"Transmitted frame:";
for(int i=0; i<nf+ng; i++)
cout<<frame[i]<<' ';
cout<<endl;
}
int receiver_side()
{
int* receiver;
cout<<"\n-----Receivers Side-----\n"<<"Received message:";
for(int i=0; i<nf+ng; i++)
cout<<frame[i]<<' ';
cout<<endl;
cout<<"Enter which bit you want to change(from 0-"<<nf+ng<<")-";
cin>>b;
if(frame[b]==1)
frame[b]=0;
else
frame[b]=1;
receiver = divide(nf,ng,frame,gen);
cout<<"Error:";
for(int i=0; i<nf+ng; i++)
{
if(receiver[i]!=0)
{
cout<<"Error Detected!!"<<endl;
return 0;
}
}
cout<<"No error detected!"<<endl;
}
};
int main()
{
CRC o;
o.input();
o.sender_side();
o.receiver_side();
return 0;
}

Output:

https://coderspacket.com/c-program-to-implement-cyclic-redundancy-check

You might also like