Reconsider 111 011 000 in a binary format 2.1) Find the codeword corresponding to this dataword using the CRC error detection technique, and the divisor polynomial g(x) = x°+x?+1. Do Binary division with Os and 1s. 2.2) Compute now the codeword corresponding to this dataword assuming that the divisor polynomial that is used is f(x) = x+1. Do Polynomial division. 2.3) Assume that an error corrupted the first two bits of the dataword; show how the CRC technique allows you to detect such an error using the divisor of question 2.2.

Reconsider 111 011 000 in a binary format 2.1) Find the codeword corresponding to this dataword using the CRC error detection technique, and the divisor polynomial g(x) = x°+x?+1. Do Binary division with Os and 1s. 2.2) Compute now the codeword corresponding to this dataword assuming that the divisor polynomial that is used is f(x) = x+1. Do Polynomial division. 2.3) Assume that an error corrupted the first two bits of the dataword; show how the CRC technique allows you to detect such an error using the divisor of question 2.2.

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

Similar questions

79. Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: a. (1+x) is factor of G(x) b. (1-x) is factor of G(x) c. (1+x^2) is factor of G(x) d. x is factor of G(x)
Consider the following code which includes a parity check for the third digit: C=(000,011,101,110). You get the third digit by adding the first two and then using the remainder on division by 2. Can this code detect and count single errors? how can this be implemented?
Implement the following error detection and error correction algorithms using C programming for Hamming code. For Hamming codes, flip a bit in the data and implement the algorithm to correct the same on the receiver side.
Problem F. 73154. Trailing zeros Input file: Output file: Time limit: Memory limit: standard input standard output 1 second 256 megabytes In this problem, you are given 8-bit number r. Find the number of trailing zeros in its binary representation. Trailing zeros are the ones that we encounter until the first 1-bit if we traverse the binary representation from right to left. For example, the binary representation of the mumber 96 is 01100000. Number of 0-bits until the first 1-bit is 5 (considering that we traverse the binary representation from right to left). Input The first line of input contains a single number z – 8-bit number (1
Q10/ G(A,B,C,D,E,F)={(2,3,5,7,22,23,32,33,34, 35,37,39,52,53,54,55)+ dz(8,9,10,11,16,17,18,19,60,61,62,63) Select 4-varabe only and rewrite the term in binary with respect to the other two variable, the function G will :be G(A,B,C,D) =Σm (8,1 1 ) +Σd (4,1 0,1 5) +ΣΕ(0,1 ) +Σ F(5,9) G(A,B,C,D) =Σm (8,1 3) + Σd (2,4,1 5)+ΣΕ(0,5) + ΣF (. 1,9) G(AB,C,D) =Σm(11,9)+Σd (10,4,1 5) +ΣΕ (1,5)+Σ F(0,8) G(A,B,C,D) =Σm (1 2,9) +Σd (5,8,1 5) +ΣΕ(2,10)+Σ F(3,11) None of them O
Z1
Wite a MIPS code that returns the right-justified version of the given value. Right justification is (in this case) the process of removing all zeros from the right side of the value For example 2976 (hex 0xBA0), in binary, is 0b101110100000 Given 2976 as it's argument, function should return 0b1011101 which is 93 (hex 0x5D) For example 983040 (hex 0xF0000), in binary, is 0b11110000000000000000 Given 983040 as it's argument, should return 0b1111 which is 15 (hex 0xF) Your program can assume that all integers will fit in a MIPS register. You may define and call your own functions if you wish. Your solution must be in MIPS only. Your solution must not be in C, C++, Python, or any other language. No error checking is necessary or required.
a. Give an example of a value that can't be represented in 32-bit IEEE because it doesn't have a finite representation in binary. Explain (i.e. show that it doesn't have a finite representation). b. Give an example of a value that can't be represented in 32-bit IEEE because it's out of the range of values that can be represented in this format. Explain (i.e. show that this value is out of the range of expressible values of 32-bit IEEE 754).
By using an appropriate substitution, the definite integral transformed into which one of the following integrals? O 7/3 Jx/6 01 3 (u²+u) du */3 ² (²+u) du n/6 1/3 03 (²+1) du x/6 *cos(32) (sin³ (32) + 1) dz can be (1² + 1) du 03 (u² + u) du
Scenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most negative number?
2.7 This problem introduces a hash function similar in spirit to SHA that operates on letters instead of binary data. It is called the toy tetragraph hash (tth).8 Given a message consisting of a sequence of letters, tth produces a hash value consisting of four letters. First, tth divides the message into blocks of 16 letters, ignoring spaces, punctuation, and capitalization. If the message length is not divisible by 16, it is padded out with nulls. A four-number running total is maintained that starts out with the value (0, 0, 0, 0); this is input to a function, known as a compression function, for processing the first block. The compression function consists of two rounds. Round 1: Get the next block of text and arrange it as a row-wise 4x4 block of text and convert it to numbers (A=0, B=1), for example, for the block ABCDEFGHIJKLMNOP, we have 81 thank William K. Mason and The American Cryptogram Association for providing this example. A B C D 0 1 2 3 E F G H 4 6 7 5 8 9 10 11 I J K L…
q/Develop the 1- Shannon(binary and ternary) code. 2- Shannon-Fano(binary and ternary) code. 3- Huffman(binary and ternary) code. For the following set of symbols (0.2 , 0.25 , 0.25 , 0.15 , 0.15)