1. A CRC code uses the following generator: G = 0x225. Codewords have 8 data bits. (a) Write the binary representation of G. (b) Write the polynomial representation of G. (c) How many CRC bits are there in a codeword? (d) Calculate the corresponding codeword for the following information bits: 0010 0011. Please provide clear explanation

1. A CRC code uses the following generator: G = 0x225. Codewords have 8 data bits. (a) Write the binary representation of G. (b) Write the polynomial representation of G. (c) How many CRC bits are there in a codeword? (d) Calculate the corresponding codeword for the following information bits: 0010 0011. Please provide clear explanation

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 3VE: A(n) __________ is an integer stored in double the normal number of bit positions.

See similar textbooks

Similar questions

A(n) __________ is an integer stored in double the normal number of bit positions.
8. Add the following two 8-bit binary numbers, producing an 8-bit result. Indicate the status of the carry and overflow bits at the end of the addition by circling the appropriate choices. The space in between is only for readability. 1111 0010 + 1101 0110 ----------- Overflow? Yes or No Carry? Yes or No
2. Convert the following binary numbers to floating point format. Assume a binary format consisting of a sign bit (negative = 1), a base 2, 8-bit, excess-128 exponent, and 23 bits of mantissa, with the implied binary point to the right of the first bit of the mantissa.a. 110110.011011b. −1.1111001c. 0.1100×236d. 0.1100×2−36
6. Convert the following numbers from unsigned binary notation to decimal notation, and from 6-bit 2's complement notation to decimal notation: i) 110011, ii) 001101, iii) 101101 7. Show how each of the following floating point values would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand fields): a. 12.5 b. −1.5 c. 0.75 d. 26.625 8. The following is a representation of a decimal floating value using IEEE-754 single precision. Find out the value in decimal. 0 10000011 10101000000...0
Examples of 8-bit binary representations of the decimal value 30 are shown below. definition a) the opposite of a term; b) Excess-M;?
Write down the bit pattern in the fraction of value1/3 assuming a floating point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?
Convert the given text below to Asynchronous Data Form. Assume each character has odd parity. There will be 1 start bit and 2 stop bits, the start bit is represented by 0 and stop bit is represented by 1. Convert this message “BSCpE” to ADF. Do not forget to write the idle in the beginning of ADF.
Write down the bit pattern in the fraction of value 1/3 assuming a floating point format that uses binary numbers in the fraction. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?
47 by -18 (integers in decimal (base 10)). Q1 : What is the remainder of the division in FP decimal representation (i.e., if rem=53 then its FP decimal representation is 53.0)? What is the resulting number if you shift it three digits to the right of the decimal point? Express your shifted result as a single precision FP number using the IEEE 754 standard for single precision. YOU MUST FIRST CONVERT THE NUMBER FROM BASE 10 to BASE 2 and then do normalization etc. Do not calculate more than the first 8 fraction bits.
Show Steps Please 20. Suppose we have just found yet another representation for floating point numbers. Using thisrepresentation, a 12-bit floating point number has 1 bit for the sign of the number, 4 bits forthe exponent and 7 bits for the mantissa, which is normalized as in the Simple Model so thatthe first digit to the right of the radix points must be a 1. Numbers in the exponent are in signed2's complement representation. No bias is used and there are no implied bits. Show therepresentation for the smallest positive number this machine can represent using the followingformat (simply fill in the squares provided). What decimal number does this equate to?
Solve all parts or i will dislike A) 1.0 x 2^127 is the largest absolute number that can be represented in the 32-bit representation (True/False) For True enter 1 For False enter 0 ? B) 1.0 x 2^200 will be considered as Infinity in the 32-point representation (True/False) ?
1.37 Because A − B = A + (−B), the subtraction of signed numbers can be accomplished by adding the complement. Subtract each of the following pairs of 5-bit binary numbers by adding the complement of the subtrahend to the minuend. Indicate when an overflow occurs. Assume that negative numbers are represented in 1's complement. (b) 11010 −11001 (c) 10110 −01101 Repeat the question using 2's complement to represent negative numbers.