Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the Cyclic Redundancy Check (CRC) algorithm: a. Show in detail the calculations that need to be done by sender to generate sending bit stream. b. Show in detail the calculations that need to be done by receiver to check if the bit stream is received correctly.

Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the Cyclic Redundancy Check (CRC) algorithm: a. Show in detail the calculations that need to be done by sender to generate sending bit stream. b. Show in detail the calculations that need to be done by receiver to check if the bit stream is received correctly.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: You are provided the 32-bit values N and M together with the two bit positions i and j. Provide a…

A: In order to answer this question, you will need to develop a program that will insert the number M…

Q: Define the width of a bit, W, to be its length on the transmission medium in meters per bit. Let S…

A: Given: Width of a bit = W Length of the transmission medium in meters per bit. Propagation speed…

Q: Design a DFA to accept all binary strings over {0, 1} which are not divisible by 4. (For example, a…

A: Consider the following inputs, {0, 01, 10, 11, 100, 101, 110........} The state transition diagram…

Q: The very first step in the SHA1 algorithm is to pad the message so that it is a multiple of 512…

A: Including the length of the message in the padding process of the SHA-1 algorithm (and other similar…

Q: Consider a SEC code that protects 8-bit words with 4 parity bits. If we read the value OxABC, is…

A: Given 12 bit data is,0xABC = 1010 1011 1100Here the received parity bits are,p1:1010 1011…

Q: If an unsigned 8-bit integer were to be extended to a 16-bit one, the first 8 most significant bits…

A: The option is the right response to the questions ("False") EXPLANATION: The most significant end of…

Q: Write a VHDL block for the (1-F) function, where F is a 9-bit value used to represent fixed point…

A: if condition_1 then sequential statements elsif condition2 then sequential statements else…

Q: this

A: 1.False Because The two-dimensional parity check can detect up to three errors that occur anywhere…

Q: Calculate (A – B), and (-A – B) for the following pair of binary numbers, assuming a two's…

A: 4. Given: 01111010 00000111 Find: A + B = 01111010 + 00000111 = 10000001 A - B: Take 2's…

Q: 6. Implement F (X,Y,Z) = XY'Z + YZ' by using a) Only one 4-to-1 MUX with X and Y as Select lines for…

A: 6. The given function is : F(X, Y, Z) = X Y ' Z + Y Z ' The canonical SOP form of the above…

Q: When the result of an unsigned arithmetic operation is too big to fit into the destination, what…

A: Introduction: The FLAGS register is the status register of a CPU, and it includes information on the…

Q: For this problem, there are 3 variables. 2 is the most significant bit (leftmost) and xo is the…

A: The Karnaugh Map (K-map) is a graphical tool used in digital logic design to simplify Boolean…

Q: 1. Let x[n]=u[n-2]-u[n-9]. Sketch the result of convolving x[n] with each of the following signals:…

A: According to our companies policy, we are obliged to answer only the first question in case of…

Q: Consider a SEC code that protects 8-bit words with 4 parity bits. If we read the value 0xABC, is…

A: Hamming code is an error correction system which can detect and correct the errors when the data is…

Q: For the source coding: (a) What is/are the benefit(s) of calculating entropy? (b) What is/are the…

A: Note: As per Q and A guidelines, will be solving only 1st question with a) and b) part.

Q: Bits 0 and 1 are sent over an information channel. Due to noise each bit is received incorrectly…

A: Please find the answer below:

Question

Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the
Cyclic Redundancy Check (CRC) algorithm:
a. Show in detail the calculations that need to be done by sender to generate
sending bit stream.
b. Show in detail the calculations that need to be done by receiver to check if
the bit stream is received correctly.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Brief description of the question

VIEW

Step 2: Working of CRC algorithm

VIEW

Step 3: Performing the Cyclic Redundancy Check (CRC) algorithm

VIEW

Solution

VIEW

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Q6 PPLZ,
Answer the given question with a proper explanation and step-by-step solution. Consider a Hamming (7.4) code in which the parity bits are calculated according to the following equations: r0 = a0 + a1 + a2 r1 = a1 + a2 + a3 r2 = a0 + a1 + a3 The following dataword is to be coded with this scheme: format: a3 a2 a1 a0 0010 What is the parity code for the above dataword? Show it in decimal format for (r2,r1,r0); e.g. if the resulting bits are r2=1, r1=0, r0=0 (100), type the decimal equivalent of 100, which is 4.
Can you do number 2 for me please
4. Consider the CRC polynomial P=11012=X³ + X² + 1. a) In order to compute the CRC code word for the information, I=1110101102, How many bits of CRC check sum will be appended? b) In order to send the above information, I, what is the message M will be sent to a receiver with check bits(remainder)? c) If the following message, M = 110110100010 is transmitted to the receiver, what is the remainder of this message? Does it have a transmission error or not?
Q4 PPLZ,
Each item in a store's inventory is assigned a unique binary sequence using binary numerals. If the shop has between 75 and 100 goods in its inventory, what is the minimum amount of bits necessary for each binary sequence?
When the result of an unsigned arithmetic operation is too big to fit into the destination, what flag is set?
You can determine the maximum and minimum possible values for a datatype based on the number of bits that it uses (I cover this in lecture, note it differs for unsigned compared with signed). The idea is to consider which bits should be 0 or 1 to achieve the maximum and minimum values, respectively. 1. For each type in the table, enter the minimum and maximum Base 10 values you can represent. Minimum (Base 10) Maximum (Base 10) Type unsigned byte byte unsigned int int Note: You can express your answers as powers of 2 if you want.