Dept. of Electrical and Computer Eng., NCTU

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
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.
Give qualifications of instructors: DAP
Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
Binary Addition. Binary Addition (1) Binary Addition (2)
Chapter 4 Gates and Circuits.
ECE 301 – Digital Electronics
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.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Adders and Multipliers Review. ARITHMETIC CIRCUITS Is a combinational circuit that performs arithmetic operations, e.g. –Addition –Subtraction –Multiplication.
1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya
Binary Addition CSC 103 September 17, 2007.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:江長庭、柯俊先.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
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.
Digital Electronics and Computer Interfacing
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.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Sneha.  A combinational circuit that performs the addition of two bits is called a half adder.  It has two inputs.  It has two outputs.
1 Carry Lookahead Logic Carry Generate Gi = Ai Bi must generate carry when A = B = 1 Carry Propagate Pi = Ai xor Bi carry in will equal carry out here.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 4. BCD Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU
Dept. of Electrical and Computer Eng., NCTU 1 Lab 8. D-type Flip-Flop Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU
Dept. of Electrical and Computer Eng., NCTU 1 Lab 2. NAND and XOR Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
Dept. of Electrical and Computer Eng., NCTU 1 Lab 1. Full Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 7. 8-to-1 Multiplexer Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 5. 3-to-8 Decoder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Electrical Engineering Engineering the Future Digital Circuits Fundamentals Hands-on Full-Adder Simulation (afternoon)
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
ECEN 248 Lab 3: Study and Implementation of Adders Dept. of Electrical and Computer Engineering.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 10. Up/Down Counter Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Dr.Ahmed Bayoumi Dr.Shady Elmashad
ECE 3130 Digital Electronics and Design
Dept. of Electrical and Computer Eng., NCTU
ECE 3130 Digital Electronics and Design
DIGITAL LOGIC CIRCUITS
Multiplexer.
Lab02 :Logic Gate Fundamentals:
Dept. of Electrical and Computer Eng., NCTU
Combinational Circuits
ENG6530 Reconfigurable Computing Systems
DIGITAL LOGIC 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.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
CSE Winter 2001 – Arithmetic Unit - 1
Boolean Algebra.
ECE 301 – Digital Electronics
Week 7: Gates and Circuits: PART II
Number Systems and Circuits for Addition
Logic Gates.
Hasibul Hasan Ankit Baingane Edward Hanson
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Logic Circuits I Lecture 3.
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits.
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Half & Full Subtractor Half Subtractor Full Subtractor.
Dept. of Electrical and Computer Eng., NCTU
Dept. of Electrical and Computer Eng., NCTU
Half & Full Subtractor Half Subtractor Full Subtractor.
Presentation transcript:

Dept. of Electrical and Computer Eng., NCTU Lab 5. Full Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Outlines Adder How to Design a Logic Circuit Half Adder and Full Adder DIP Switch Lab 3: 1-bit Full Adder Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Adder (Half Adder) Describing binary summation of two one-bit binary inputs Two inputs x and y Two outputs C(carry) and S(sum) Carry (C) is represented the carry out bit Sum (S) is represented the sum of x and y Black box can be represented as Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Design flow Draw truth table We have 2 inputs (x and y), so there has 4 cases List the corresponding output (C and S) Then output is sum of product S = x’y + x y’ = x  y C = x y x y C S 0 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 x y S C Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU How to cascade the half adder? Describing binary summation of three one-bit inputs Three inputs and two outputs Black box can be represented as Cin Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Design flow Draw truth table Then output is sum of product S = x y’Cn’ + x’y’Cn + x yCn + x’yCn’ = x  y  Cn Cn+1 = xy + xCn + yCn +xyCn = xy + xCn + yCn Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Using AND, OR, XOR to build a full adder 7408 (AND) 7486 (XOR) 7432 (OR) Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU DIP switch (指撥開關) Switch the High/Low voltage for Logic 1/0 Reserving the circuit of DIP switch for following experiments The inner circuit of DIP switch Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU The related circuit of DIP switch Use the 220Ω resistance (Red-Red-Brown) When the switch of pin 16 and pin 1 is connected, the logic of input is “1” When the switch of pin 16 and pin 1 is not connected, the logic of input is “0” Connect to inputs Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Resistor Network (排阻) Signal form here Dept. of Electrical and Computer Eng., NCTU

Dept. of Electrical and Computer Eng., NCTU Lab 3: 1-bit Full Adder Use DIP switch as the input signal Use LED to display the outputs (carry and sum) Question: How to extend to N-bit Adder? Dept. of Electrical and Computer Eng., NCTU