414Lecture6solutions

414Lecture6solutions - 01010101 + 01110000 = 11000101...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECSE 414, Lecture 6 20 Question Suppose we have 8-bit summands instead of 16- bit. Consider a 3-byte packet consisting of 01010101, 01110000, 01001100. What entry is inserted in the checksum? Are all 1-bit errors detected? 2-bit errors? If not, provide an example. 2010 Michael Rabbat
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ECSE 414, Lecture 6 21 Solution Entry into checksum Add the three numbers using 1’s complement arithmetic (two at a time):
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 01010101 + 01110000 = 11000101 11000101 + 01001100 = 00010010 Take the 1s complement = 11101101. Yes: Changing any single bit will automatically result in a change in the column sum. No: flip a 0 to a 1 and a 1 to a 0 in the same column. Example: Flip third bits of 2 nd and 3 rd words: 01010101 + 01110 1 00 = 11001101 11001101 + 01001 00 = 00010010. 2010 Michael Rabbat...
View Full Document

This note was uploaded on 05/09/2011 for the course ECSE 414 taught by Professor Rabbat during the Fall '10 term at McGill.

Page1 / 2

414Lecture6solutions - 01010101 + 01110000 = 11000101...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online