Question

In: Computer Science

An 8-bit byte with binary value 11001101 is to be encoded using an even-parity Hamming code....

An 8-bit byte with binary value 11001101 is to be encoded using an even-parity Hamming code.
What is the binary value after encoding?

A bit stream 10101010 is transmitted using the standard CRC method. The divisor is 1011.
Show the actual bit string transmitted. Suppose the second bit from the left is inverted during
transmission. Show that how this error is detected by the receiver?

What is the maximum size of the sender window and receiver windows for each of the following
protocols when the number of bits in the sequence field is 8?
c. Go-Back-N ARQ
d. Selective-Repeat ARQ


Compare and contrast the Go-Back-N ARQ Protocol with Selective-Repeat ARQ describing
the process of each protocol with a suitable example.

Solutions

Expert Solution

1) Binary string=11001101

step 1: finding all the bits in positions of power of 2: i.e. 1,2,4,8

These will respectively be parity bits P1, P2, P3, P4

Bits at locations not in the power of 2 i.e. 3,5,6,7 can be represented as:

3= 1+2

5=1+4

6=2+4

7=1+2+4

each of these is represented as a sum of powers of 2.

To find P1: notice position of ' 1' in 3, 5 and 7. We see bit 1 occuring over there. Counting the number of times 1 appears=3, which is odd. P1=1

To find P2: notice position of '2' in 3,6 and 7. '2' appears only in 3 and 7 at lthe second position. Hence the number of times it occurs=2. which is even. Thus P2=0

To find P3: notice position of '4' in 5, 6 and 7. '4' occurs only in 7 at the third position. hence the number of times it occurs=1. Which is odd. Thus P3=1

To find P4: notice position of '8' in above. As it doesn't occur at all, count is considered to be=0. Which is even. Thus P4=0

After encoding, we get

10011100

2) Part A: CRC actual bit transmission

2 B) Second bit from the left is inverted

3) c) Sender window size Go- back N= 2 to the power of n -1= 2 to the power of 8 -1= 64-1=63

Receiver window size=1

3) d) Sender window size Selective repeat = at most half of 2 to the power of n= 2 to the power of 8/2=64/2=32

Receiver window size=32


Related Solutions

Construct an even parity Hamming code for 1101010
Construct an even parity Hamming code for 1101010
Given the 21-bit even-parity Hamming code: 0 1010 0111 0011 0000 0101 and assuming there is...
Given the 21-bit even-parity Hamming code: 0 1010 0111 0011 0000 0101 and assuming there is one incorrect bit. a. Which bit is incorrect? My educated guess for what the incorrect bit maybe has me thinking it is the '1' bit at the end of the '0111' byte, but I have no full proof as to why it is that specific bit. Am I in the right area to think that? b. After the error is corrected, what decimal number...
The data to be sent : 11011100110, how to create the Hamming code with even parity?...
The data to be sent : 11011100110, how to create the Hamming code with even parity? If the right most bit is changed due to noise during transmission, how does the receiver to correct the incorrect bit. Assume only one bit is altered during transmission.  
A 12-bit Hamming code word containing 8 data bits and 4 parity bits is read from...
A 12-bit Hamming code word containing 8 data bits and 4 parity bits is read from memory. What was the original 12-bit word written into memory, if the 12-bit word read were the following? (i) 000011101010 (ii) 101110000110 (iii) 101111110100
Construct an even parity Hamming code with a total of 7 bits (4 data bits and...
Construct an even parity Hamming code with a total of 7 bits (4 data bits and 3 check bits).
Differentiate between parity code and hamming code with examples
Differentiate between parity code and hamming code with examples
Represent -60 in binary using 8-bit signed magnitude. Add the following unsigned 8 bit binary numbers...
Represent -60 in binary using 8-bit signed magnitude. Add the following unsigned 8 bit binary numbers as shown. 01110101 + 00111011 Add the following unsigned 8 bit binary numbers as shown. 01000100 + 10111011
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a.6thbit position. b.11thbit position.Assume an odd-parity scheme for this problem.
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a. 6th bit position. b. 11th bit position. Assume an odd-parity scheme for this problem.
You and a friend are using the C(7,4) Hamming code to send some 4-bit messages to...
You and a friend are using the C(7,4) Hamming code to send some 4-bit messages to each other. (a) You encode the message 1010 and send the encoded 7-bit sequence to your friend, who receives 1011011. How many errors were introduced during transmission? (b) You subsequently receive the encoded sequence 0111011 from your friend. Assuming at most one error, what is the 4-bit message that your friend sent?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT