Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.

Slides:



Advertisements
Similar presentations
DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Advertisements

Computer Science 210 Computer Organization Introduction to Logic Circuits.
Programmable Logic Controllers.
Fundamentals of Electric Circuits Chapter 19 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 4 Gates and Circuits.
ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
Combinational Digital Circuits. Measurement Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete.
2.7 NAND and NOR logic networks
Lecture 8 Topics –Switch –Transistor –CMOS transistor –Logic gates AND, OR, NOT Universal gates: NAND, NOR XOR.
3. DIGITAL ELECTRONICS..
CS231 Fundamentals1 Fundamentals What kind of data do computers work with? – Deep down inside, it’s all 1s and 0s What can you do with 1s and 0s? – Boolean.
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.
Chapter 4 Gates and Circuits.
Digital Systems Presented by Prof Tim Johnson
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Sahar Mosleh PageCalifornia State University San Marcos 1 Multiplexer, Decoder and Circuit Designing.
CSCI-235 Micro-Computers in Science Hardware Design Part I.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
Introduction Each logical element or condition must always have a logic value of either "0" or "1", we also need to have ways to combine different logical.
LOGIC GATES A logic gate is an elementary building block of a digital circuit.digital circuit Most logic gates have two inputs and one output terminals.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
Chapter 1: Digital Computers and Information Illustration at beginning of each Chapter Base 10 Binary Base 2 Octal Base 8 Hex bas
Overview Part 1 – Gate Circuits and Boolean Equations
4. Electrons and electronics 4.5 Digital electronics.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Introduction to Chapter 3  Now that we understand the concept of binary numbers, we will study ways of describing how systems using binary logic levels.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
CSCI-100 Introduction to Computing Hardware Design Part I.
June 10, 2002© Howard Huang1 Number systems To get started, we’ll discuss one of the fundamental concepts underlying digital computer design:
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
CS151 Introduction to Digital Design Chapter 2: Combinational Logic Circuits Lecture 5: Binary Logic and Gates.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Karnaugh Map and Circuit Design.
Sahar Mosleh PageCalifornia State University San Marcos 1 More on Flip Flop State Table and State Diagram.
Logic Design EE-2121 Manesh T. Digital Systems  Introduction  Binary Quantities and Variables  Logic Gates  Boolean Algebra  Combinational Logic.
Primitive Logic Functions Kuliah Sistem Digital, Teknik Elektro UMY (Rahmat Adiprasetya)
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean Logic.
 A transistor is the basic building block of electronic components.  The average computer may have millions of them within its circuits.  Essentially,
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic Gates Unit 16.
Logic gates.
Boolean Algebra & Logic Gates
Basics of Logic gates - Part 1
Digital Logic.
Logic Gates.
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Digital Signals Digital Signals have two basic states:
Fundamentals & Ethics of Information Systems IS 201
CS140 Lecture 02a: The Machinery of Computation: Circuits and Gates
How Boolean logic is implemented
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Agenda – 2/12/18 Questions? Readings: CSI 4, P
JC Technology Logic Gates.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Binary Logic.
Section 3.7 Switching Circuits
Introductory Concepts
Copyright © Cengage Learning. All rights reserved.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Presentation transcript:

Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and devices, that are building block of digital circuits. Generally, there are two class of signals which we can apply to a circuit: analogue or digital. An analogue signal is the one where the quantities that we are passing to circuit are continuous range of values, for example sending sound signal to amplifier circuit. An digital signal is the one where the quantities that we are passing to circuit are Discrete values, for example Switch in a electrical circuit can pass discrete signal (on, off) to circuit.

Sahar Mosleh PageCalifornia State University San Marcos 2 Introduction to Logic Circuits Based on the information (digital signal) that pass to a circuit, we can design systems which can use binary logic In binary logic quantities are described by 0 or 1, YES or NO, TRUE or FALSE, etc. Logic circuits are the basis of digital computers. In this course, we deal with binary logic circuits, which have a dominant role in digital technology. The goal is to introduce and provide an understanding of how these circuits work, how they are represented in mathematical notation, and how they are designed using modern automated design technique

Sahar Mosleh PageCalifornia State University San Marcos 3 Variables and Functions In binary circuits, signals can have only one of two possible values. The simplest binary element is a switch that has two states. The switch can be used in a simple application where it turns a small light bulb on or off. The state of the switch determines whether or not current will flow. When the switch is open (state 0) no current can flow, when it is closed (state 1) current can flow. State 0 (x =0)State 1 (x =1)

Sahar Mosleh PageCalifornia State University San Marcos 4 The input to this circuit which causes the change in the behavior, is the switch, that is represented as ‘x’. The output of the circuit is the state of the light “L”. If the light is on, we will say that L=1. If the light is off, we will say that L=0. We can describe the state of the light L as a function of the input variable x. L = f(x) = x This simple logic expression describes the output as a function of the input. We say that f(x) = x is a logic function with the variable x as the input variable. x = 0 x = 1

Sahar Mosleh PageCalifornia State University San Marcos 5 Now consider using two switches to control the state of the light. The switches can be connected either in series or in parallel. Using a series connection, the light will be turned on only if both switches are closed. If either switch is open, the light will be off. (state of light)L = f ( x 1, x 2 ) = x 1. x 2 where L = 1 if x1 = 1, and x2 = 1 otherwise L = 0 The. symbol is called the AND operator, and the above circuit is said to implement a logical AND function. x1 x2

Sahar Mosleh PageCalifornia State University San Marcos 6 If the switches are connected in parallel, the light will be on if one, or both, of the switches are closed. The light will be off only if both switches are open. L = f ( x 1, x 2 ) = x 1 + x 2 If either x1 = 1 or x2 = 1 then L = 1 (light is on ) If both x1 = x2 = 1 then L = 1 (light is on ) If both x1 = x2 = 0 then L = 0 (light is off ) The “+ “symbol is called the OR operator, and the above circuit is said to implement a logical OR function. x1 x2

Sahar Mosleh PageCalifornia State University San Marcos 7 Finally, consider a circuit which will generate an output when a switch is opened. In this case, the light will be turned on when the switch opens. Conversely, when the switch is closed, it will short- circuit the light and prevent any current from flowing through it. L = f ( x ) = x where L = 1 if x = 0; L = 0 if x = 1 We say that L is the inverse or complement of x. Another frequently used term is the NOT operation. There are several commonly used notations for indicating the complement: x = x’ = ! x = NOT x x= 0

Sahar Mosleh PageCalifornia State University San Marcos 8 The AND, OR, and NOT functions are the three most important logic functions we will use. They can be used as building blocks for the implementation of all logic circuits. The AND and OR functions can be extended to n variables. An AND function of variables x1, x2, …., xn has the value of 1 only if all n variables are equal to 1. An OR function of variables x1, x2, …., xn has the value of 1 if one, or more of the variables are equal to 1.

Sahar Mosleh PageCalifornia State University San Marcos 9 Truth Tables The operations of a logic circuit can be defined in a tabular form, called a truth table. A truth table lists all the possible combinations of the input variables and shows the relationship between the input variables and the resulting output. Truth tables grow exponentially in size with the number of variables. A truth table with three input variables has eight rows,2 3 since there are eight possible valuations of these variables. For four- input variables the truth table has 16 rows, 2 4,and so on. x1x2x1 x2x1+x

Sahar Mosleh PageCalifornia State University San Marcos 10 Logic Gates Each logic operation can be implemented by electronic device called transistor (you will learn about the physical property of transistors and how they work on Physics301 or CS232 ). Each of these transistor which in this course we call them logic gates, are element and building block of digital circuits. A logic gate has one or more inputs and one output AND Gate OR Gate NOT Gate A larger circuit is implemented by a network of gates. The complexity of a given network has a direct impact on its cost. The more gate we use on the circuit, the more costly is the circuit. Thus it is important to simplify circuit as much as possible x1 x2 x1+x2 x1. x2 x1 x2 x’ x

Sahar Mosleh PageCalifornia State University San Marcos 11 Tasks on logical circuits and logical functions Analysis is the task of determining the logical function that a logic network represent. Synthesis is the reverse task. It means having logical function find out what logical circuit network is. In general, any logic function can be implemented with a variety of different networks, and each likely having a different cost. So how does one find the best implementation for a given function? In order to find the best implementation (less costly circuit), we need to simplify the logic function and then design the circuit based on simplified function.

Sahar Mosleh PageCalifornia State University San Marcos 12 Example1: Determine the following circuit's functional behavior. Consider what happens if we apply all possible input signals to it. x2 x1 A B f(x1,x2) x1x2A=x1B=x1 x2f(x1,x2)

Sahar Mosleh PageCalifornia State University San Marcos 13 Example2: Analyze of the following network Note that in the end, g changes in exactly the same way as f in the previous example. Thus, g(x1, x2) = f(x1, x2), which indicates that two networks are functionally equivalent. Since both networks represent the same function, it makes sense to use the simpler one, which is less costly to implement. x1x2ABg(x1,x2) x2 x1 g(x1,x2) A B