-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.cpp
More file actions
180 lines (151 loc) · 3.63 KB
/
index.cpp
File metadata and controls
180 lines (151 loc) · 3.63 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
#include<bits/stdc++.h>
using namespace std;
int p=0;
vector<int> genHammingCode(int siz){
/* Input data bits from the user */
/* Finding parity bits -> using bit manipulation*/
for(int i=0;i<siz;i++){
int num = (1<<i);
if(num>=(i+1+siz)){
p = i;
break;
}
}
/* Actual data size */
int dataSize = siz + p;
// cout<<"\nData size is : "<<dataSize<<endl;
int arr[dataSize];
/* Storing bits in queue */
queue<int>bits;
cout<<"Enter bit by bits : ";
for(int i=1;i<=siz;i++){
int bit;cin>>bit;
bits.push(bit);
}
/*Generating hamming code */
for(int i=1;i<=dataSize;i++){
if( (i & (i-1)) ){ // given number is not power of two
arr[i] = bits.front();
bits.pop();
}
else{
arr[i]=0;
}
}
/* Inserting Parity Bit */
int pBit = 1;
while(pBit<=p){
vector<int>v;
int d = pBit-1;
for(int i=1;i<=dataSize;i++){
if( (i & (1<<(d))) != 0){ // pBit th set asel tar stack madhye tak
v.push_back(arr[i]);
}
}
int one_cnt = count(v.begin(),v.end(),1);
if(one_cnt % 2 != 0){
int num = (1<<d);
arr[num] = 1; // even parity ke liye change
}
pBit++;
}
// Printing Hamming Code
cout<<"\nSender Data : "<<endl;
for(int i=1;i<=dataSize;i++){
// cout<<i<<" "<<endl;
cout<<arr[i]<<" ";
}
cout<<endl;
/* Receiver Side */
srand(time(0));
int toggleBit = (rand() % 10) + 1;
if(toggleBit<=dataSize && toggleBit !=0){
if(arr[toggleBit]==0){
arr[toggleBit]=1;
}else{
arr[toggleBit]=0;
}
}
cout<<"\nReceiver Data : "<<endl;
for(int i=1;i<=dataSize;i++){
cout<<arr[i]<<" ";
}
cout<<endl;
vector<int>bitss;
for(int i=1;i<=dataSize;i++){
int d = arr[i];
bitss.push_back(d);
}
return bitss;
}
void checkErroBit(vector<int>&bitss){
int DataBit = bitss.size();
int sizee = DataBit;
int userBit[sizee];
for(int i=1;i<=sizee;i++){
userBit[i]=bitss[i-1];
}
stack<int>bitNoError;
int pBit = p;
// int pBit = 1;
while(pBit>=1){
vector<int>v;
int d = pBit-1;
for(int i=1;i<=sizee;i++){
if( (i & (1<<(d))) != 0){ // pBit th set asel tar vector madhye tak
v.push_back(userBit[i]);
}
}
int one_cnt = count(v.begin(),v.end(),1);
if(one_cnt % 2 != 0){
int num = (1<<d);
// userBit[num] = 1; // even parity ke liye change
bitNoError.push(1);
}
else{
bitNoError.push(0);
}
pBit--;
}
/* Calculating error bit number */
int ans = 0;
int i =0;
while(!bitNoError.empty()){
int num = (1<<i);
if(bitNoError.top()){
ans += num;
i++;
}
else{
i++;
}
bitNoError.pop();
}
if(ans){
cout<<"\nError Bit is : "<<ans<<endl;
cout<<"\nCorrect Data : ";
for(int i=1;i<=sizee;i++){
if(i==ans){
if(userBit[i]==1){
cout<<0<<" ";
}else{
cout<<1<<" ";
}
}
else{
cout<<userBit[i]<<" ";
}
}cout<<endl;
}
else{
cout<<"\nNo Error in Data. Successfully Accurate Data Received."<<endl;
}
cout<<endl;
}
int main(){
int siz;
cout<<"\nEnter the count of bits you want to send data ? ";
cin>>siz;
vector<int>bits=genHammingCode(siz);
checkErroBit(bits);
}