{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

414Lecture6solutions

# 414Lecture6solutions - • 01010101 01110000 = 11000101 •...

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

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

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

View Full Document
ECSE 414, Lecture 6 21 Solution Entry into checksum Add the three numbers using 1’s complement arithmetic (two at a time):
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 1’s 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

{[ snackBarMessage ]}

### Page1 / 2

414Lecture6solutions - • 01010101 01110000 = 11000101 •...

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

View Full Document
Ask a homework question - tutors are online