# Lab3 - Lab 3 Part 1 Error Detection/Correction Circuit...

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

Lab 3 Part 1: Error Detection/Correction Circuit Implement an error detection/correction circuit by modifying the Booth’s multiplier circuit you have designed in Lab2 Part 2: Excess-3 Adder Implementation Design a circuit that will automatically add/subtract 3 to/ from the binary addition result of two excess-3 codes

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

View Full Document
Error Detection/Correction Circuit 0 0 0 1 1 1 0 1 1 0 0 10 1 0 0 1 0 1 1 0 1 0 1 0 0 1 1 1 1 0 0 1 0 11 1 0 0 1 1 0 0 1 1 0 2 0 1 0 1 0 1 1 1 0 0 12 1 0 0 1 1 0 1 0 0 1 3 0 1 0 1 1 0 1 0 1 0 13 1 0 1 0 0 1 0 1 1 0 4 0 1 0 1 1 1 0 0 0 1 14 1 0 1 0 0 1 1 0 0 1 5 0 1 1 0 0 1 1 0 1 0 15 1 0 1 0 1 0 0 1 0 1 6 0 1 1 0 1 0 0 1 1 0 16 1 0 1 1 0 0 0 0 1 1 7 0 1 1 0 1 0 1 0 0 1 17 1 1 0 0 0 0 1 1 1 0 8 0 1 1 1 0 0 0 1 0 1 18 1 1 0 0 0 1 0 1 0 1 9 1 0 0 0 1 1 1 1 0 0 19 1 1 0 0 1 0 0 0 1 1 The Code
Invariants of The Code Total number of 1’s: each code-word consists of exactly five 0’s and five 1’s. Capability of detecting any odd number of errors Sum of indices: If we assign an index of 1 to 10 to each bit, add the indices where a 1 appears and subtract the indices where a 0 appears, we will get a total of 1. Examples: Indices: A 9 8 7 6 5 4 3 2 1 Codeword 0: 0 0 1 1 1 0 1 1 0 0 Indices for 1s: 3+4+6+7+8 =28 (Sum1) Indices for 0s: 1+2+5+9+A=27 (Sum2) Sum1-Sum2 = 1

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/09/2008 for the course CSE 140L taught by Professor Orailoglu during the Spring '08 term at UCSD.

### Page1 / 10

Lab3 - Lab 3 Part 1 Error Detection/Correction Circuit...

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

View Full Document
Ask a homework question - tutors are online