Chapter 3 Part 1 Combinational Logic Design
|
|
- Christal Boyd
- 5 years ago
- Views:
Transcription
1 Universit of Wisconsin - Madison EE/omp Sci 352 igital Sstems undamentals Kewal K. Saluja and Yu Hen Hu Spring 22 hapter 3 Part ombinational Logic esign Originals b: harles R. Kime and Tom Kamisnski Modified for course use b: Kewal K. Saluja and Yu Hen Hu esign Hierarch ombinatorial ircuits combinatorial logic circuit has: set of moolean inputs, set of noolean outputs, and n switching functions mapping the 2 n input combinations to a output such that the current output depends onl on the current inputs. block diagram: m oolean Inputs ombinatorial Logic ircuit n oolean Outputs hapter 3-2 Hierarchical esign The function mapping inputs to outputs ma be ver comple To control compleit, we decompose the function into smaller pieces called blocks The blocks are subdivided into finer blocks The "leaves in the hierarch are called primitive blocks Eample: 6 input parit tree Top Level: 6 inputs, one output 2nd Level: ive 4-bit parit trees in two levels 3rd Level: Three 2-bit eclusive-or functions Primitive level: our 2-input NNs The design requires = 6 two-input NN gates Reusable unctions and esign Whenever possible, we tr to decompose a comple design into common, reusable function blocks These blocks are tested and well documented omputer-aided design () tools might include them in libraries omputer-aided manufacturing (M) tools might know how to manufacture and test them Other tools: Schematic apture Logic Simulators Timing Verifiers Hardware escription Languages (HL) hapter 3-3 hapter 3-4 Top-own verses ottom-up nalsis Procedure Top-owndesign proceeds from an abstract, high level specification to a more and more detailed design b decomposition and successive refinement ottom-updesign starts with detailed primitive elements and combines them into larger and larger and more comple functions esigns usuall proceed from both directions simultaneousl Top-owndesign answers: What are we building? ottom-updesign answers: How do we build it? Top-own controls compleit while ottom-up "sweats" the details hapter 3-5 Switching unctions from Logic iagrams Given a logic diagram, the analsis process provides a set of oolean equations, a truth table, or a verbal eplanation of circuit behavior. Procedure:.etermine that the circuit is combinational (no feedback loops), then: 2.Identif and label all gate outputs that are a function of the input variables. Obtain the oolean functions for these labeled gate outputs. 3.Identif and label all gate outputs that are a function of inputs or previousl labeled gates. Obtain oolean functions for them. 4.Repeat Step 2 until all outputs are completed. 5.ack substitute until all functions are specified in terms of inputs onl. hapter 3-6
2 nalsis Eample nalsis (ontinued) Step 2: Label all outputs of gates near inputs. Write oolean equations for them: T = + T 2 = E E E T T2 T E T2 Step 3: Identif and label all gate outputs that are a function of inputs or previousl labeled gates. Obtain oolean functions for them. T3 = + T2 Step 4: Repeat Step 3 until all done T4 = T T3 = + T4 T3 T4 hapter 3-7 hapter 3-8 nalsis (ontinued) nalsis Eample: ode onverter T T2 E Step 4: ack substitute until all functions are specified in terms of inputs onl = + T4 T4 = T T 3 = + T2 T2 = E T = + Substituting: T3 = + ( E) T4 = ( + ) (+ ( E)) = + ( + ) ( + ( E)) T3 T4 hapter w Step 2: Label gates derived from inputs and develop oolean functions. Step 3: Label the net stage of gates and develop oolean functions. z hapter 3- ode onverter nalsis (ont.) The process terminates with all gate outputs defined. Proceeding with Step 4, substituting, Truth Tables from Logic iagrams. etermine the number of input variables, n. There will be 2**n input vectors from zero to (2**n) -. Enter them in the table. 2. Label the outputs of selected gates with smbols and enter a column for each one in the table. 3. Obtain the truth table for the outputs of those gates that are a function of onl input variables. 4. Proceed to fill in the outputs of all gates that are derived from inputs and previousl calculated terms. hapter 3- hapter 3-2 2
3 Truth Tables from Logic iagrams Procedure: etermine the number of input variables, n. There will be 2 n input vectors from zero to 2 n. Enter them in the table. Label the outputs of selected gates with smbols and enter a column for each one in the table. Obtain the truth table for the outputs of those gates that are a function of onl input variables. Proceed to fill in the outputs of all gates that are derived from inputs and previousl calculated terms. Eample: ind the function table for the code converter. ode onverter Truth Table our inputs give 6 input vectors. Start with, and z. 2 w z hapter 3-3 hapter 3-4 Truth Table ill-in omplete Entries Now we can calculate,, and 2. 2 w z inall we can fill in w to complete the table: 2 w z hapter 3-5 hapter 3-6 What oes the ircuit o? inal Note (and warning) inspection, the output variable vector (w,,,z) is just the input variable vector (,,,) plus three. The function(s) (,,,) = (w,,,z) are: " THREE TO THE INPUT VETOR unction has the meaning: " ONE TO THE UPPER TWO ITS Similarl, function 2 has the meaning: " ONE TO THE UPPER IT" Generall, it is not this obvious to figure out what the functions mean! hapter 3-7 The use of "on't ares" in the original specification can cloud the analsis. Note that the functions for the "w" bit differ from the implementation in E. 3-2 of the book. The book used "on't ares" to simplif the logic. The eample here did not. This can be seen w b inspecting the two K-maps for the function w: ook ig. 4-8 w Notes Eample hapter 3-8 3
4 Logic esign: unctional locks nalsis: rom a design to a specification of the behavior Logic diagram to equations Logic diagram to function table "Word description" of circuit operation esign and Snthesis: rom a specification to design implementation efine the problem Generate function table or equations Minimize the oolean function Implement the circuit hapter 3-9 ombinatorial Logic Implementation combinatorial logic circuit has: set of moolean inputs, set of n oolean outputs, and function mapping inputs to outputs. We think of the function as n separate oolean functions of m inputs Procedure: Treat each output as a separate function Minimize the equations for each function Implement each function independentl Sometimes an implementation can share product or sum logic terms to arrive at a lower literal cost solution. hapter 3-2 esign Procedure ode onverter esign Eample irst, start with the specification of the circuit to be designed. Note: this can sometimes require a lot of work to complete the specification process, especiall if it is poorl specified initiall. Second, follow these steps: We will stud the design of a code converter to see these steps. Identif the inputs and outputs erive truth table Obtain simplified oolean equations raw the logic diagram heck our work to verif correctness. hapter 3-2 code converter transforms one internal representation of data to another We will start with a table of the desired conversion and minimize the resulting multiple output oolean function Sometimes terms can be shared to minimize the implementation cost The Problem: esign a to Ecess-3 code converter Specification: code -- 4-bit patterns "" to "" for digits to 9 base Ecess-3 -- code plus binar "" for digits to 9 base hapter 3-22 Eample: to Ecess 3 Eample (ont.): to Ecess 3 unction table: Note: Input Output Ecess-3 w z Map functions and find minimum cost SOP equations for each z w ll codes greater than "9" can be assigned "on't ares" in the K-Map. Such codes are never possible. hapter 3-23 hapter
5 Eample (ont.): to Ecess 3 Net, we will manipulate the equations to epose some shared terms: n lternative: to Ecess 3 nother pproach: Ecess-3 is defined as plus 3. dding 3 to to Ecess-3: The term ( + ) can be used more than once to simplif the implementation See ig. 3- in Mano and Kime for the implementation hapter w z Here H is a Half-dder and is a ull-dder (We will discuss these later in the chapter). hapter 3-26 "" "" o i H S o H S o i S o H w z S unctional lock: ecoders 2-to-4 Line ecoder ecoder converts n binar bits to a maimum of 2n unique output lines. This device takes: n=2 input lines n m-to-n line decoder, where m < 2 n, can be used to: Generate 2 n (or fewer) minterms, and decodes minterms for: m=2 n = 4 output lines. Select one-of 2 n items ecoders are sometimes known as demultipleers when enabled with a separate data-in line. hapter 3-27 hapter to-4 Line emultipleer Eample: 7438 emultipleer This device takes: n=2 input lines and decodes minterms for: m=22 =4 output lines where each output is: Ned with an input,. If is viewed as an Enable, all outputs are for = and one output is for =. If is viewed as ata, then this data is sent to one or the outputs. Enables Inputs 7438 truth table: E E2 E3 z Outputs Note: This "Truth Table" uses the (or - )to mean "this could be either or ". Thus, it "compacts" some of 2 6 = 64 lines. hapter 3-29 hapter 3-3 5
6 Implementing Logic with ecoders Eample : (,) = m(,3) ecoders provide minterms directl. Simpl "OR" the appropriate minterm outputs to make an logic function desired. ctive low decoders behave as the first NN gate in a NN-NN, Sum of Products implementation. or this we use a 2-to-4 line decoder and sum minterms and 3 with an OR gate: m3 ctive high decoders behave as first stage N gates in a N-OR Sum of Products implementation. Two or more active high decoders driven from different bits of a binar code can be used to form minterms b "NING" their outputs. Similarl, active low decoders can be used to form minterms b "ORING" their outputs. m hapter 3-3 hapter 3-32 Eample : (,Y,Z) = m(,3,5,6) Implementing Larger Minterms Minterm m5 is formed b "NING" the 3 outputs of each decoder. Similarl m is formed b "NING" the outputs of each decoder. S S S S What minterm is formed b "NING" (upper) and 2 (lower) outputs? This works best with widel scattered, sparse minterms. m5 m?? m hapter 3-33 hapter 3-34 unctional lock: Encoders Encoder Eample Encoders perform the "inverse" operation of decoders, taking a code in one format and encoding it into another format. Man encoders consist of just OR gates. or eample an 8- to-3 binar encoder consists of three 4-input OR gates, OR2,OR and OR. Input Ii, i =,,7 is connected to an input on ORj if the binar representation of i has a in position j. priorit encoder is used to generate a code for the "most significant" bit set in a string of bits. This can be used to find the first one in a word, or to select eternal events in priorit order. n eample of a MSI priorit encoder is the 7448, 8 line to 3 line priorit encoder. It can be cascaded to encode higher numbers of bits. hapter 3-35 Encode 4 lines,, 2, 3 into the corresponding binar codes. hapter
7 Review: ecoders and Encoders Multipleers ecoder converts n binar bits to a maimum of 2 n unique output lines. ecoders are sometimes know as demultipleers when enabled with a separate data-in line. ecoders implement minterms directl. Use a decoder and an OR gate to form Sum-of- Minterms directl. Encoders perform the "inverse" operation of decoders, taking a code in one format and encoding it into another format. Multipleer (MU) is another common functional block. Multipleer uses n binar select bits to choose from a maimum of 2 n unique input lines. Like a decoder, it decodes minterms internall. Unlike a decoder, it has onl one output line. The decoded minterms are used to select data from one of up to 2 n unique data input lines. The output of the multipleer is the data input whose inde is specified b the n bit code. hapter 3-37 hapter 3-38 Eample: 4-to- multipleer Multipleer Versus ecoder The 4-to- line Multipleer uses the same minterm decoder core. It is like a demultipleer with individual data input lines (instead of just one) and an output OR gate. I3 I2 I I S S I3 I2 I I S S Note how similar the two are internall. hapter 3-39 hapter 3-4 unctions with Multipleers Eample: Gra to inar ode It is possible to implement an oolean function of n variables with a 2 n input multipleer. Simpl tie each input to the "" or "" line as desired. It is also possible to implement an n+ variable function with a 2 n multipleer. Simpl use the (n+)st variable in true or complement form depending upon what the truth table requires. oolean function of more than n variables can be partitioned into several easil implemented sub-functions defined on a subset of the variables. The multipleer will then select among these sub-functions. The Gra code has adjacent elements separated b onl one bit change. We wish to convert a 3-bit Gra code to a binar code. The function table on the right documents the required conversion. Gra inar z The Gra to inar ode onverter requires us to implement three separate, three-input oolean functions. hapter 3-4 hapter
8 Gra to inar (ontinued) Gra to inar (ontinued) irst step: Let's get the function table into a logical order b reordering the input Gra code values in binar sequence: inspection: = (,,) = m(, 3, 5, 7) = G(,,) = m(, 2, 5, 6) z = H(,,) = m(, 2, 4, 7) Gra inar z The K-Maps Z Y Note: (,,) =, is an eas function to implement. (No logic gates needed!) unction (,,) = ' + ' is a bit harder to implement. unction z(,,) looks familiar. What is it? hapter 3-43 hapter 3-44 Gra to inar (ontinued) Other MU Implementations We know that 2n to Multipleers can be used to implement arbitrar functions of n bits. We simpl connect the inputs to "" or "" 7 as needed. 7 Use two eight-input multipleers to implement functions for and z: S2 S S Out 8-to- MU In this case, the MU elements are acting like a "Read Onl Memor" (ROM). Z S2 S S Out 8-to- MU Y We can also use two 4-to- MU blocks and implement and z. Suppose we factor out and use and as the select inputs to the multipleers Y Z hapter 3-45 hapter 3-46 MU Implementations (ont.) MU: (ont.) actoring Out actoring out variable leads to the following implementation with two, 4-to- Multipleers: ' ' 3 2 S S Out 4-to- MU s before, =. Z 3 2 S S Out 4-to- MU Y We could have factored out other variables. s in the book, we will factor out and appl to the select inputs: Gra inar z = = = = = ' = ' 2 = 2 = 2 = ' 3 = 3 = ' 3 = This is slightl larger than selecting to factor out. hapter 3-47 hapter
9 MU: (ont.) actoring out MU: (ont.) actoring out Gra inar z = "" = z = = "" = ' z = ' = "" = z = ' = "" = ' z = Note: We re-arranged the table (fiing and and varing from to in each cell) to simplif this procedure. It still looks like factoring was better. Gra inar z = = = = = = ' 2 = 2 = 2 = ' 3 = 3 = 3 = Note: We re-arranged the table (fiing and and varing from to in each cell) to simplif this procedure. actoring is best! Note also that = holds. hapter 3-49 hapter 3-5 Summar nalsis orward backward trace through the circuit to obtain output equations or truth table Vice versa will also find the equations and truth table Know the functions performed b the following functional blocks: ecoders, emultipleers, Encoders, Multipleers Know how to implement oolean functions using: Multipleers ecoders hapter 3-5 9
Functional Block: Decoders
University of Wisconsin - Madison EE/omp Sci 352 Digital Systems Fundamentals harles R. Kime Section 2 Fall 2 hapter 3 ombinational Logic Design Part 2 Tom Kaminski & harles R. Kime harles Kime & Thomas
More informationChapter 2 Part 4 Combinational Logic Circuits
University of Wisconsin - Madison EE/omp Sci 352 Digital Systems undamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 hapter 2 Part 4 ombinational Logic ircuits Originals by: harles R. Kime and Tom Kamisnski
More informationChapter 2 Part 5 Combinational Logic Circuits
Universit of Wisconsin - Madison ECE/Comp Sci 352 Digital Sstems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 2 Part 5 Combinational Logic Circuits Originals b: Charles R. Kime and Tom
More informationBoolean Function Simplification
Universit of Wisconsin - Madison ECE/Comp Sci 352 Digital Sstems Fundamentals Charles R. Kime Section Fall 200 Chapter 2 Combinational Logic Circuits Part 5 Charles Kime & Thomas Kaminski Boolean Function
More informationCS Spring Combinational Examples - 1
S 5 - Spring 2 - ombinational Examples - ombinational Logic esign ase Studies General esign Procedure for ombinational Logic General design procedure Examples alendar subsstem to 7-segment displa controller
More informationECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring Logic and Computer Design Fundamentals.
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 6 Part 2 Memories & Programmable Logic Devices Originals by: Charles R.
More informationChapter 3 Part 2 Combinational Logic Design
University of Wisconsin - Madison EE/omp ci 352 Digital ystems Fundamentals Kewal K. aluja and u Hen Hu pring 2002 hapter 3 Part 2 ombinational Logic Design Originals by: harles R. Kime and Tom Kamisnski
More informationChapter 3 Part 2 Combinational Logic Design
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 3 Part 2 Combinational Logic Design Originals by: Charles R. Kime and Tom
More informationENGIN 112. Intro to Electrical and Computer Engineering
ENIN 2 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra ENIN2 L6: More Boolean Algebra September 5, 23 A B Overview Epressing Boolean functions Relationships between algebraic
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
More informationLiteral Cost F = BD + A B C + A C D F = BD + A B C + A BD + AB C F = (A + B)(A + D)(B + C + D )( B + C + D) L = 10
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is performed using a specific procedure or algorithm
More information5. Minimizing Circuits
5. MINIMIZING CIRCUITS 46 5. Minimizing Circuits 5.. Minimizing Circuits. A circuit is minimized if it is a sum-of-products that uses the least number of products of literals and each product contains
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
More informationOptional: Building a processor from scratch
Optional: Building a processor from scratch In this assignment we are going build a computer processor from the ground up, starting with transistors, and ending with a small but powerful processor. The
More informationAdministrivia. CSE 370 Spring 2006 Introduction to Digital Design Lecture 9: Multilevel Logic
SE 370 Spring 2006 Introduction to igital esign Lecture 9: Multilevel Logic Last Lecture Introduction to Verilog Today Multilevel Logic Hazards dministrivia Hand in Homework #3 Homework #3 posted this
More informationChapter 3 working with combinational logic
hapter 3 working with combinational logic ombinational Logic opyright 24, Gaetano orriello and Randy H. Katz Working with combinational logic Simplification two-level simplification exploiting don t cares
More informationStudent Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science
University of alifornia at erkeley ollege of Engineering epartment of Electrical Engineering and omputer Science EES 5 all 2 R. H. Katz IRST MITERM EXMINTION Tuesday, 3 October 2 INSTRUTIONS RE THEM NOW!
More information24 Nov Boolean Operations. Boolean Algebra. Boolean Functions and Expressions. Boolean Functions and Expressions
24 Nov 25 Boolean Algebra Boolean algebra provides the operations and the rules for working with the set {, }. These are the rules that underlie electronic circuits, and the methods we will discuss are
More informationDEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING, THE UNIVERSITY OF NEW MEXICO ECE-238L: Computer Logic Design Fall 2013.
ECE-8L: Computer Logic Design Fall Notes - Chapter BINARY NUMBER CONVERSIONS DECIMAL NUMBER SYSTEM A decimal digit can take values from to 9: Digit-b-digit representation of a positive integer number (powers
More informationSimplification of two-level combinational logic
ombinational logic optimization! lternate representations of oolean functions " cubes " karnaugh maps! Simplification " two-level simplification " exploiting don t cares " algorithm for simplification
More informationAt this point in our study of digital circuits, we have two methods for representing combinational logic: schematics and truth tables.
HPTER FIVE oolean lgebra 5.1 Need for oolean Expressions t this point in our study of digital circuits, we have two methods for representing combinational logic: schematics and truth tables. 0 0 0 1 0
More informationChapter 5 Registers & Counters
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 5 Registers & Counters Originals by: Charles R. Kime Modified for course
More information2.2 Absolute Value Functions
. Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number
More information2 Combinational Logic
2 ombinational Logic O purblind race of miserable men, How many among us at this very hour o forge a lifelong trouble for ourselves, y taking true for false, and false for true! lfred, Lord Tennyson It
More informationProgrammable Logic Devices
EG igital Logic Fundamentals /4/6 EG igital Logic Fundamentals Programmable Logic evices aback Izadi ivision of Engineering Programs bai@engr.newpaltz.edu Introduction Fuse Link E = blown fuse link E =
More informationAdvanced Digital Logic Design EECS 303
dvanced igital Logic esign S 303 http://ziyang.eecs.northwestern.edu/eecs303/ Teacher: Robert ick Office: L477 Tech mail: dickrp@northwestern.edu Phone: 847 467 2298 Today s topics inate covering Tree
More informationObjectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure
Objectives: 1. Design procedure. 2. undamental circuits. 1. Design procedure Design procedure has five steps: o Specification. o ormulation. o Optimization. o Technology mapping. o Verification. Specification:
More informationMenu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification
Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):
More informationIntroduction to Actel FPGA Architecture
Introduction to ctel FPG rchitecture pplication Note 65 This overview of the different ctel device families covers the major architectural features in sufficient detail to ensure the reader is familiar
More informationReview: Chip Design Styles
MPT-50 Introduction to omputer Design SFU, Harbour entre, Spring 007 Lecture 9: Feb. 6, 007 Programmable Logic Devices (PLDs) - Read Only Memory (ROM) - Programmable Array Logic (PAL) - Programmable Logic
More informationSection 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a
Section.: Absolute Value Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationChapter 4. Combinational Logic
Chapter 4. Combinational Logic Tong In Oh 1 4.1 Introduction Combinational logic: Logic gates Output determined from only the present combination of inputs Specified by a set of Boolean functions Sequential
More informationContents. Chapter 3 Combinational Circuits Page 1 of 34
Chapter 3 Combinational Circuits Page of 34 Contents Contents... 3 Combinational Circuits... 2 3. Analysis of Combinational Circuits... 2 3.. Using a Truth Table... 2 3..2 Using a Boolean unction... 4
More informationCMSC 425: Lecture 10 Basics of Skeletal Animation and Kinematics
: Lecture Basics of Skeletal Animation and Kinematics Reading: Chapt of Gregor, Game Engine Architecture. The material on kinematics is a simplification of similar concepts developed in the field of robotics,
More informationAlgebra I. Linear Equations. Slide 1 / 267 Slide 2 / 267. Slide 3 / 267. Slide 3 (Answer) / 267. Slide 4 / 267. Slide 5 / 267
Slide / 67 Slide / 67 lgebra I Graphing Linear Equations -- www.njctl.org Slide / 67 Table of ontents Slide () / 67 Table of ontents Linear Equations lick on the topic to go to that section Linear Equations
More informationCombinational Logic II
Combinational Logic II Ranga Rodrigo July 26, 2009 1 Binary Adder-Subtractor Digital computers perform variety of information processing tasks. Among the functions encountered are the various arithmetic
More informationLecture (05) Boolean Algebra and Logic Gates
Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either
More informationENEL Digital Circuits Midterm Examination
Name: Lecture Section: L0 N. artley :-:50 L02 S. Norman, 2:-2:50 ENEL 353 - igital ircuits Midterm Examination Wednesday, October 30, 203 Instructions: Time allowed is 90 minutes. In order to minimize
More informationThere are only 16 possible 2-input gates Let s examine all of them. Some we already know, others are just silly.
ll the Gates There are only 6 possible 2-input gates Let s examine all of them. Some we already know, others are just silly. Do we really need all of these gates? How many of these gates can be implemented
More informationGate-Level Minimization. section instructor: Ufuk Çelikcan
Gate-Level Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to
More informationENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 2 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh Maps Overview K-maps: an alternate approach to representing oolean functions K-map representation can be used to
More informationDigital Logic Design (3)
Digital Logic Design (3) ENGG1015 1 st Semester, 2010 Dr. Kenneth Wong Dr. Hayden So Department of Electrical and Electronic Engineering Last lecture ll logic functions can be represented as (1) truth
More informationDigital Logic Design. Midterm #1
The University of Toleo s7ms_il7.fm - EECS: igital Logic esign r. nthony. Johnson Stuent Name_ igital Logic esign Miterm # Problems Points. 3. 4 3. 6 4. Total 5 Was the eam fair? yes no /6/7 The University
More informationExponential and Logarithmic Functions
Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) Chapter Outline. Eponential Functions. Logarithmic Properties. Graphs of Eponential
More informationModule -7. Karnaugh Maps
1 Module -7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM)
More informationUNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.
UNCA CSCI 255 Exam 1 Spring 2017 27 February, 2017 This is a closed book and closed notes exam. It is to be turned in by 1:45 PM. Communication with anyone other than the instructor is not allowed during
More informationA graphical method of simplifying logic
4-5 Karnaugh Map Method A graphical method of simplifying logic equations or truth tables. Also called a K map. Theoretically can be used for any number of input variables, but practically limited to 5
More informationDigital Circuits ECS 371
Digital Circuits ECS 37 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 7 Office Hours: KD 36-7 Monday 9:-:3, :3-3:3 Tuesday :3-:3 Announcement HW2 posted on the course web site Chapter 4: Write down
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of
More informationLecture 12 Date:
Information Technolog Delhi Lecture 2 Date: 3.09.204 The Signal Flow Graph Information Technolog Delhi Signal Flow Graph Q: Using individual device scattering parameters to analze a comple microwave network
More informationModeling and Simulation Exam
Modeling and Simulation am Facult of Computers & Information Department: Computer Science Grade: Fourth Course code: CSC Total Mark: 75 Date: Time: hours Answer the following questions: - a Define the
More informationExponential and Logarithmic Functions
Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) CHAPTER OUTLINE. Eponential Functions. Logarithmic Properties. Graphs of Eponential
More informationPolynomial and Rational Functions
Polnomial and Rational Functions Figure -mm film, once the standard for capturing photographic images, has been made largel obsolete b digital photograph. (credit film : modification of work b Horia Varlan;
More informationy = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7)
0 Relations and Functions.7 Transformations In this section, we stud how the graphs of functions change, or transform, when certain specialized modifications are made to their formulas. The transformations
More informationChapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic
More informationSimplification of Boolean Functions
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean
More informationDigital Design. Chapter 4. Principles Of. Simplification of Boolean Functions
Principles Of Digital Design Chapter 4 Simplification of Boolean Functions Karnaugh Maps Don t Care Conditions Technology Mapping Optimization, Conversions, Decomposing, Retiming Boolean Cubes for n =,
More informationAdvanced Tree Structures
Data Structure hapter 13 dvanced Tree Structures Dr. Patrick han School of omputer Science and Engineering South hina Universit of Technolog utline VL Tree (h 13..1) Interval Heap ST Recall, inar Search
More informationCombinational Logic Circuits Part III -Theoretical Foundations
Combinational Logic Circuits Part III -Theoretical Foundations Overview Simplifying Boolean Functions Algebraic Manipulation Karnaugh Map Manipulation (simplifying functions of 2, 3, 4 variables) Systematic
More informationLecture 2 8/24/18. Computer Memory. Computer Memory. Goals for today. Computer Memory. Computer Memory. Variables Assignment Sequential Steps
Goals for toda Lecture 2 Variables Assignment Sequential Steps Sequential Steps, Variables, Assignment Computer Memor If we can t remember things, we can t actuall do ver much Computers have memor the
More informationBoolean Functions (10.1) Representing Boolean Functions (10.2) Logic Gates (10.3)
Chapter (Part ): Boolean Algebra Boolean Functions (.) Representing Boolean Functions (.2) Logic Gates (.3) It has started from the book titled The laws of thought written b George Boole in 854 Claude
More informationCS 157: Assignment 6
CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve
More information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 5 & 6 Minimization with Karnaugh Maps Karnaugh maps lternate way of representing oolean function ll rows
More informationDIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES 1 Learning Objectives 1. Explain the function of a multiplexer. Implement a multiplexer using gates. 2. Explain the
More informationWhat are the rules of elementary algebra
What are the rules of elementar algebra James Davenport & Chris Sangwin Universities of Bath & Birmingham 7 Jul 2010 Setting A relativel traditional mathematics course, at, sa first-ear undergraduate level.
More information! Replace maxterm OR gates with NOR gates! Place compensating inversion at inputs of AND gate
Two-level logic using NN gates (cont d) ELE 4 igital Electronics Week : ombinational Logic Implementation! OR gate with inverted inputs is a NN gate " de Morgan's: ' ' = ( )'! Two-level NN-NN network "
More informationHomework. Update on website issue Reading: Chapter 7 Homework: All exercises at end of Chapter 7 Due 9/26
Homework Update on website issue Reading: hapter 7 Homework: All exercises at end of hapter 7 Due 9/26 opyright c 22 28 UMaine omputer Science Department / 2 OS 4: Foundations of omputer Science Karnaugh
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Combinational Logic Martha. Kim Columbia University Spring 6 / Combinational Circuits Combinational circuits are stateless. Their output is a function only of the current
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More information2.8 Distance and Midpoint Formulas; Circles
Section.8 Distance and Midpoint Formulas; Circles 9 Eercises 89 90 are based on the following cartoon. B.C. b permission of Johnn Hart and Creators Sndicate, Inc. 89. Assuming that there is no such thing
More informationChap.3 3. Chap reduces the complexity required to represent the schematic diagram of a circuit Library
3.1 Combinational Circuits 2 Chap 3. logic circuits for digital systems: combinational vs sequential Combinational Logic Design Combinational Circuit (Chap 3) outputs are determined by the present applied
More informationSupplement to. Logic and Computer Design Fundamentals 4th Edition 1
Supplement to Logic and Computer esign Fundamentals 4th Edition MORE OPTIMIZTION Selected topics not covered in the fourth edition of Logic and Computer esign Fundamentals are provided here for optional
More informationSolutions - Homework 2 (Due date: February 5 5:30 pm) Presentation and clarity are very important! Show your procedure!
Solutions - Homework (Due date: Februar 5 th @ 5: pm) Presentation and clarit are ver important! Show our procedure! PROBLEM ( PTS) In these problems, ou MUST show our conversion procedure. a) Convert
More informationLINEAR PROGRAMMING. Straight line graphs LESSON
LINEAR PROGRAMMING Traditionall we appl our knowledge of Linear Programming to help us solve real world problems (which is referred to as modelling). Linear Programming is often linked to the field of
More informationIT 201 Digital System Design Module II Notes
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
More informationECE241 - Digital Systems. University of Toronto. Lab #2 - Fall Introduction Computer-Aided Design Software, the DE2 Board and Simple Logic
ECE24 - Digital Sstems Universit of Toronto Lab #2 - Fall 28 Introduction Computer-Aided Design Software, the DE2 Board and Simple Logic. Introduction The purpose of this eercise is to introduce ou to
More informationDigital Logic Design. Midterm #1
The University of Toleo f6ms_il7.fm - EECS: igital Logic esign r. Anthony. Johnson Stuent Name_ igital Logic esign Miterm # Problems Points. 3. 4 3. 6 4. Total 5 Was the eam fair? yes no 9/9/6 The University
More informationof integration y e.g. TTL packages: Data Book for 100 s of different parts y Map your circuit to the Data Book parts
x x x x x x volution of Implementation Technologies Gate rra Technolog (IM - s) iscrete devices: relas, transistors (s-s) trend toward iscrete logic gates (s-s) higher levels Integrated circuits (s-s)
More informationLecture Topics ECE 341. Lecture # 6. CLA Delay Calculation. CLA Fan-in Limitation
EE 34 Lecture # 6 Instructor: Zeshan hishti zeshan@pdx.edu October 5, 24 Lecture Topics Design of Fast dders arry Looakaheaddders (L) Blocked arry-lookahead dders ultiplication of Unsigned Numbers rray
More informationLecture 7 Logic Simplification
Lecture 7 Logic Simplification Simplification Using oolean lgebra simplified oolean expression uses the fewest gates possible to implement a given expression. +(+)+(+) Simplification Using oolean lgebra
More informationGate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER
Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to
More information2. BOOLEAN ALGEBRA 2.1 INTRODUCTION
2. BOOLEAN ALGEBRA 2.1 INTRODUCTION In the previous chapter, we introduced binary numbers and binary arithmetic. As you saw in binary arithmetic and in the handling of floating-point numbers, there is
More informationIntermediate Algebra. Gregg Waterman Oregon Institute of Technology
Intermediate Algebra Gregg Waterman Oregon Institute of Technolog c 2017 Gregg Waterman This work is licensed under the Creative Commons Attribution 4.0 International license. The essence of the license
More informationDefinitions. Kinematics the study of constrained motion without regard to forces that cause that motion
Notes_0_0 of efinitions Kinematics the stud of constrained motion without regard to forces that cause that motion namics the stud of how forces cause motion ausalit the relationship between cause and effect
More informationGet Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
More informationThe Graph of an Equation
60_0P0.qd //0 :6 PM Page CHAPTER P Preparation for Calculus Archive Photos Section P. RENÉ DESCARTES (96 60) Descartes made man contributions to philosoph, science, and mathematics. The idea of representing
More informationCombinational Logic Circuits
Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization
More informationLogic Design (Part 2) Combinational Logic Circuits (Chapter 3)
Digital Logic Circuits Logic Design (Part ) Combinational Logic Circuits (Chapter 3) ² We saw how we can build the simple logic gates using transistors ² Use these gates as building blocks to build more
More informationECE199JL: Introduction to Computer Engineering Fall 2012 Notes Set 2.4. Example: Bit-Sliced Comparison
c 22 Steven S. Lumetta. ll rights reserved. 2 EE99JL: Introduction to omputer Engineering Fall 22 Notes Set 2.4 Eample: it-sliced omparison This set of notes develops s for unsigned and 2 s complement
More information12.4 The Ellipse. Standard Form of an Ellipse Centered at (0, 0) (0, b) (0, -b) center
. The Ellipse The net one of our conic sections we would like to discuss is the ellipse. We will start b looking at the ellipse centered at the origin and then move it awa from the origin. Standard Form
More informationUnit 2: Function Transformation Chapter 1
Basic Transformations Reflections Inverses Unit 2: Function Transformation Chapter 1 Section 1.1: Horizontal and Vertical Transformations A of a function alters the and an combination of the of the graph.
More informationSection 4.3 Features of a Line
Section.3 Features of a Line Objectives In this section, ou will learn to: To successfull complete this section, ou need to understand: Identif the - and -intercepts of a line. Plotting points in the --plane
More informationLearning Objectives: Topic Karnaugh Maps. At the end of this topic you will be able to;
Topic.2.3 Karnaugh Maps Learning Objectives: t the end of this topic you will be able to; Draw a Karnaugh map for a logic system with up to four inputs and use it to minimise the number of gates required;
More informationOverview. Overview. Example: Full Adder Diagnosis. Example: Full Adder Diagnosis. Valued CSP. Diagnosis using Bounded Search and Symbolic Inference
Overview Diagnosis using Bounded Search and Smbolic Inference Martin Sachenbacher and Brian C. Williams MIT CSAIL Soft Constraints Framework Characteriing Structure in Soft Constraints Eploiting Structure
More informationWorking with Combinational Logic
KTZ_238576_M3.fm Page 93 Thursday, November 4, 24 2:38 PM H P T E R Working with ombinational Logic Introduction Now that we ve learned about two-level logic and had a short introduction to multilevel
More informationCHAPTER 12 REGISTERS AND COUNTERS
HPTER 2 REGISTERS N OUNTERS ontents 2. Registers and Register Transfers 2.2 Shift Registers 2.3 esign of inary ounters 2.4 ounters for Other Sequences 2.5 ounter esign Using SR and JK FlipFlops 2.6 erivation
More informationDigital Logic Design. Midterm #1
The University of Toleo f7ms_il7.fm - EES: Digital Logic Design Stuent Name_ Digital Logic Design Miterm # Problems Points. 3. 4 3. 6 4. Total 5 Was the eam fair? yes no //7 The University of Toleo f7ms_il7.fm
More information3.2 Polynomial Functions of Higher Degree
71_00.qp 1/7/06 1: PM Page 6 Section. Polnomial Functions of Higher Degree 6. Polnomial Functions of Higher Degree What ou should learn Graphs of Polnomial Functions You should be able to sketch accurate
More informationWeek 10. Topic 1 Polynomial Functions
Week 10 Topic 1 Polnomial Functions 1 Week 10 Topic 1 Polnomial Functions Reading Polnomial functions result from adding power functions 1 together. Their graphs can be ver complicated, so the come up
More information