Download presentation

Presentation is loading. Please wait.

Published byPiper Hext Modified over 4 years ago

1
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang canseco@mail.dyu.edu.tw Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh University

2
22004/03/04Fundamentals of Logic Design Contents 7.1 Multi-Level Gate Circuits 7.2NAND and NOR Gates 7.3Design of Two-Level Circuits Using NAND and NOR Gates 7.4Design of Multi-Level NAND and NOR Gate Circuits 7.5Circuit Conversion Using Alternative Gate Symbols 7.6Design of Two-Level, Multiple-Output Circuits 7.7Multiple-Output NAND and NOR Circuits

3
32004/03/04Fundamentals of Logic Design 7.4 Design of Multi-Level NAND- and NOR-Gates Circuits Multi-Level NAND-gate circuits Simplify the switching function to be realized. Simplify the switching function to be realized. Design a multi-level circuit of AND and OR gates. The output gate must be OR. AND-gate outputs cannot be used as AND-gate inputs; OR-gate outputs cannot be used as OR-gate inputs. Design a multi-level circuit of AND and OR gates. The output gate must be OR. AND-gate outputs cannot be used as AND-gate inputs; OR-gate outputs cannot be used as OR-gate inputs. Number the levels starting with the output gate as level 1. Replace all gates with NAND gates, leaving all interconnections between unchanged. Leave the inputs to levels 2, 4, 6, …unchanged. Invert any literals which appear as inputs to levels 1, 3, 5,… Number the levels starting with the output gate as level 1. Replace all gates with NAND gates, leaving all interconnections between unchanged. Leave the inputs to levels 2, 4, 6, …unchanged. Invert any literals which appear as inputs to levels 1, 3, 5,…

4
42004/03/04Fundamentals of Logic Design Multi-Level NAND-gate circuits

5
52004/03/04Fundamentals of Logic Design Contents 7.1 Multi-Level Gate Circuits 7.2NAND and NOR Gates 7.3Design of Two-Level Circuits Using NAND and NOR Gates 7.4Design of Multi-Level NAND and NOR Gate Circuits 7.5Circuit Conversion Using Alternative Gate Symbols 7.6Design of Two-Level, Multiple-Output Circuits 7.7Multiple-Output NAND and NOR Circuits

6
62004/03/04Fundamentals of Logic Design 7.5Circuit Conversion Using Alternative Gate Symbols An inverter can be represented by Inversion bubble Inversion bubble At the input At the output

7
72004/03/04Fundamentals of Logic Design Alternative Gate Symbols AND, OR, NAND, and NOR gates Based on DeMorgans law Based on DeMorgans law

8
82004/03/04Fundamentals of Logic Design Alternative Gate Symbols Why alternative symbols? Facilitate the analysis and design of NAND and NOR gate circuits Facilitate the analysis and design of NAND and NOR gate circuits

9
92004/03/04Fundamentals of Logic Design NAND Gate Circuit Conversion

10
102004/03/04Fundamentals of Logic Design Conversion to NOR Gates

11
112004/03/04Fundamentals of Logic Design Conversion of AND-OR Circuit to NAND Gates Convert all AND gates to NAND gates Adding an inversion bubble at the output Adding an inversion bubble at the output Convert all OR gates to NAND gates Adding inversion bubbles at the inputs Adding inversion bubbles at the inputs An inverted output drives an inverted input No further action No further action

12
122004/03/04Fundamentals of Logic Design Conversion of AND-OR Circuit to NAND Gates A non-inverted gate output drives an inverted gate input or vice versa Insert an inverter Insert an inverter A variable drives an inverted input Complement the variable Complement the variable

13
132004/03/04Fundamentals of Logic Design Conversion of AND-OR Circuit to NAND Gates

14
142004/03/04Fundamentals of Logic Design Contents 7.1 Multi-Level Gate Circuits 7.2NAND and NOR Gates 7.3Design of Two-Level Circuits Using NAND and NOR Gates 7.4Design of Multi-Level NAND and NOR Gate Circuits 7.5Circuit Conversion Using Alternative Gate Symbols 7.6Design of Two-Level, Multiple-Output Circuits 7.7Multiple-Output NAND and NOR Circuits

15
152004/03/04Fundamentals of Logic Design 7.6 Design of Two-Level, Multiple-Output Circuits The realization of several functions of the same variables A more economical realization A more economical realization

16
162004/03/04Fundamentals of Logic Design Multi-Output Function Given Functions F 1 (A, B, C, D) = m(11, 12, 13, 14, 15) F 1 (A, B, C, D) = m(11, 12, 13, 14, 15) F 2 (A, B, C, D) = m(3, 7, 11, 12, 13, 15) F 2 (A, B, C, D) = m(3, 7, 11, 12, 13, 15) F 3 (A, B, C, D) = m(3, 7, 12, 13, 14, 15) F 3 (A, B, C, D) = m(3, 7, 12, 13, 14, 15)

17
172004/03/04Fundamentals of Logic Design Separate Realizations

18
182004/03/04Fundamentals of Logic Design Multiple-Output Simplification F 1 = AB + ACD F 2 = ABC + CD F 3 = ACD + AB F 3 = ACD + AB AB: F 1 and F 3 CD (F 2 ) can be replaced by ACD + ACD F 2 = ABC + ACD + ACD F 2 = ABC + ACD + ACD

19
192004/03/04Fundamentals of Logic Design Multiple-Output Realization

20
202004/03/04Fundamentals of Logic Design Comparison Gates Gate Inputs Level Separate Realization 9212 Multiple-OutputRealization7182

21
212004/03/04Fundamentals of Logic Design Multiple-Output Simplification If several solutions are available Try to minimize the total number of gates required Try to minimize the total number of gates required Choose the one with minimum gates inputs Choose the one with minimum gates inputs

22
222004/03/04Fundamentals of Logic Design Contents 7.1 Multi-Level Gate Circuits 7.2NAND and NOR Gates 7.3Design of Two-Level Circuits Using NAND and NOR Gates 7.4Design of Multi-Level NAND and NOR Gate Circuits 7.5Circuit Conversion Using Alternative Gate Symbols 7.6Design of Two-Level, Multiple-Output Circuits 7.7Multiple-Output NAND and NOR Circuits

23
232004/03/04Fundamentals of Logic Design 7.7Multiple-Output NAND and NOR Circuits

24
242004/03/04Fundamentals of Logic Design Homework #1 1.7.1 2.7.3 3.7.4 4.7.8 5.7.10 6.7.17 7.7.19 8.7.20 9.7.25 10.7.26 Paper Submission, due on March 22, 2004. Late submission will not be accepted.

Similar presentations

OK

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google

Ppt on landing gear system diagram Ppt on personality test Ppt on culture of india Ppt on aerobics music Ppt on first conditional sentence Ppt on tata trucks specifications Ppt on 5 star chocolate cake Ppt on nuclear power plant in india Ppt on observation method of data collection File type ppt on cybercrime training