Suppose we want an error-correcting code that will allow all single-bit errors to be corrected formemory words of length 10.a. How many parity bits are necessary?b. Assuming we are using the Hamming algorithm presented in this chapter to design ourerror-correcting code and an odd parity , find the code word to present the 10-bitinformation word:1 00 1 1 00 1 1 1We now receive the following code word:C.10 10 1 1 0 0 0 0 10 1 1Is this a legal code word, assuming an odd parity? If not, what is the corrected codeword? (Which bit is the error bit?)

Answered: Image /qna-images/answer/95107b7a-4499-4571-b3fd-2ad08b0df392.jpg

Answered: Suppose we want an error-correcting…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 31VE

See similar textbooks

Similar questions

Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? PLEASE SHOW ALL WORKING UNDERSTANDABLE THANK YOU
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
Consider a SEC code that protects 8-bit words with 4 parity bits. If we read the value0xABC, is there an error? If so, correct the error.Note: 0xABC = 1010 1011 1100Hint: Decode the 12-bit encoded data and find if there is an error.
Assume that D has the value 1010101010 and that the 5-bit generator G=10011 is used. What does R stand for? B. C. Does corruption exist? Publish your work. Repetition of parts a and b with the addition of the following: the numbers 1001010101, 0101101010, and 1010100000
You are given sixty-four bit integer and a list of bit position p[1] p[2], p[k] for k < 65 generate new sixty-four bit integer that lowest bits are the extracted bits from integer X at input bit positions p. Explain your steps clearly
Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. 1. a) How many parity bits are necessary? 2. b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 12-bit information word: 1 0 0 1 0 0 0 1 1 0 1 0.
a) Determine the 32-bit binary representation for floating point numbers in the form± I.F x be where I is the interger part,F is the fraction,b is the base, ande is the exponent.Using this format, represent the number -1.00011011101 x 225 as a 32 bit floating point number. b) During the process of digital sampling, data can be lost due to aliasing. Analyse this problem and provide at least two possible solutions. Also, determine the rate at which a signal should be sampled, if the highest frequency is 60MHz. c) In your own words, discuss the relationship between the hexadicimal number system and the binary number system. Use this relationship to convert the following hexadecimal values to binary.i) 5BC916 ii) 6EF816 iii) 8A4D16 iv) 9ED516
You are given two bit locations, i and j, together with the 32-bit values N and M. To insert M into N, provide a procedure that starts M at bit j and finishes it at bit i. It is safe to presume that all of M can fit in the bits j through i. In other words, you may infer that there are at least 5 bits between j and i if M = 10011. M could not completely fit between bit 3 and bit 2, thus you would not, for instance, have j = 3 and i = 2.
A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Drive a mathematical expression of n and k for the total number of different cases where these 4 error bits will be undetected. Show each important step of your derivation. (Hint: the error bits will be undetected if all the parity bits computed from the block remain unchanged.)
We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100 , evaluate the eight-bit result after the following logical operations: OR
You are provided the 32-bit values N and M together with the two bit positions i and j. Provide a technique that begins M at bit j and ends it at bit i in order to insert M into N. It is fair to assume that bits j through i can accommodate all of M. In other words, if M = 10011, you may assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2 since M could not totally fit between bit 3 and bit 2.
For the decimal numbers A = -17 and B = 21, calculate A-B using only 6 bits in 2’s complement by following the steps below. Clearly indicate your 6-bit result and analyze whether or not it is correct by inspecting overflow. (a) Find 2’s complement representations of A and (-B) using 6 bits (b) Do 2’s complement addition A + (-B), where both numbers are represented with 6 bits 2’s complements (c) After handling with carryout, check possible overflow to decide if 6 bits is enough.

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a. How many parity bits are necessary?