ENEE 408C Lab Capstone Project: Digital System Design Spring 2006 Class Web Site:

Slides:



Advertisements
Similar presentations
Conversion and Coding (12)10.
Advertisements

ECE2030 Introduction to Computer Engineering Lecture 13: Building Blocks for Combinational Logic (4) Shifters, Multipliers Prof. Hsien-Hsin Sean Lee School.
1 EE24C Digital Electronics Project Theory: Sequential Logic (part 2)
Multiplication Schemes Continued
Forging new generations of engineers. Binary Addition & Subtraction.
ENEE 408C Lab Capstone Project: Digital System Design Spring 2006 Class Web Site:
CSE-221 Digital Logic Design (DLD)
Binary & Decimal numbers = 3* * *10 + 5*1 = 3* * * *10 0 Decimal system: Ten digits: 0,1,2,3,…,9 Example:
Building an Computer Adder. Building an Adder No matter how complex the circuit, or how complex the task being solved, at the base level, computer circuits.
VLSI Design Spring03 UCSC By Prof Scott Wakefield Final Project By Shaoming Ding Jun Hu
ENEE 408C Lab Capstone Project: Digital System Design Spring 2005 Class Web Site: e408c.
ENEE 408C Lab Capstone Project: Digital System Design Spring 2006 Class Web Site:
Combinational circuits
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
They are the same as registers since they store binary numbers. Called shifting registers since they shift (left or right) the binary number stored in.
ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.
ECE 4110– Sequential Logic Design
BINARY ARITHMETIC Binary arithmetic is essential in all digital computers and in many other types of digital systems.
ECE 3130 – Digital Electronics and Design
Spring 2002EECS150 - Lec12-cl3 Page 1 EECS150 - Digital Design Lecture 12 - Combinational Logic Circuits Part 3 March 4, 2002 John Wawrzynek.
1 Using 2-opr adder Carry-save adder Wallace Tree Dadda Tree Parallel Counters Multi-Operand Addition.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Number Systems Binary to Decimal Octal to Decimal Hexadecimal to Decimal Binary to Octal Binary to Hexadecimal Two’s Complement.
How to Multiply using Lattice. Step 1: How many boxes to you need? 23 X 5 You need 2 boxes on top and 1 on the side.
STEP 1 Multiply the digits in the ones place. Write the product in the ones place of the answer box. If the product is greater than ten, carry the number.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
Half-Adder: A combinational circuit which adds two one-bit binary numbers is called a half-adder. The sum column resembles like an output of the XOR gate.
Number Systems and Circuits for Addition Lecture 5 Section 1.5 Thu, Jan 26, 2006.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Digital Logic Design (CSNB163)
Two’s Complement. A system used to represent a negative number in binary A system used to represent a negative number in binary Positive numbers start.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 4. BCD Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
COMBINATIONAL LOGIC.
Number Systems and Circuits for Addition – Binary Adders Lecture 6 Section 1.5 Fri, Jan 26, 2007.
CompSci Today’s topics Computer Hardware Electric Circuits Designing an Adder Upcoming Computer Communications ( Great Ideas Chapter 10) Reading.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Half-Adder:  A combinational circuit which adds two one-bit binary numbers is called a half-adder. oThe sum column resembles like an output of the XOR.
WHAT IS BINARY? Binary is a number system that only uses two digits: 1 and 0. Any information that processed by a computer it is put into sequence of.
Binary & Decimal numbers
More Binary Arithmetic - Multiplication
EKT 221 : DIGITAL 2.
ECE 3130 Digital Electronics and Design
Multiplication
Binary Positional Notation
Multiplying 2 Digit Factors
EKT 221 : Digital 2 Serial Transfers & Microoperations
Multiply By Two Digits Created by M. Guy.
Knowing your math operation terms
Multiplication
2 Digit by 2 Digit Multiplication
Dept. of Electrical and Computer Eng., NCTU
How to Multiply By Two Digits
Combinational Circuits
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Digital System Design Review.
3.2 Solve Linear Systems Algebraically
1. Number Systems.
Instructor: Alexander Stoytchev
Binary Math Basic operations.
Number Systems and Circuits for Addition
Chapter 5 -Part 3.
Step 2 in behavioral modeling. Use of procedures.
Multiplying and Dividing in Scientific Notation
74LS283 4-Bit Binary Adder with Fast Carry
XOR Function Logic Symbol  Description  Truth Table 
How to Multiply using Lattice
2's Complement Arithmetic
Forward Design by state transition table, and state graph
Digital Radio SoC Lab 2004 Spring Bit Engineering Lab., SITI.
Presentation transcript:

ENEE 408C Lab Capstone Project: Digital System Design Spring 2006 Class Web Site:

TA’s Information Alessandro Geist Office Hours: TBD

Carry-Save Multiplier Example Multiply the two 4-bit binary numbers: 1110B x0101A ?

0 A A 0 0 A 0 0 A Carry Bits Sum Bits P B A Initialize Carry-Save Multiplier Choose B based on LSB of A

0 A A 0 0 A 0 0 A P B A Step 1: Combinational Addition Outcome Carry Bits Sum Bits

1 A A 0 1 A 0 0 A P B A Step 2: Sequential Shift Choose next B based on LSB of A Carry Bits Sum Bits

1 A A 0 1 A 0 0 A P B A Step 2: Combinational Addition 010 Carry Bits Sum Bits

0 A A 0 1 A 0 1 A P B A Step 3: Sequential Shift Choose next B based on LSB of A Carry Bits Sum Bits

0 A A 0 1 A 0 1 A P B A Step 3: Combinational Addition Carry Bits Sum Bits

1 A A 0 0 A 1 1 A P B A Step 4: Sequential Shift Choose next B based on LSB of A Carry Bits Sum Bits

1 A 0 1 A 0 0 A 1 1 A P B A Step 4: Combinational Addition 1100 Carry Bits Sum Bits

0 A A 0 0 A 1 0 A P B A Step 5: Sequential Shift Carry Bits Sum Bits

0 A A 0 0 A 1 0 A P B A Add these together Final Step Carry Bits Sum Bits

Final Step Add the Sum and Carry of P using a CPA- type Adder Sum: Carry: 0010 Carry: Concatenate with A Product =