b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...

Question

Question

b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of data 11100111- 11011101-00111001-10101001 that

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Solution:

Pros: LRC of n bits can easily detect burst error of n bits.

Cons: If two bits in one data unit are corrupted and two bits in the same position in other data units are also corrupted, LRC can not detect this type of error.

32 bits block of data: 11100111 -11011101-00111001-10101001

If apply LRC, then

11011101 + 11011101 + 00111001 + 10101001

= 1010100110 (but we have to take only 8 bits, therefore the SUM is: 10100110

The final data is 11100111 -11011101-00111001-10101001 - 10100110

Add a comment

Answer 2

Similar Homework Help Questions

1. (10 points) Suppose the information content of a packet has the pattern as follows. An even parity is used. What are the values of the parity bits? Fill in the blanks. 1 1 1 0 0 1 1 0 1 0 0 1 1 1 0...

1. (10 points) Suppose the information content of a packet has the pattern as follows. An even parity is used. What are the values of the parity bits? Fill in the blanks. 1 1 1 0 0 1 1 0 1 0 0 1 1 1 0 1 2. (10 Points) Suppose there is a single bit error in the packet in problem 1 (see below). Show that two-dimensional parity checks can detect and correct it (by finding the row...
3.Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry rippler...

***Please be coherent and conscience. 3.Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry ripplery) has the same delay of one skip logic stage (tskip) and both are 1. Determine the block size Bopt that mininizes the worse-case delay time. 3.Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry ripplery) has the same delay of one skip logic stage (tskip) and both are 1. Determine the...
Question 10 (10 points) Consider a cache of 8 lines of 16 bytes each. Main memory...

Question 10 (10 points) Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that accesses memory in the following sequence of addresses: Loop three times: 10 through 20; 32 through 52. Once: 20 through 35. Suppose the cache is organized as direct mapped. Memory blocks 0, 8, 16 and so on...

computer architecture The sum of the two 32 bit integers may not be representable in 32 bits. In this case, we say that an overflow has occurred. Write MIPS instructions that adds two numbers stor...

computer architecture The sum of the two 32 bit integers may not be representable in 32 bits. In this case, we say that an overflow has occurred. Write MIPS instructions that adds two numbers stored in registers Ss1 and Ss2, stores the sum in register $s3, and sets register Sto to 1 if an overflow occurs and to 0 otherwise. 5. (16pts) 6. Show the IEEE 754 binary representation of the number -7.425 in a single and double 7. If...
Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry ripple (t...

Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry ripple (tcarry) has the same delay of one skip logic stage (tskip) and both are 1. Determine the block size Bopt that mininizes the worse-case delay time Please provide a neat solution
Consider a noisy communication channel, where each bit is flipped with probability p (the probability that...

Consider a noisy communication channel, where each bit is flipped with probability p (the probability that a bit is sent in error is p). Assume that n−1 bits, b1,b2,⋯,b(n−1), are going to be sent on this channel. A parity check bit is added to these bits so that the sum b1+b2+⋯+bn is an even number. This way, the receiver can distinguish occurrence of odd number of errors, that is, if one, three, or any odd number of errors occur, the...

In the last module you learned a formula for calculating bit rate, R = b/t, that...

In the last module you learned a formula for calculating bit rate, R = b/t, that is the number of bits divided by the time. This formula expresses the number of bits that are transmitted over a circuit in a given period of time. In practice, however, we are not only concerned with the number bits transmitted, but also with the number of data bits transmitted over a circuit. The data bits are those that the sender decides to send...
Help me please! Thank you!! 1. Consider the signal set in Figure 1 for binary data...

Help me please! Thank you!! 1. Consider the signal set in Figure 1 for binary data transmission over a channel disturbed by AWGN. The noise is zero-mean and has two-sided PSD No/2. As usual, si(t) is used for the transmission of bit "0" and s2(t) is for the transmission of bit 1." Furthermore, the two bits are equiprobable. Si CC) s2(t) .A 0 Figure 1: A binary signal set, considered in Problem 1 Find and draw an orthonormal basis {фі...
#Get the filepath from the command line import sys P= sys.argv[1] F= sys.argv[2] L= sys.argv[3] B=...

#Get the filepath from the command line import sys P= sys.argv[1] F= sys.argv[2] L= sys.argv[3] B= sys.argv[4] # # Our Helper functions: # # Loads the file at filepath # Returns a 2d array with the data def load2dArrayFromFile (filepath): # Your code goes here: 1 2 23 # # Searches the 2d array 'records' for firstname, lastname. # Returns the index of the record or -1 if no record exists 24 25 # def findIndex ( records, firstname, lastname)...

o Consider the renction 2A(g) + B(g) + 2(g) 2D(8) E(s) Suppose at time =0, the...

o Consider the renction 2A(g) + B(g) + 2(g) 2D(8) E(s) Suppose at time =0, the partial pressures of the reactant gases are 5 atm A, 10 atm B, and 8 atm C. After 20 minutes the partial pressure of A was found to be 1 atm. a) What is the initial total pressure in the flask at time=0? Bus P + P +++ b) What is the total pressure inside the flask after 20 minutes? Set up a start,...

b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...

Homework Answers

Add Answer to:
b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...

Post as a guest

Earn Coins

1. (10 points) Suppose the information content of a packet has the pattern as follows. An even parity is used. What are the values of the parity bits? Fill in the blanks. 1 1 1 0 0 1 1 0 1 0 0 1 1 1 0...

3.Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry rippler...

Question 10 (10 points) Consider a cache of 8 lines of 16 bytes each. Main memory...

computer architecture The sum of the two 32 bit integers may not be representable in 32 bits. In this case, we say that an overflow has occurred. Write MIPS instructions that adds two numbers stor...

Consider a N-bit carry-skip adder with B bits per block. Assume that one stage of carry ripple (t...

Consider a noisy communication channel, where each bit is flipped with probability p (the probability that...

In the last module you learned a formula for calculating bit rate, R = b/t, that...

Help me please! Thank you!! 1. Consider the signal set in Figure 1 for binary data...

#Get the filepath from the command line import sys P= sys.argv[1] F= sys.argv[2] L= sys.argv[3] B=...

o Consider the renction 2A(g) + B(g) + 2(g) 2D(8) E(s) Suppose at time =0, the...

b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...

Homework Answers

Add Answer to: b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...

Post as a guest

Earn Coins

Add Answer to:
b). Identify the pros and cons of LRC (2D parity). Consider a 32 bits block of...