Using building blocks to make bigger circuits

Slides:



Advertisements
Similar presentations
Part 4: combinational devices
Advertisements

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
LOGIC GATES ADDERS FLIP-FLOPS REGISTERS Digital Electronics Mark Neil - Microprocessor Course 1.
2-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL Fundamentals of Digital.
1 Chapter 4 Combinational and Sequential Circuit.
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Sequential Logic Flip Flops Registers Memory Timing State Machines.
Fall 2007 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.
Overview Recall Combinational Logic Sequential Logic Storage Devices
11/16/2004EE 42 fall 2004 lecture 331 Lecture #33: Some example circuits Last lecture: –Edge triggers –Registers This lecture: –Example circuits –shift.
1 Introduction Chapters 2 & 3: Introduced increasingly complex digital building blocks –Gates, multiplexors, decoders, basic registers, and controllers.
ENGIN112 L26: Shift Registers November 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 26 Shift Registers.
16/07/2015CSE1303 Part B lecture notes 1 Hardware Implementation Lecture B17 Lecture notes section B17.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Logic Gates Combinational Circuits
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
CS 105 Digital Logic Design
Chapter 3: Boolean Algebra
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
XOR, XNOR, and Binary Adders
Binary Addition CSC 103 September 17, 2007.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Rabie A. Ramadan Lecture 3
Digital Components and Combinational Circuits Sachin Kharady.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
P. 4.1 Digital Technology and Computer Fundamentals Chapter 4 Digital Components.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
HCL and ALU תרגול 10. Overview of Logic Design Fundamental Hardware Requirements – Communication: How to get values from one place to another – Computation.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
REGISTER A register is a group of flip-flops. Each flip- flop is capable of storing one bit of informa­ tion. An n-bit register consists of a group of.
מבנה מחשב תרגול 2. 2 Boolean AND Operation Truth Table Equivalent Gate Different notations:
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.
Abdullah Said Alkalbani University of Buraimi
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.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Computer Architecture Lecture 3 Combinational Circuits Ralph Grishman September 2015 NYU.
Lecture 21: Registers and Counters (1)
CS 61C L4.1.2 State (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture State and FSMs Kurt Meinz inst.eecs.berkeley.edu/~cs61c.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Introduction to Computing Systems and Programming Digital Logic Structures.
Chapter 3 Digital Logic Structures
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
Counters and registers Eng.Maha Alqubali. Registers Registers are groups of flip-flops, where each flip- flop is capable of storing one bit of information.
Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.
Topic: N-Bit parallel and Serial adder
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)
1 The ALU l ALU includes combinational logic. –Combinational logic  a change in inputs directly causes a change in output, after a characteristic delay.
Explain Half Adder and Full Adder with Truth Table.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Combinational Circuits
Basics of digital systems
Latches, Flip-Flops and Registers
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.
Combinational Logic.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN
Digital Logic.
FIGURE 10.1 Rectangular‐shape graphic symbols for gates
Number Systems and Circuits for Addition
COMS 361 Computer Organization
Combinational Circuits
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits and Logic
Presentation transcript:

Using building blocks to make bigger circuits So far we have defined basic building blocks as Inverter, AND, and OR gates storage elements (D-Flip-flop) These building blocks can be used to bigger circuits We may give them additional functionality We can either add more inputs or wider inputs, and outputs Or we may perform a more complex operation Or both, like multiplexers, decoders, …. Examples: 3, 4, 5 …. n bit input gates Or you may have multiple bit data inputs AND, OR, XOR, STORE, READ n-bit data

Making a register C D Q P D0 D1 D2 D3 Clock Q0 Q1 Q2 Q3 Flip-flops can be connected to act as a register All clock signals are connected together to one clock All flip-flops get different input, each storing one-bit information A 4-bit register is shown -- It uses 4 D-FFs Has a 4 bit inputs and 1 clock and produces 4 bit output C D Q P D0 D1 D2 D3 Clock Q0 Q1 Q2 Q3

Making a shift-register Flip-flops can also be connected to act as a shift register All clock signals are connected together to one clock First flip flop gets a new input Others get input from previous flip-flop A 4-bit shift register is shown It has one bit and one clock input and produces 1 bit output D0 C D Q P Clock Q0 Q1 Q2 Q3

Using 1-bit building blocks to make n-bit circuit Design a 1 bit circuit with proper “glue logic” to use it for n-bits It is called a bit slice The basic idea of bit slice is to design a 1-bit circuit and then piece together n of these to get an n-bit component Previous two examples showed how to use 1-bit components However, there was no other glue signal or logic Next, we consider other kind of examples A half-adder adds two 1-bit inputs Two half adders can be used to add 3 bits A 3-bit adder is a full adder B C S A

Full adder and multi-bit adder Two half adders can be used to add 3 bits n-bit adder can use full adders n can be arbitrary large Cout0 Sum0 A0 B0 Ci Full Adder Cout1 Sum1 A1 B1 C1 Cout2 Sum2 A2 B2 C2 Cout3 Sum3 A3 B3 C3 B C S A B C S A Cout Sum Cout Sum A B C Full Adder

Glue Logic Normally the glue logic is part of 1-bit adder A basic building block has Primary inputs Primary outputs Cascading inputs Cascading outputs The cascading signals interact directly with the glue logic Carry in 1-bit adder is a primary as well as a cascading output A and B are primary inputs C is a cascading input Cout is cascading output S is primary output