Circuit Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Computer Science 210 Computer Organization Introduction to Logic Circuits.
Instructor Dr Sameh Abdulatif
Boolean Algebra and Reduction Techniques
Combinational Logic Design An Overview © 2014 Project Lead The Way, Inc.Digital Electronics.
Troubleshooting Circuits
Chapter 3 Basic Logic Gates 1.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Chapter 5 Boolean Algebra and Reduction Techniques William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education,
Sequential Logic - An Overview
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.
Board Game Counter - Digital
XOR, XNOR, and Binary Adders
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:
DeMorgan Theorem, Computer Simulation Exercises
Digital Electronics Combinational Logic An Overview.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
Gates and Logic Dr John Cowell phones off (please)
Combinational Logic Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
Boolean Algebra and Reduction Techniques
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
Boolean and Sequential Logic Last week – Basic Gates AND OR NOT NOR XOR NAND.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.
CHAPTER 5 Combinational Logic Analysis
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
Sequential Logic An Overview
Homework Reading Machine Projects Labs
Activity 1 5 minutes Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: R A B C Q.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Homework Reading Machine Projects Labs
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Exclusive OR Gate.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Principles & Applications
Date of Birth Design Problem
Combinational Logic Design Process
Universal gates.
Circuit Design Process
JC Technology Logic Gates.
CS Chapter 3 (3A and ) Part 3 of 8
Logic Gates.
Date of Birth Design Problem
Logic Gates.
Design Example “Date of Birth Problem”
KS4 Electricity – Electronic systems
Circuit Design Process
The Map Method Truth table of fn is unique but fn can be in many different algebraic forms Simplification by using boolean algebra is often difficult because.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
Combinational Logic - An Overview
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Circuits, Truth Tables & Boolean Algebra
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Eng. Ahmed M Bader El-Din October, 2018
Combinational Logic - An Overview
Logic Gates By: Asst Lec. Besma Nazar Nadhem
What are Logic Gates?.
Presentation transcript:

Circuit Design Process © 2014 Project Lead The Way, Inc.Digital Electronics

Circuit Design Process 1.Word Problem - Identify and define the requirement specifications. What are the inputs? What are the outputs? Sometimes it is helpful to create a table that defines what is means for a specification to be “high” or “low”. 2.Identify Circuit Types Required - What ICs are required and available for the design? Will any part of the circuit require an analog design? Is there combinational logic required? Is there sequential logic required? Is a clock signal needed? Do I have the necessary Datasheets? Pin diagrams? 3.Truth Table for Combinational Logic Section 4.Hand Calculations and Sketches of Initial Circuit 5.Simulation 6.Breadboard and Test 2

Circuit Design – Best Practices Prototype and test the circuit incrementally. Don’t design and build the entire circuit only to find is does not work properly. It is easier to trouble shoot the circuit in sections rather than try and troubleshoot the complete circuit in its entirety. As you progress through this course, you will be introduced to advancements in technology and in the circuit design process itself. As you learn about these advancements you will be able to make even more choices that will help you design efficient circuits in shorter amounts of time. In this lesson we will learn about the circuit design process by exploring simple designs in combinational and sequential logic. 3

Combinational Logic Design Process Version #1 Word Problem Write Logic Expression Boolean Simplification AOI Logic Implementation AOI Logic Implementation Create Truth-Table NO Simplification NO Simplification 4

Combinational Logic Design Process Version #2 K-Mapping NOR Only Logic Implementation NOR Only Logic Implementation NAND Only Logic Implementation Word Problem Write Logic Expression Boolean Simplification AOI Logic Implementation AOI Logic Implementation Create Truth-Table NO Simplification NO Simplification 5