Introduction This is a lesson, relevant to Circuit Designing. Here I have tried to give a simple idea on, how to design a circuit. Try to understand the.

Slides:

Advertisements

Similar presentations

Computer Science 210 Computer Organization Introduction to Logic Circuits.

Advertisements

Digital Circuits.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

1 Lecture 14: FSM and Basic CPU Design Today’s topics:  Finite state machines  Single-cycle CPU Reminder: midterm on Tue 10/24  will cover Chapters.

CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Digital Fundamentals with PLD Programming Floyd Chapter 4

FSM How Finite State Machine is used to design a circuit.

IKI a-Simplification of Boolean Functions Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture.

Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.

Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.

1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.

CS1Q Computer Systems Lecture 8

1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

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.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

Circuit Simplification Truth Table  Minimized Logic Gates.

Digital Systems: Combinational Logic Circuits Wen-Hung Liao, Ph.D.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Designing Combinational Logic Circuits

Karnaugh Maps (K-Maps)

CS1Q Computer Systems Lecture 8

Karnaugh Maps Not in textbook. Karnaugh Maps K-maps provide a simple approach to reducing Boolean expressions from a input-output table. The output from.

Traffic Light Simulation Lynn Jepsen. Introduction and Background Try and find the most efficient way to move cars through an intersection at different.

Chapter 0 – Week 2 Combinational Logic Design. What have been discussed Design hierarchy –Top – down –Bottom – up CAD HDL Logic synthesis.

S3 INNOVATION ELECTRONICS. LESSON TITLE: ELECTRONICS Learning Intention: To understand when to use different types of logic gates Activity: Building own.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

Finite State Machine. Clock Clock cycle Sequential circuit Digital logic systems can be classified as combinational or sequential. – Combinational circuits.

Binary Logic Derrington KCL CPD/SKE Binary We’ve seen how data of all different sorts and kinds can be represented as binary bits… 0s and 1s 1 is.

Logic Gates and Boolean Algebra Introduction to Logic II.

Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

©2010 Cengage Learning SLIDES FOR CHAPTER 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES Click the mouse to move to the next page. Use the ESC.

© 2016 AQA. Created by Teachit for AQA Boolean logic Lesson 3.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Combinational Circuits Part 1

Homework Reading Machine Projects Labs

Logic Gates and Truth Tables

Computer Science 210 Computer Organization

Digital Fundamentals Floyd Chapter 5 Tenth Edition

DeMorgan’s Theorem DeMorgan’s 2nd Theorem

Logic Gates, Boolean Algebra and Karnaugh Maps

Jeremy R. Johnson Wed. Sept. 29, 1999

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Karnaugh Maps (K-Maps)

Computer Science 210 Computer Organization

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

BASIC & COMBINATIONAL LOGIC CIRCUIT

Circuits, Truth Tables & Boolean Algebra

Boolean Algebra.

AOI Logic Implementation

ECB2212-Digital Electronics K-Map

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Circuits, Truth Tables & Boolean Algebra

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Basic circuit analysis and design

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Combinational Logic Circuit

Principles & Applications

ECE 352 Digital System Fundamentals

COE 202: Digital Logic Design Sequential Circuits Part 3

Presentation transcript:

Introduction This is a lesson, relevant to Circuit Designing. Here I have tried to give a simple idea on, how to design a circuit. Try to understand the concepts. In the 1 st slide I have given steps of circuit designing. See every Slide with a good understanding of those steps. Next To explain this lesson, I have got an example of Road crossing system. This is only one side of circuit designing.

Practical Side Of Circuit Designing 1.Identify the requirements. (Think how it should happen/ work ?) 1.According to variables, prepare a truth table. 2.Write the sum of min terms. 3.Simplify it using K-Map method. 4.According to the expression draw the circuit. 5.Select the suitable IC which has necessary gates. 6.Build the circuit. PreviousNext

One usage is circuit designing for road crossing. See the Animated picture of a road crossing system and requirements. Then you will see how is the circuit designed ?. PreviousNext Practical Side Of Circuit Designing

A B C D N PreviousNext

1 Requirements Above picture shows the intersection of a main highway with a secondary access road.Vehicle detection censers are placed along lanes C & D (Main road) & lanes A & B (access road). These censor outputs are low (0) When no vehicle is present & high (1) when vehicle is present. The intersection traffic light is to be controlled according to the following logic. 1. The East-West (E-W) traffic lights will be green when ever both lanes C & D are occupied. 2. E-W lights will be green when ever either C & D is occupied but lanes A & B are not both occupied. 3. The North-South (N-S) lights will be green when ever both lanes A & B are occupied but C & D are not both occupied. 4.The N-S lights will also be green when either A or B is occupied while C & D are both vacant. 5.The E-W lights will be green when no vehicles are present. Using the censor out puts A,B,C,D as input, design a logic circuit to control traffic lights. There should be two out puts N-S & E-W, that go high when corresponding light is to be green. PreviousNext

2 Truth Table Censors Out Puts ABCDE-WN-S PreviousNext E-W Min terms N-S Min terms

Sum Of Min Terms For E-W ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD For N-S ABCD+ABCD+ABCD+ABCD+ABCD PreviousNext

Simplifying Min Terms Using K-map Here it is easy it design a circuit for N-S side. Because that min term is very simple. So it has a small circuit. Other case is, E-W = N-S Because while one side indicates red light, the other side indicates the green light. ABCD+ABCD+ABCD+ABCD+ABCD PreviousNext AB CD

Expression & Circuit For N-S F = CD (A+B) + AB (C+D) E-W out put N-S out put A B C D CENSORSCENSORS PreviousNext

Selecting The Suitable Gates The gates, that is used in circuits are in ICs. They can’t be found as separate parts. If we want to use this gates in a circuit, we have to find the correct IC that contain those particular gates. (Using an IC manual) Eg: NEC 7853C PreviousNext

Build A Circuit Using ICs Here, you can see a circuit and how to make it using an IC. Circuit A B C X ACB X PreviousNext

A B C D PreviousNext A B C D

Practical Side Of Circuit Designing NEC 8572C Designed By Sandruwan PreviousPress Esc