SOLIDS AND SEMICONDUCTOR DEVICES - IV

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Digital logic gates.
CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Programmable Logic Controllers.
UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Introduction to Digital Systems By Dr. John Abraham UT-Panam.
Chapter 4 Gates and Circuits.
Number Systems & Logic Gates Day 2. Octal Number System Base (Radix)8 Digits0, 1, 2, 3, 4, 5, 6, 7 e.g = =648 1 =88 0 =1 The digit.
Logic Circuits In today’s lesson we will look at: the symbols for NOT, AND, OR and EOR using truth tables to represent logic circuits two new operators.
Logic Gate A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. The output signal appears only.
UNIT-8 LOGIC GATES.
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.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
by Prof. Dr. Ali S. Hennache
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Chapter 2: Fundamentals of Digital Electronics Dr Mohamed Menacer Taibah University
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
4. Electrons and electronics 4.5 Digital electronics.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.
Transistors, Logic Gates and Karnaugh Maps References: Lecture 4 from last.
Electronic. Analog Vs. Digital Analog –Continuous –Can take on any values in a given range –Very susceptible to noise Digital –Discrete –Can only take.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
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.
Logic Gates and Boolean Algebra Introduction to Logic II.
 A transistor is the basic building block of electronic components.  The average computer may have millions of them within its circuits.  Essentially,
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.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Logic Gates Unit 16.
Logic gates.
Introduction to Digital Electronics
Boolean Algebra & Logic Gates
Basics of Logic gates - Part 1
Draw input and output characteristic of a transistor in CB mode
Logic Gates.
Circuits Logic in Hardware.
HASMUKH GOSWAMI COLLAGE OF
Logic Gates.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Fundamentals & Ethics of Information Systems IS 201
CHAPTER 2 Boolean Algebra
Practice #Digital Logic Mr. Burleson
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Digital Electronics Lab 2 Instructor:
JC Technology Logic Gates.
Logic Gates.
KS4 Electricity – Electronic systems
Chapter 3 – Transistor Amplifiers – Part 2
CS Chapter 3 (3A and ) – Part 2 of 5
GCSE Computer Science – Logic Gates & Boolean Expressions
ELECTRONIC SYSTEMS Note: There is no compulsory question set on Section 25 of the syllabus. Questions set on topics within Section 25 are always set as.
Some basic electronics and truth tables
Truth tables Mrs. Palmer.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
What are Logic Gates?.
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
CHAPTER 59 TRANSISTOR EQUIVALENT CIRCUITS AND MODELS
Presentation transcript:

SOLIDS AND SEMICONDUCTOR DEVICES - IV Analog and Digital Signal Binary Number System Binary Equivalence of Decimal Numbers Boolean Algebra Logic Operations: OR, AND and NOT Electrical Circuits for OR, AND and NOT Operations Logic Gates and Truth Table Fundamental Logic Gates: OR, AND and NOT (Digital Circuits) NOR and NAND Gates NOR Gate as a Building Block NAND Gate as a Building Block XOR Gate Created by C. Mani, Principal, K V No.1, AFS, Jalahalli West, Bangalore

Analogue signal Digital Circuit: Digital signal A continuous signal value which at any instant lies within the range of a maximum and a minimum value. A discontinuous signal value which appears in steps in pre-determined levels rather than having the continuous change. V t V t V = V0 sin t (5 V) 1 0 1 0 1 0 1 0 1 (5 V) (0 V) (-5 V) Digital Circuit: An electrical or electronic circuit which operates only in two states (binary mode) namely ON and OFF is called a Digital Circuit. In digital system, high value of voltage such as +10 V or +5 V is represented by ON state or 1 (state) whereas low value of voltage such as 0 V or -5V or -10 V is represented by OFF state or 0 (state).

Binary Equivalence of Decimal Numbers: Binary Number System: A number system which has only two digits i.e. 0 and 1 is known as binary number system or binary system. The states ON and OFF are represented by the digits 1 and 0 respectively in the binary number system. Binary Equivalence of Decimal Numbers: Decimal number system has base (or radix) 10 because of 10 digits viz. 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 used in the system. Binary number system has base (or radix) 2 because of 2 digits viz. 0 and 2 used in the system. D 1 2 3 4 5 6 7 8 9 B 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 D 10 11 12 13 14 15 B 1010 1011 1100 1101 1110 1111

Boolean Algebra: OR Operation: George Boole developed an algebra called Boolean Algebra to solve logical problems. In this, 3 logical operations viz. OR, AND and NOT are performed on the variables. The two values or states represent either ‘TRUE’ or ‘FALSE’; ‘ON’ or ‘OFF’; ‘HIGH’ or ‘LOW’; ‘CLOSED’ or ‘OPEN’; 1 or 0 respectively. OR Operation: OR operation is represented by ‘+’. Its boolean expression is Y = A + B It is read as “Y equals A OR B”. It means that “if A is true OR B is true, then Y will be true”. A Truth Table E ● Switch A Switch B Bulb Y OFF ON Y B

AND Operation: NOT Operation: AND operation is represented by ‘.’ Its boolean expression is Y = A . B It is read as “Y equals A AND B”. It means that “if both A and B are true, then Y will be true”. Truth Table A B Switch A Switch B Bulb Y OFF ON E ● Y NOT Operation: NOT operation is represented by ′ or ¯. Its boolean expression is Y = A′ or Ā It is read as “Y equals NOT A”. It means that “if A is true, then Y will be false”. Truth Table A E ● Switch A Bulb Y OFF ON Y

Logic Gates: Eg. for 4 input gate Truth Table: The digital circuit that can be analysed with the help of Boolean Algebra is called logic gate or logic circuit. A logic gate can have two or more inputs but only one output. There are 3 fundamental logic gates namely OR gate, AND gate and NOT gate. Truth Table: The operation of a logic gate or circuit can be represented in a table which contains all possible inputs and their corresponding outputs is called a truth table. If there are n inputs in any logic gate, then there will be n2 possible input combinations. 0 and 1 inputs are taken in the order of ascending binary numbers for easy understanding and analysis. Eg. for 4 input gate A B C D 1

Digital OR Gate: The positive voltage (+5 V) corresponds to high input i.e. 1 (state). The negative terminal of the battery is grounded and corresponds to low input i.e. 0 (state). ● 5 V + E A ● ● D1 RL ● 5 V + E B ● Y D2 Case 1: Both A and B are given 0 input and the diodes do not conduct current. Hence no output is across RL. i.e. Y = 0 ● E E Case 2: A is given 0 and B is given 1. Diode D1 does not conduct current (cut-off) but D2 conducts. Hence output (5 V) is available across RL. i.e. Y = 1 ● A B Y Truth Table Case 3: A is given 1 and B is given 0. Diode D1 conducts current but D2 does not conduct. Hence output (5 V) is available across RL. i.e. Y = 1 A B Y = A + B 1 Case 4: A and B are given 1. Both the diodes conduct current. However output (only 5 V) is available across RL. i.e. Y = 1

Digital AND Gate: 5 V + E A D1 RL 5 V + E B D2 Y E 5 V + E ● 5 V + E A Case 1: Both A and B are given 0 input and the diodes conduct current (Forward biased). Since the current is drained to the earth, hence, no output across RL. i.e. Y = 0 D1 ● ● RL ● 5 V + E B D2 ● Y Case 2: A is given 0 and B is given 1. Diode D1 being forward biased conducts current but D2 does not conduct. However, the current from the output battery is drained through D1. So, Y = 0 ● E 5 V + E Case 3: A is given 1 and B is given 0. Diode D1 does not conduct current but D2 being forward biased conducts . However, the current from the output battery is drained through D2. Hence, no output is available across RL. i.e. Y = 0 ● A B Y Truth Table A B Y = A . B 1 Case 4: A and B are given 1. Both the diodes do not conduct current. The current from the output battery is available across RL and output circuit. Hence, there is voltage drop (5 V) across RL. i.e. Y = 1

Digital NOT Gate: 5 V + E RL NPN transistor is connected to biasing batteries through Base resistor (Rb) and Collector resistor (RL). Emitter is directly earthed. Input is given through the base and the output is tapped across the collector. E B C ● ● Rb Case 1: A is given 0 input. In the absence of forward bias to the P-type base and N-type emitter, the transistor is in cut-off mode (does not conduct current). Hence, the current from the collector battery is available across the output unit. Therefore, voltage drop of 5 V is available across Y. i.e. Y= 1 ● ● Y E A N P ● 5 V + E ● E ● A Y Truth Table Case 2: A is given 1 input by connecting the +ve terminal of the input battery. P-type base being forward biased makes the transistor in conduction mode. The current supplied by the collector battery is drained through the transistor to the earth. Therefore, no output is available across Y. i.e. Y = 0 A Y=A′ 1

NOR Gate: Symbol: Circuit: E RL Y 5 V + B C Rb A B Y = (A + B)′ D1 RL ● E RL Y 5 V + B C N P Rb ● A B Y = (A + B)′ Symbol: Circuit: D1 RL D2 A B ● E 5 V + Truth Table A B A + B Y = (A + B)′ 1 ● A B A + B Y = (A + B)′

NAND Gate: Symbol: Circuit: A B Y = (A . B)′ E RL Y 5 V + B C Rb D1 D2 ● A B Y = (A . B)′ ● E RL Y 5 V + B C N P Rb Symbol: Circuit: D1 D2 RL A B ● 5 V + E Truth Table A B A . B Y = (A . B)′ 1 ● A B A . B Y = (A . B)′

NOR Gate as a Building Block: 1 ● A B (A + B)′ ● Y = A + B AND Gate: ● A′ A A B A′ B′ A′+B′ (A′+B′)′ 1 Y = A . B ● A′ B′ ● B′ B NOT Gate: A A′ 1 ● Y = A′ A

NAND Gate as a Building Block: OR Gate: A B A′ B′ A′.B′ (A′ . B′)′ 1 ● A A′ Y = A + B ● A′ B′ ● B B′ A B (A . B)′ A . B 1 AND Gate: ● A B ● Y = A . B (A . B)′ NOT Gate: A A′ 1 ● Y = A′ A

XOR Gate: A A′ A′B AB′ A Y = A′B + AB′ = A B B B B′ A B A′ B′ A′B AB′ ● A A′ A′B AB′ ● A ● Y = A′B + AB′ = A B B ● B ● B′ A B A′ B′ A′B AB′ Y = A′B + AB′ = A B 1 ● A B Y = A B End of S & SCD - IV