ECE 3130 Digital Electronics and Design

Slides:



Advertisements
Similar presentations
Verilog Section 3.10 Section 4.5. Keywords Keywords are predefined lowercase identifiers that define the language constructs – Key example of keywords:
Advertisements

ADDER, HALF ADDER & FULL ADDER
Addition (2). Outline Full Adder 3-Bit Adder 2’s Complement Subtraction.
Binary Addition. Binary Addition (1) Binary Addition (2)
ECE 301 – Digital Electronics
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.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
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.
ECE 3130 – Digital Electronics and Design
Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.
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.
Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND
Digital Electronics and Computer Interfacing
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Use CMOS Transistors to bit a 4-bit Adder. NAND2 symbol Schematic.
IT253: Computer Organization Lecture 7: Logic and Gates: Digital Design Tonga Institute of Higher Education.
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.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Number Systems and Circuits for Addition – Binary Adders Lecture 6 Section 1.5 Fri, Jan 26, 2007.
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
Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Multiplexer.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,
Electrical Engineering Engineering the Future Digital Circuits Fundamentals Hands-on Full-Adder Simulation (afternoon)
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Full Adders Vector Notation Multiplexers and Decoders Ellen Spertus MCS 111 September 6, 2001.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Combinational Circuits
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Homework Reading Machine Projects Labs
Combinational Circuits
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
NAND Gate Truth table To implement the design,
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.
HALF ADDER FULL ADDER Half Subtractor.
ECE 3130 – Digital Electronics and Design
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
ECE 3130 – Digital Electronics and Design
CSE 140L Discussion 3 CK Cheng and Thomas Weng
ECE 3130 – Digital Electronics and Design
KS4 Electricity – Electronic systems
13 Digital Logic Circuits.
Homework Reading Machine Projects Labs
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Chapter 10.3 and 10.4: Combinatorial Circuits
XOR, XNOR, and Binary Adders
Combinational Circuits
Electronics for Physicists
XOR Function Logic Symbol  Description  Truth Table 
ECE 3130 Digital Electronics and Design
Department of Electronics
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
Presentation transcript:

ECE 3130 Digital Electronics and Design Lab 4 Adders and 4:1 MUX Fall 2016

Objectives Build and simulate a full adder & a 4-bit adder XOR AND = NAND + Inverter OR = NOR + Inverter Build and simulate a 4-to-1 multiplexer Three 2-to-1 MUX’s

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 4-bit adder Adds two 4-bit binary numbers & one 1-bit carry in

Full Adder Truth Table Implementation A B C Sum Carry 1 1 OR Gate = NOR + Inverter

NOR Gate - schematic

NOR Gate - symbol

NOR Gate - waveforms

Full Adder - schematic

Full Adder – symbol

Full Adder – test circuit

Full Adder – waveforms

4-bit Adder

4-bit Adder - schematic

4-bit Adder - symbol

4-bit Adder – simulation Test your 4-bit adder by setting up inputs: A=1011, B=0111, Carry_in=1 Simulate it and check the results, which should be: Sum=0011, Carry_out=1 P.S. A=1011 means A0=1, A1=1, A2=0, A3=1

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

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 4-to-1 MUX has 2-bit select line and four 1-bit inputs, and one 1-bit output

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

4-to-1 MUX - schematic

4-to-1 MUX – symbol

4-to-1 MUX – test circuit Keep period of A as 400ns,B as 200 ns, C as 100 ns, D as 50 ns, S0 as 400 ns, S1 as 200 ns

4-to-1 MUX - waveforms

Assignment Build and simulate a Full Adder, a 4-bit Adder and a 4:1 MUX. Attach all screenshots into one PDF file, including schematic, symbol, test circuit schematic, waveforms.