Computer Network - 2

by

 AIM- Write a program to implement various Error

            Detection Mechanisms.

Find minimum hamming distance

n = int(input("Enter the dataword you want: ")) 

bit = int(input("How many bit of dataword you want to enter: ")) 

data = []

for i in range(n):

 temp = input("Enter dataword "+str(i+1)+ ": ")

 if temp not in data:

   data.append(temp) 

 else:

   print("You enter duplicate dataword.") 

minimumhamming = []

for i in range(len(data)):

 c1 = data[i] 

 for j in range(i+1,len(data)):

   count = 0 

   c2 = data[j] 

 for k in range(bit):

   if(c1[k] != c2[k]):

     count+=1 

 minimumhamming.append(count) 

print("Minimum hamming distance is ",min(minimumhamming))


Checksum

def findChecksum(c, k): 

 Sum = bin(int(c[0], 2)+int(c[1], 2)+int(c[2], 2)+int(c[3], 2))[2:] 

 if(len(Sum) > k):

   x = len(Sum)-k 

   Sum = bin(int(Sum[0:x], 2)+int(Sum[x:], 2))[2:] 

 if(len(Sum) < k):

   Sum = '0'*(k-len(Sum))+Sum

 Checksum = '' 

 for i in Sum: 

   if(i == '1'):

     Checksum += '0'

 else:

   Checksum += '1'

   

   return Checksum 

 

def checkReceiverChecksum(c, k, Checksum):

 ReceiverSum = bin(int(c[0], 2)+int(c[1], 2)+int(Checksum, 2) + int(c[2], 2)+int(c[3], 2)+int(Checksum, 2))[2:] 

 if(len(ReceiverSum) > k):

   x = len(ReceiverSum)-k 

   ReceiverSum = bin(int(ReceiverSum[0:x], 2)+int(ReceiverSum[x:], 2))[2:]

 ReceiverChecksum = ''

 for i in ReceiverSum:

   if(i == '1'):

     ReceiverChecksum += '0'

   else:

     ReceiverChecksum += '1'

 return ReceiverChecksum


seg = int(input("Enter the segment you want: ")) 

k = int(input("How many bits you want for each segment: ")) 

c = list(input("\nEnter the original data:").strip().split())[:seg]

Checksum = findChecksum(c, k) 

ReceiverChecksum = checkReceiverChecksum(c, k, Checksum)

print("Checksum generated at sender side:", Checksum) 

finalsum=bin(int(Checksum,2)+int(ReceiverChecksum,2))[2:] 

finalcomp='' 

for i in finalsum: 

 if(i == '1'):

   finalcomp += '0'

 else:

   finalcomp += '1'

if(int(finalcomp,2) == 0):

 print("Receiver Checksum is equal to 0") 

 print("Accept Data")

else:

 print("Receiver Checksum is not equal to 0") 

 print("Error Detected")



CRC

def crc(msg, divisor):

    while len(msg) >= len(divisor):

        if msg[0] != '0':

            for i in range(len(divisor)):

                if divisor[i] == msg[i]:

                    msg[i]= '0'

                else:

                    msg[i] = '1'

        del msg[0]

    return msg

 

msg = input("Enter the original message: ")

divisor = input("Enter the divisor: ")


temp = msg

msg = msg + "0"*(len(divisor)-1)

msg = list(msg)

msg = crc(msg, divisor)

send_msg = temp+"".join(msg)


print(f"Message sent to reciever: {send_msg}")

lis_send_msg = list(send_msg)

ans = input("Do you want to change any bit in your message: ")


if ans == "y" or ans == "Y":

    bit_pos = int(input("Which bit you want to change in sent message: "))

    if lis_send_msg[bit_pos] == "0":

        lis_send_msg[bit_pos] = "1"

    elif lis_send_msg[bit_pos] == "1":

        lis_send_msg[bit_pos] = "0"


receive_msg = "".join(lis_send_msg)


msg = crc(list(receive_msg), divisor)

if msg.count('1') != 0:

    print("Error")

else:

    print("No error")

    print(f"Receive message: {receive_msg[0:(len(receive_msg)-(len(divisor) -1)):]}")


Comments

Post a Comment

Popular posts from this blog

Computer Architecture and Organization - 4

by
Image
Aim:  To implement various 4-bit arithmetic Micro-operations           using arithmetic unit.   Theory Arithmetic micro operation of the form L:   R A  ( R A + R B ) refers to two data items contained in R A and R B input to a parallel adder with the result being stored back in R A (Fig.). Loading      of the result in R A is subject to the availability   of the control   signal designated as L   (that   is   load control of R A ) . Note that adder being a combinational logic, the adder output is available after a delay of the associated combinational circuit. Input to adder may be also controlled by providing AND word gates on the data paths from R A and R B to the adder under the control signal C (Fig.). the control signals `C' and 2's complement are at logic `0' for add operation.   The subtract micro operation L:   R A  ( R A - R B ) in 2's comp...
Read more

Design and Analysis of Algorithms - 2

by
Image
Implement functions to print n th Fibonacci number using iteration and recursive method. Compare the performance of two methods by counting number of steps executed on various inputs. Also draw a comparative chart. Code:   #include<stdio.h>   int count_ite=0; int count_rec=0; void febo_ite(int ); int febo_rec(int );   int main() {     int n,ans;     printf("Enter position of number: ");     scanf("%d",&n);     febo_ite(n);     ans=febo_rec(n);     printf("Using Recursion: %d th number is = %d\n",n,ans);     printf("No of Steps= %d\n\n",count_rec); }   void febo_ite(int n) {     count_ite++;     int next,i, first=0,second=1;     count_ite++;     if(n==0)     {         count_ite++;  ...
Read more

Design and Analysis of Algorithms - 6

by
Image
Implement program for randomized version of quick sort and compare its performance with normal version of quick sort using steps count on various number of inputs.   Code: #include<stdio.h> #include<stdlib.h> #include<time.h>   int count=0; int r_count=0; void quick_sort(int a[],int start,int n) {     int i,j,pivot,temp;     count++;     if(start<n)         {             count++;             pivot=start;             count++;             i=start;             count++;             j=n;     ...
Read more

Design and Analysis of Algorithms - 1

by
Image
Implement a function for each of following problems and count the  number of steps executed/Time taken by each function on various  inputs and write complexity of each function. Also draw a  comparative chart. In each of the following function N will be passed  by user.                     1. To calculate sum of 1 to N number using loop.                     2. To calculate sum of 1 to N number using equation.                     3. To calculate sum of 1 to N numbers using recursion. Code:   #include <stdio.h> int count_loop=0; int count_rec=0; int count_eq=0;   int sum_loop(int n) {     int i,sum=0;     count_loop++;     for(i=1;i<=n;i++)     {         count_loop++; ...
Read more

Artificial Intelligence - 7

by
Image
  AIM: Write a program to build Multi-layer Perceptron to implement any Boolean functions as mentioned below without using any python packages. AND, OR, XOR, XNOR, NOR, NAND, NOT x1, NOT x2, NULL, IDENTITY, INHIBITION ( 𝑥 1 ∧ ¬ 𝑥 2), INHIBITION ( 𝑥 2 ∧ ¬ 𝑥 1), TRANSFER x1, TRANSFER x2, IMPLICATION ( 𝑥 1 ∨ ¬ 𝑥 2), IMPLICATION ( 𝑥 2 ∨ ¬ 𝑥 1)   Program: class  perceptronNeuron:      def   __init__ ( self ,  x ,  w ,  w0 ):         l = [ww  for  ww  in  x]         l.insert( 0 ,  1 )          self .x = l          self .y =  0         l = [ww  for  ww  in  w]         l.insert( 0 ,...
Read more