ECE 3130 – Digital Electronics and Design

Slides:



Advertisements
Similar presentations
ECE 3130 – Digital Electronics and Design
Advertisements

ADDER, HALF ADDER & FULL ADDER
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Full Adder Display. Topics A 1 bit adder with LED display Ripple Adder Signed/Unsigned Subtraction Hardware Implementation of 4-bit adder.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Section 10.3 Logic Gates.
ECE 301 – Digital Electronics
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Combinational circuits
4-bit adder, multiplexer, timing diagrams, propagation delays
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.
ECE 3130 – Digital Electronics and Design Lab 7 Binary Counter Fall 2012 Allan Guan.
Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Binary Addition CSC 103 September 17, 2007.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Binary Addition Section 4.5. Binary Addition Example.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.
Computer Organization & Programming Chapter4 Combinatorial Components.
Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Digital Electronics and Computer Interfacing
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
ECE 3130 – Digital Electronics and Design Lab 6 State Machines Fall 2012 Allan Guan.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Outline Binary Addition 2’s complement Binary Subtraction Half Adder
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
Chapter 3 Digital Logic Structures
ECE 2110: Introduction to Digital Systems Chapter 6 Review.
Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.
Multiplexer.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
Mu.com.lec 11.  Used not only to perform addition but also to perform subtraction, multiplication and division  The most basic of the adders is the.
Lecture No. 14 Combinational Functional Devices. Digital Logic &Design Dr. Waseem Ikram Lecture 14.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab2 Adders & Multiplexers.
Combinational Circuits
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Homework Reading Machine Projects Labs
Combinational Functions and Circuits
Lecture 4: Combinational Functions and Circuits
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.
Unit5 Combinational circuit and instrumentation system.
FIGURE 4.1 Block diagram of combinational circuit
HALF ADDER FULL ADDER Half Subtractor.
ECE 301 – Digital Electronics
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
CSE 140L Discussion 3 CK Cheng and Thomas Weng
Homework Reading Machine Projects Labs
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
XOR, XNOR, and Binary Adders
Combinational Circuits
Electronics for Physicists
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits.
Presentation transcript:

ECE 3130 – Digital Electronics and Design Lab 2 Adders and Multiplexers Fall 2012 Allan Guan

Objectives Learn how adders and multiplexers work Build and simulate a half and full adder Build and simulate a 2-to-1 and 4-to-1 multiplexer Allan Guan

What are adders? Digital circuits that perform addition of numbers Half adder Adds two 1-bit binary numbers Full adder Adds three 1-bit binary numbers Allan Guan

Half Adder Truth table Implementation A B Sum Carry 1 Allan Guan

Full Adder Truth table A B C Sum Carry 1 Allan Guan

Full Adder Implementation Allan Guan

Analysis In addition to the truth table, include the Boolean equation for the sum and carry of the half and full adder. Report, in tabular form, the propagation delays (tPHL, tPLH) of the sum and carry for the half adder. Which output has longer delay: sum or carry? Can you say why? Allan Guan

What is a multiplexer (MUX)? A device with multiple inputs and one output Also known as a data selector or controlled switch Allan Guan

How does it work? A MUX has n select lines, 2n inputs and 1 output The select line chooses which input to pass to the output 2-to-1 MUX Truth table S A B Z 1 Allan Guan

2:1 MUX Gate Implementation Allan Guan

4-to-1 MUX Truth table S1 S2 Output (M) A 1 B C D Allan Guan

Homework Build a 2:1 MUX and simulate it Build a 4:1 MUX from your 2:1 MUX (hint: you will need three 2:1 MUX’s) and simulate it You will be using the 4:1 MUX next lab Allan Guan