Lab2 - Lab 2 Part 1: 2's complement Booth's Multiplication...

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

View Full Document Right Arrow Icon
Lab 2 Part 1: 2’s complement Booth’s Multiplication Build a 11-bit two's complement multiplier using Booth’s algorithm. Part 2: Equivalence Checking Decide whether the function pairs are equivalent or not by implementing these functions and applying inputs to show the (in)equality. Perform Boolean function transformation and verify your transformation result in LogicWorks.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Basic Idea Accumulate a partial sum in multiple steps. The rightmost bit of the multiplier and the value of the flip-flop are checked on every step to determine the operation. Shift the partial sum and the multiplier one bit to the right on every step. Make the partial sum line up with the multiplicand; Always check the rightmost bit of multiplier, no need to check higher bits; Lower bits of the partial sum shifted into the multiplier register for storage. M
Background image of page 2
Image of page 3
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 / 7

Lab2 - Lab 2 Part 1: 2's complement Booth's Multiplication...

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

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