EECS 150 Homework 4 Solutions Fall 2008
|
|
- Alban Lester
- 6 years ago
- Views:
Transcription
1 Problem 1: You have a 100 MHz clock, and need to generate 3 separate clocks at different frequencies: 20 MHz, 1kHz, and 1Hz. How many flip flops do you need to implement each clock if you use: a) a ring counter? b) a binary counter? Show an example of each. Solution 1: a) To use a ring counter as a clock divider, you preload the flip flops with 1 s and 0 s and connect the output of the counter to the input. The master clock (in this case the 100MHz) is used to clock the flip flops, so the values are just rotated through to the output. Using a ring counter will require 1 flip flop per division. Think of a string of flip flops that are preloaded such that the first flip flop is 1 and the rest are 0. Each time the flip flops are clocked, that 1 gets one step closer to the output. If you have five flip flops, you clock through four 0 s (one per clock cycle) before the output is set to 1 (also for one clock cycle). So: 100MHz/20MHz = 5 5 flip flops required 100MHz/1kHz = 100, k flip flops required 100MHz/1Hz = 100 million 10 8 flip flops required The duty cycle of the divided clock is determined by the preloaded values. To get closer to a 50% duty cycle, preload half the flip flops with 1 s and half with 0 s. (Be sure to put all the 1 s together and all the 0 s together so you don t get extra output transitions.) An example of a clock divider using a ring counter is shown below: b) A binary counter is much more efficient than a ring counter for a clock divider. To see the output of a binary counter, look at a truth table. The least significant bit changes in every row, the next bit changes every other row, the next bit changes every 4 th row, etc, so the n th bit changes every 2 n rows. If each row represents a clock cycle, it is easy to see how the first flip flop outputs f0/2, because it takes two rows (two clock cycles) for the output bit to make two transitions (one clock cycle). Similarly, the 2 nd flip flop outputs f0/4, the third flip flop outputs f0/8, etc. What if we want to divide the input clock by something that is not 2 n? The output of the flip flop stages will no longer be the divided clock output directly. Instead, we Page 1 of 12
2 use the output of the binary counter to count cycles, and feed that into a comparator. If you want to divide the master clock by 5, you set the comparator to count 5 cycles of the master clock, toggle its output, and reset the binary counter. The number of flip flops needed to implement a clock divider using a binary counter is significantly less than the ring counter in part (a). The number of bits needed to represent the clock divisor determines the number of flip flops required: 100MHz/20MHz = 5 5 < bit binary counter 3 flip flops 100MHz/1kHz = 100k 100k < bit binary counter 17 FFs 100MHz/1Hz = < bit binary counter 27 FFs One additional flip flop is required at the output of the comparator to stabilize the output clock. This cleans up the clock so it doesn t change while the combinational logic inside the comparator still busy switching. An example of a clock divider using a binary counter is shown below (refer to lab 2 for the comparator logic): Problem 2: You have a clock with a frequency of 2*f0 and you want a clock with a frequency of f0 and a 50% duty cycle. Design a simple circuit to do this. Does the duty cycle of the output depend on the duty cycle of the input? Solution 2: The simplest way to do this is to use a single D flip flop, and connect the output Q to the input D through an inverter. Q will toggle with each clock cycle, which means that each full cycle of the clock (i.e., each rising edge) results in only half a cycle on Page 2 of 12
3 Q. Note that the flip flop will have to preloaded, but it doesn t matter if it starts at 1 or 0. The duty cycle of the output is independent of the input, because the flip flop is edge triggered. Each rising edge of the clock toggles the output Q, but the falling edge of the clock has no effect on the flip flop. The resulting circuit is shown below: Problem 3: Starting with a cross coupled NOR SR latch, use "bubble pushing" to redraw the latch using NAND gates, and show that it turns into a SR latch. Carefully label the inputs and outputs. Solution 3: The NOR SR latch is shown in Figure 6.5 of CLD2. Figures show the equivalent gates, and the steps to convert AND/OR logic to NAND gates only. The first step is to recognize that a NOR gate is equivalent to an AND gate with inverted inputs. (This should look very familiar it is DeMorgan s law.) We can prove this by simply drawing the truth table: A B A + B A B So, that turns our NOR into an AND with inverted inputs. To make it a NAND, we have to add an additional inverter after the output. This results in the circuit below: Page 3 of 12
4 We can get rid of the inverters at the inputs of the NAND gates by re labeling the signals appropriately. The inputs R and S are inverted going into the NAND gates because of the bubbles, so we can change the signal labels to R and S and get rid of the bubble at the input. Notice that the output of each NAND gate is inverted before feeding back into the other gate, then inverted again at the input. These cancel each other out and can be removed. Again, take care to keep the labels for Q and Q correct. See the steps of the conversion in the figure below; the circuit now matches the SR latch that was shown in class: Problem 4: How many different functions are there of 4 variables? Solution 4: Any particular function of 4 variables has 2 4 = 16 unique input combinations, so there are 16 rows of the truth table. How many different combinations are there for these 16 output rows? Each row could have a 1 or a 0 in each of the 16 spots, so there are 2 16 different output combinations, thus 2 16 = 65,536 functions of 4 variables. In general, there are 2 2n different functions of n variables. See page 47 in CLD2 for all the functions of 2 variables ( 2 22 = 16). Problem 5: Given the function F(A,B,C,D) = Σm (3,4,5,6,7, 8, 12,13,15) a) draw a Karnaugh map of this function i) list all of the prime implicants ii) list the essential prime implicants b) write down a minimal sum of products formula for the function c) draw an implementation of the function using only NAND gates d) draw a Karnaugh map of the complement of the function, F i) list all of the prime implicants ii) list the essential prime implicants iii) write down a minimal sum of products formula for the function F e) use De Morgan's law on the formula in d iii) to write down a minimal product of sums formula for F Page 4 of 12
5 Solution 5: a) Each minterm contributes one element of the on set to the K map: m3 = m0011 put a 1 in the box corresponding to ABCD = 0011 m4 = m0100 put a 1 in the box corresponding to ABCD = 0100 etc. The K map for F is shown below, with prime implicants outlined in blue and essential prime implicants outlined in red. i) Prime implicants are implicants (groups of elements of the on set) that cannot be combined with any other implicants to eliminate a literal. The prime implicants of F are: ACD,AB, ACD,BC,BD ii) Essential prime implicants contain elements of the on set that are not included in any other prime implicant. The essential prime implicants of F are: ACD,AB,ACD,BD. In this case, all except one prime implicants are essential. Also notice that in this case, the essential primes give full coverage. b) The minimal SoP form for the function F is obtained from the essential prime implicants, since they give a full cover: F = ACD + AB + ACD + BD c) The SoP implementation is an AND/OR implementation, so we can use the bubble pushing technique from Problem 3 to convert this to NAND gates. The conversion is shown below: Page 5 of 12
6 d) The K map for F is the opposite of the K map we made for part (a) just swap the 1s and 0s. i) The prime implicants of F are: ABD, ABC,BCD,BCD, ACD, ABD,ABC ii) There is only one essential prime for F : ACD iii) There are several different minimal SoP expressions. Each MUST contain the essential prime implicant, ACD. Choose other prime implicants that give full coverage. One minimal SoP form is: F = ACD + ABC + ABD + ABD e) DeMorgan s law says that X + Y = XY and XY = X + Y. We start with F, and then complement both sides: F = ACD + ABC + ABD + ABD Apply DeMorgan s to the right side of the equation by complementing each individual term, and replace the OR s with AND s: F = ACD ABC ABD ABD Now apply DeMorgan s to each individual term, which yields the minimum PoS form Page 6 of 12
7 of F: F = (A + C + D) (A + B + C) (A + B + D) (A + B + D) Problem 6: Design a 3 bit counter with one input. When the input is high, the counter counts by 2 (e.g. 3,5,7,1,3...), and when the input is low the counter counts by 3s (e.g. 0,3,6,1,4,7,2,5,0). a) draw the state diagram b) draw the state transition table. c) draw Karnaugh maps for the next state logic d) find both minimal SoP and PoS formulas for the next states. Solution 6: a) State diagram: b) Transition table: Page 7 of 12
8 c) For the 4 variable K maps, we ll define the inputs (A,B,C,D) = (In, CS[2], CS[1], CS[0]). The Next State outputs will be NS[2], NS[1], and NS[0]. The K maps are: Page 8 of 12
9 d) The minimal SoP and PoS formulas for the next states are found directly from the K maps. To obtain the minimal SoP form, take the normal approach: identify prime implicants of members of the on set as we did in problem 5, and choose a minimal set of prime implicants that fully cover the on set. We get: NS[2] = BC + ABD + BCD + ABC NS[1] = CD + AC + ACD NS[0] = AD + AD To obtain the minimal PoS form, we use the elements of the off set in the K map. This is because the PoS form contains maxterms, which we found in the truth table where the output of the function was zero. Group the 0 s in the K map the same way you would group the 1 s, finding the largest possible sets. These sets are in the K maps above with green boxes. Each set contributes a sum term, but just like finding the maxterms the variables are complemented. For example, the box of 4 Page 9 of 12
10 0 s in the left two columns of the N[0] K map yield the term A + D (instead of AD as they would if these were 1 s). The resulting PoS forms for the next states are: NS[2] = (B + C) (A + B + D) (B + C + D) (A + B + C) NS[1] = (A + C) (C + D) (A + C + D) NS[0] = (A + D) (A + D) Problem 7: A Gray Code is a binary code with the property that exactly one bit changes from each position to the next. An excellent example of a two bit Gray Code is the header column (or header row) on a 4 bit K Map: 00, 01, 11, 10. Gray Codes occasionally arise in specialized situations. For example, when one is synthesizing a range filter in a router, it turns out that ranges tend to be more compactly represented in a Gray Code representation than in standard binary code. (a) Write down the three bit Gray code sequence starting with 000, (hint: try a 3 bit KMap, then go left to right across the top and then right to left across the bottom, using the row bit as the high order bit and the column bits as the two low order bits. This works; why? (b) draw the state diagram (c) draw the state transition table. (d) draw Karnaugh maps for the next state logic (e) find both minimal SoP and PoS formulas for the next state Solution 7: a) The three bit Gray Code sequence is: 000, 001, 011, 010, 110, 111, 101, 100. Using the three variable K map to find the three bit Gray code works because only one bit changes when you move from one box of the K map to any adjacent box; this is the definition of the Gray Code. Note that this does NOT work if you go left toright across the top row AND left to right across the bottom row; you must move from one cell to the next adjacent cell. b) State diagram: c) State transition table: Page 10 of 12
11 d) K maps: e) Use the same process as we used in Problem 6 to find the minimal SoP and PoS forms for the next states. The minimal SoP forms are: A + = BC + AC Page 11 of 12
12 B + = BC + AC C + = AB + AB The minimal PoS forms are: A + = (A + C) (B + C) B + = (A + C) (B + C) C + = (A + B) (A + B) Page 12 of 12
Odd-Prime Number Detector The table of minterms is represented. Table 13.1
Odd-Prime Number Detector The table of minterms is represented. Table 13.1 Minterm A B C D E 1 0 0 0 0 1 3 0 0 0 1 1 5 0 0 1 0 1 7 0 0 1 1 1 11 0 1 0 1 1 13 0 1 1 0 1 17 1 0 0 0 1 19 1 0 0 1 1 23 1 0 1
More informationCHAPTER 3 BASIC & COMBINATIONAL LOGIC CIRCUIT
CHAPTER 3 BASIC & COMBINATIONAL LOGIC CIRCUIT CHAPTER CONTENTS 3.1 Introduction to Basic Gates 3.2 Analysing A Combinational Logic Circuit 3.3 Design A Combinational Logic Circuit From Boolean Expression
More informationlogic system Outputs The addition of feedback means that the state of the circuit may change with time; it is sequential. logic system Outputs
Sequential Logic The combinational logic circuits we ve looked at so far, whether they be simple gates or more complex circuits have clearly separated inputs and outputs. A change in the input produces
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 07 October 31, 2011 / November 07, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative
More informationDr. Nicola Nicolici COE/EE2DI4 Midterm Test #1 Oct 18, 2006
COE/EE2DI4 Midterm Test #1 Fall 2006 Page 1 Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #1 Oct 18, 2006 Instructions: This examination paper includes 10 pages and 20 multiple-choice questions starting
More informationChapter 3 Digital Logic Structures
Chapter 3 Digital Logic Structures Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2): 48 million IBM PowerPC 75FX (22): 38 million IBM/Apple PowerPC
More informationECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Karnaugh Maps and Minimum Sum-of-Product Forms Dr. D. J. Jackson Lecture 7- Karnaugh map The key to finding a minimum cost SOP or POS form
More informationAsst. Prof. Thavatchai Tayjasanant, PhD. Power System Research Lab 12 th Floor, Building 4 Tel: (02)
2145230 Aircraft Electricity and Electronics Asst. Prof. Thavatchai Tayjasanant, PhD Email: taytaycu@gmail.com aycu@g a co Power System Research Lab 12 th Floor, Building 4 Tel: (02) 218-6527 1 Chapter
More informationAnalysis procedure. To obtain the output Boolean functions from a logic diagram, proceed as follows:
Combinational Logic Logic circuits for digital systems may be combinational or sequential. combinational circuit consists of input variables, logic gates, and output variables. 1 nalysis procedure To obtain
More informationSubject: Analog and Digital Electronics Code:15CS32
Subject: Analog and Digital Electronics Code:15CS32 Syllabus: The Basic Gates : Review of Basic Logic gates, Positive and Negative Logic, Introduction to HDL. Combinational Logic Circuits:Sum-of-Products
More informationCourse Overview. Course Overview
Course Overview Where does this course fit into the Electrical Engineering curriculum? Page 5 Course Overview Where does this course fit into the Computer Engineering curriculum? Page 6 3 Course Content
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 7 & 8 NAND and XOR Implementations Combinational Design Procedure NAND-NAND & NOR-NOR Networks DeMorgan
More information(CSC-3501) Lecture 6 (31 Jan 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement
Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 6 (31 Jan 2008) 1 Announcement 2 1 Reminder A logic circuit is composed of: Inputs Outputs Functional specification
More informationNumber system: the system used to count discrete units is called number. Decimal system: the number system that contains 10 distinguished
Number system: the system used to count discrete units is called number system Decimal system: the number system that contains 10 distinguished symbols that is 0-9 or digits is called decimal system. As
More informationDIGITAL ELECTRONICS QUESTION BANK
DIGITAL ELECTRONICS QUESTION BANK Section A: 1. Which of the following are analog quantities, and which are digital? (a) Number of atoms in a simple of material (b) Altitude of an aircraft (c) Pressure
More informationIES Digital Mock Test
. The circuit given below work as IES Digital Mock Test - 4 Logic A B C x y z (a) Binary to Gray code converter (c) Binary to ECESS- converter (b) Gray code to Binary converter (d) ECESS- To Gray code
More informationBOOLEAN ALGEBRA AND LOGIC FAMILIES
C H A P T E R 7 Learning Objectives Unique Feature of Boolean Algebra Laws of Boolean Algebra Equivalent Switching Circuits DeMorgan s Theorem s The Sum-of-Products (SOP) Form The Standard SOP Form The
More informationLaboratory Manual CS (P) Digital Systems Lab
Laboratory Manual CS 09 408 (P) Digital Systems Lab INDEX CYCLE I A. Familiarization of digital ICs and digital IC trainer kit 1 Verification of truth tables B. Study of combinational circuits 2. Verification
More informationModule -18 Flip flops
1 Module -18 Flip flops 1. Introduction 2. Comparison of latches and flip flops. 3. Clock the trigger signal 4. Flip flops 4.1. Level triggered flip flops SR, D and JK flip flops 4.2. Edge triggered flip
More informationELECTRONIC CIRCUITS. Time: Three Hours Maximum Marks: 100
EC 40 MODEL TEST PAPER - 1 ELECTRONIC CIRCUITS Time: Three Hours Maximum Marks: 100 Answer five questions, taking ANY TWO from Group A, any two from Group B and all from Group C. All parts of a question
More informationLarger 5 & 6variable Karnaugh maps
Larger 5 & 6variable Karnaugh maps Larger Karnaugh maps reduce larger logic designs. How large is large enough? That depends on the number of inputs, fan-ins, to the logic circuit under consideration.
More informationCS302 Digital Logic Design Solved Objective Midterm Papers For Preparation of Midterm Exam
CS302 Digital Logic Design Solved Objective Midterm Papers For Preparation of Midterm Exam MIDTERM EXAMINATION 2011 (October-November) Q-21 Draw function table of a half adder circuit? (2) Answer: - Page
More informationDe Morgan s second theorem: The complement of a product is equal to the sum of the complements.
Q. What is Gate? State and prove De Morgan s theorems. nswer: digital circuit having one or more input signals but only one output signal is called a gate. De Morgan s first theorem: The complement of
More informationObjective Questions. (a) Light (b) Temperature (c) Sound (d) all of these
Objective Questions Module 1: Introduction 1. Which of the following is an analog quantity? (a) Light (b) Temperature (c) Sound (d) all of these 2. Which of the following is a digital quantity? (a) Electrical
More informationDigital Logic Circuits
Digital Logic Circuits Let s look at the essential features of digital logic circuits, which are at the heart of digital computers. Learning Objectives Understand the concepts of analog and digital signals
More informationLecture 15 Analysis of Combinational Circuits
Lecture 15 Analysis of Combinational Circuits Designing Combinational Logic Circuits A logic circuit having 3 inputs, A, B, C will have its output HIGH only when a majority of the inputs are HIGH. Step
More informationName: Class: Date: 1. As more electronic systems have been designed using digital technology, devices have become smaller and less powerful.
Name: Class: Date: DE Midterm Review 2 True/False Indicate whether the statement is true or false. 1. As more electronic systems have been designed using digital technology, devices have become smaller
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) SUMMER-16 EXAMINATION Model Answer
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model answer and the answer written by candidate
More information6.1 In this section, you will design (but NOT build) a circuit with 4 inputs,
EE 2449 Experiment 6 Jack Levine and Nancy Warter-Perez //208 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 6 COMBINATIONAL
More informationWinter 14 EXAMINATION Subject Code: Model Answer P a g e 1/28
Subject Code: 17333 Model Answer P a g e 1/28 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationGATE Online Free Material
Subject : Digital ircuits GATE Online Free Material 1. The output, Y, of the circuit shown below is (a) AB (b) AB (c) AB (d) AB 2. The output, Y, of the circuit shown below is (a) 0 (b) 1 (c) B (d) A 3.
More informationFan in: The number of inputs of a logic gate can handle.
Subject Code: 17333 Model Answer Page 1/ 29 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationExercises: Fundamentals of Computer Engineering 1 PAGE: 1
Exercises: Fundamentals of Computer Engineering PAGE: Exercise Minimise the following using the laws of Boolean algebra. f = a + ab + ab.2 f ( ) ( ) ( ) 2 = c bd + bd + ac b + d + cd a + b + ad( b + c)
More informationNUMBER SYSTEM AND CODES
NUMBER SYSTEM AND CODES INTRODUCTION:- The term digital refers to a process that is achieved by using discrete unit. In number system there are different symbols and each symbol has an absolute value and
More informationUNIT-2: BOOLEAN EXPRESSIONS AND COMBINATIONAL LOGIC CIRCUITS
UNIT-2: BOOLEAN EXPRESSIONS AND COMBINATIONAL LOGIC CIRCUITS STRUCTURE 2. Objectives 2. Introduction 2.2 Simplification of Boolean Expressions 2.2. Sum of Products 2.2.2 Product of Sums 2.2.3 Canonical
More information2 Logic Gates THE INVERTER. A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs.
2 Logic Gates A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. THE INVERTER The inverter (NOT circuit) performs the operation called inversion
More informationCOMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC CSCD211- DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF GHANA
COMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC LOGIC Logic is a branch of math that tries to look at problems in terms of being either true or false. It will use a set of statements to derive new true
More informationEXPERIMENT NO 1 TRUTH TABLE (1)
EPERIMENT NO AIM: To verify the Demorgan s theorems. APPARATUS REQUIRED: THEORY: Digital logic trainer and Patch cords. The digital signals are discrete in nature and can only assume one of the two values
More information3.1 There are three basic logic functions from which all circuits can be designed: NOT (invert), OR, and
EE 2449 Experiment 3 Jack Levine and Nancy Warter-Perez, Revised 6/12/17 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 3
More informationFunction Table of an Odd-Parity Generator Circuit
Implementation of an Odd-Parity Generator Circuit The first step in implementing any circuit is to represent its operation in terms of a Truth or Function table. The function table for an 8-bit data as
More informationSRV ENGINEERING COLLEGE SEMBODAI RUKMANI VARATHARAJAN ENGINEERING COLLEGE SEMBODAI
SEMBODAI RUKMANI VARATHARAJAN ENGINEERING COLLEGE SEMBODAI 6489 (Approved By AICTE,Newdelhi Affiliated To ANNA UNIVERSITY::Chennai) CS 62 DIGITAL ELECTRONICS LAB (REGULATION-23) LAB MANUAL DEPARTMENT OF
More informationComputer Architecture: Part II. First Semester 2013 Department of Computer Science Faculty of Science Chiang Mai University
Computer Architecture: Part II First Semester 2013 Department of Computer Science Faculty of Science Chiang Mai University Outline Combinational Circuits Flips Flops Flops Sequential Circuits 204231: Computer
More informationLOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM. 2012/ODD/III/ECE/DE/LM Page No. 1
LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM K-Map for SUM: K-Map for CARRY: SUM = A B + AB CARRY = AB 22/ODD/III/ECE/DE/LM Page No. EXPT NO: DATE : DESIGN OF ADDER AND SUBTRACTOR AIM: To design
More informationSpec. Instructor: Center
PDHonline Course E379 (5 PDH) Digital Logic Circuits Volume III Spec ial Logic Circuits Instructor: Lee Layton, P.E 2012 PDH Online PDH Center 5272 Meadow Estatess Drive Fairfax, VA 22030-6658 Phone &
More informationHIGH LOW Astable multivibrators HIGH LOW 1:1
1. Multivibrators A multivibrator circuit oscillates between a HIGH state and a LOW state producing a continuous output. Astable multivibrators generally have an even 50% duty cycle, that is that 50% of
More informationFormal Foundation of Digital Design
Chapter 2: Switching Algebra and Logic Circuits 78 22 Digital Logic Design @ Department of Computer Engineering KKU. Formal Foundation of Digital Design In 854 George Boole published An investigation into
More informationModule 4: Design and Analysis of Combinational Circuits 1. Module-4. Design and Analysis of Combinational Circuits
1 Module-4 Design and Analysis of Combinational Circuits 4.1 Motivation: This topic develops the fundamental understanding and design of adder, substractor, code converter multiplexer, demultiplexer etc
More informationLIST OF EXPERIMENTS. KCTCET/ /Odd/3rd/ETE/CSE/LM
LIST OF EXPERIMENTS. Study of logic gates. 2. Design and implementation of adders and subtractors using logic gates. 3. Design and implementation of code converters using logic gates. 4. Design and implementation
More informationBrought to you by. Priti Srinivas Sajja. PS01CMCA02 Course Content. Tutorial Practice Material. Acknowldgement References. Website pritisajja.
Brought to you by Priti Srinivas Sajja PS01CMCA02 Course Content Tutorial Practice Material Acknowldgement References Website pritisajja.info Multiplexer Means many into one, also called data selector
More informationGates and Circuits 1
1 Gates and Circuits Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors Combine basic gates into circuits Describe the behavior
More informationSYNTHESIS OF COMBINATIONAL CIRCUITS
HPTER 6 SYNTHESIS O OMINTIONL IRUITS 6.1 Introduction oolean functions can be expressed in the forms of sum-of-products and productof-sums. These expressions can also be minimized using algebraic manipulations
More informationCombinational Logic Design CH002
Combinational Logic Design CH002 Figure 2.1 Circuit as a black box with inputs, outputs, and specifications Figure 2.2 Elements and nodes Figure 2.3 Combinational logic circuit Figure 2.4 Two OR implementations
More informationDigital Systems Principles and Applications TWELFTH EDITION. 3-3 OR Operation With OR Gates. 3-4 AND Operations with AND gates
Digital Systems Principles and Applications TWELFTH EDITION CHAPTER 3 Describing Logic Circuits Part -2 J. Bernardini 3-3 OR Operation With OR Gates An OR gate is a circuit with two or more inputs, whose
More informationCS302 - Digital Logic Design Glossary By
CS302 - Digital Logic Design Glossary By ABEL : Advanced Boolean Expression Language; a software compiler language for SPLD programming; a type of hardware description language (HDL) Adder : A digital
More informationDEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES FACULTY NAME/DESIGNATION: SUGAPRIYAA.THA / LECTURER
DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS SUBJECT CODE: EC2203 FACULTY NAME/DESIGNATION: SUGAPRIYAA.THA / LECTURER CLASS: II YEAR ECE UNIT-I MINIMISATION
More informationClassification of Digital Circuits
Classification of Digital Circuits Combinational logic circuits. Output depends only on present input. Sequential circuits. Output depends on present input and present state of the circuit. Combinational
More informationChapter 4: FLIP FLOPS. (Sequential Circuits) By: Siti Sabariah Hj. Salihin ELECTRICAL ENGINEERING DEPARTMENT EE 202 : DIGITAL ELECTRONICS 1
Chapter 4: FLIP FLOPS (Sequential Circuits) By: Siti Sabariah Hj. Salihin ELECTRICAL ENGINEERING DEPARTMENT 1 CHAPTER 4 : FLIP FLOPS Programme Learning Outcomes, PLO Upon completion of the programme, graduates
More informationTopic Notes: Digital Logic
Computer Science 220 Assembly Language & Comp. Architecture Siena College Fall 20 Topic Notes: Digital Logic Our goal for the next couple of weeks is to gain a reasonably complete understanding of how
More informationB.E. SEMESTER III (ELECTRICAL) SUBJECT CODE: X30902 Subject Name: Analog & Digital Electronics
B.E. SEMESTER III (ELECTRICAL) SUBJECT CODE: X30902 Subject Name: Analog & Digital Electronics Sr. No. Date TITLE To From Marks Sign 1 To verify the application of op-amp as an Inverting Amplifier 2 To
More informationCMSC 2833 Lecture 26. Step Expression Justification
omputer Organiation I. Karnaugh Maps and Minimiation MS Lecture Minimiation with Theorems onsider the Boolean function: FF(xx, yy, ) = xxʹyyʹ + xyʹʹ + xyʹ + xxxxʹ + xxxxxx Step Expression Justification.
More informationCOMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design
PH-315 COMINATIONAL and SEUENTIAL LOGIC CIRCUITS Hardware implementation and software design A La Rosa I PURPOSE: To familiarize with combinational and sequential logic circuits Combinational circuits
More informationUNIT II: Clocked Synchronous Sequential Circuits. CpE 411 Advanced Logic Circuits Design 1
UNIT II: Clocked Synchronous Sequential Circuits CpE 411 Advanced Logic Circuits Design 1 Unit Outline Analysis of Sequential Circuits State Tables State Diagrams Flip-flop Excitation Tables Basic Design
More informationDigital Electronics Course Objectives
Digital Electronics Course Objectives In this course, we learning is reported using Standards Referenced Reporting (SRR). SRR seeks to provide students with grades that are consistent, are accurate, and
More informationCHAPTER 16 SEQUENTIAL CIRCUIT DESIGN. Click the mouse to move to the next page. Use the ESC key to exit this chapter.
CHPTER 6 SEQUENTIL CIRCUIT DESIGN Click the mouse to move to the next page. Use the ESC key to exit this chapter. Contents 6. Summary of Design Procedure for Sequential Circuits 6.2 Design ExampleCode
More informationHashemite University Mechatronics Engineering Department Logic and Electronics Laboratory Manual
Hashemite University Mechatronics Engineering Department Logic and Electronics Laboratory Manual The Hashemite University Faculty of Engineering Department of Mechatronics Engineering Logic and Electronics
More informationPositive and Negative Logic
Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem - IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 4 Lecture Title:
More informationDigital. Design. R. Ananda Natarajan B C D
Digital E A B C D 0 1 2 3 4 5 6 Design 7 8 9 10 11 12 13 14 15 Y R. Ananda Natarajan Digital Design Digital Design R. ANANDA NATARAJAN Professor Department of Electronics and Instrumentation Engineering
More informationCOURSE LEARNING OUTCOMES AND OBJECTIVES
COURSE LEARNING OUTCOMES AND OBJECTIVES A student who successfully fulfills the course requirements will have demonstrated: 1. an ability to analyze and design CMOS logic gates 1-1. convert numbers from
More informationUNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING SEMESTER TWO EXAMINATION 2017/2018
UNIVERSITY OF BOLTON [EES04] SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002
More information1. The decimal number 62 is represented in hexadecimal (base 16) and binary (base 2) respectively as
BioE 1310 - Review 5 - Digital 1/16/2017 Instructions: On the Answer Sheet, enter your 2-digit ID number (with a leading 0 if needed) in the boxes of the ID section. Fill in the corresponding numbered
More informationChapter 3 Describing Logic Circuits Dr. Xu
Chapter 3 Describing Logic Circuits Dr. Xu Chapter 3 Objectives Selected areas covered in this chapter: Operation of truth tables for AND, NAND, OR, and NOR gates, and the NOT (INVERTER) circuit. Boolean
More informationBy: Dr. Ahmed ElShafee
Lecture (03) COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II Design of Circuits with Limited Gate Fan In In
More informationChapter 5 Sequential Logic Circuits Part II Hiroaki Kobayashi 7/11/2011
Chapter 5 Sequential Logic Circuits Part II Hiroaki Kobayashi 7//2 Ver. 72 7//2 Computer Engineering What is a Sequential Circuit? A circuit consists of a combinational logic circuit and internal memory
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Floyd, Digital Fundamentals, th ed 28 Pearson Education 29 Pearson Education, Upper Saddle River, NJ 7458. ll Rights Reserved ombinational Logic ircuits
More informationGOVERNMENT OF KARNATAKA KARNATAKA STATE PRE-UNIVERSITY EDUCATION EXAMINATION BOARD II YEAR PUC EXAMINATION JULY-2012 SCHEME OF VALUATION
GOVERNMENT OF KARNATAKA KARNATAKA STATE PRE-UNIVERSITY EDUCATION EXAMINATION BOARD II YEAR PUC EXAMINATION JULY-0 SCHEME OF VALUATION Subject Code: 40 Subject: PART - A 0. Which region of the transistor
More informationCode No: R Set No. 1
Code No: R05310402 Set No. 1 1. (a) What are the parameters that are necessary to define the electrical characteristics of CMOS circuits? Mention the typical values of a CMOS NAND gate. (b) Design a CMOS
More informationElectronics. Digital Electronics
Electronics Digital Electronics Introduction Unlike a linear, or analogue circuit which contains signals that are constantly changing from one value to another, such as amplitude or frequency, digital
More informationEE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad
A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 24 p. 1/21 EE 42/100 Lecture 24: Latches and Flip Flops ELECTRONICS Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad University of California,
More informationCONTENTS Sl. No. Experiment Page No
CONTENTS Sl. No. Experiment Page No 1a Given a 4-variable logic expression, simplify it using Entered Variable Map and realize the simplified logic expression using 8:1 multiplexer IC. 2a 3a 4a 5a 6a 1b
More informationCOLLEGE OF ENGINEERING, NASIK
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NASIK LAB MANUAL DIGITAL ELECTRONICS LABORATORY Subject Code: 2246 27-8 PUNE VIDYARTHI GRIHA S COLLEGE OF ENGINEERING,NASHIK. INDEX Batch : - Sr.No Title
More informationDIGITAL CIRCUITS AND SYSTEMS ASSIGNMENTS 1 SOLUTIONS
DIGITAL CIRCUITS AND SYSTEMS ASSIGNMENTS 1 SOLUTIONS 1. Analog signal varies continuously between two amplitudes over the given interval of time. Between these limits of amplitude and time, the signal
More informationEMT1250 LABORATORY EXPERIMENT. EXPERIMENT # 4: Combinational Logic Circuits. Name: Date:
EXPERIMENT # 4: Combinational Logic Circuits Name: Date: Equipment/Parts Needed: 5V DC Power Supply Digital Trainer (Logic Probe) Breadboard DIP Switch 7400 NAND gate 7402 NOR gate 7404 Inverter 7408 AND
More informationDigital Electronic Concepts
Western Technical College 10662137 Digital Electronic Concepts Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 4.00 Total Hours 108.00 This course
More informationDepartment of Electronics and Communication Engineering
Department of Electronics and Communication Engineering Sub Code/Name: BEC3L2- DIGITAL ELECTRONICS LAB Name Reg No Branch Year & Semester : : : : LIST OF EXPERIMENTS Sl No Experiments Page No Study of
More informationTime: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks
Code: 9A02401 PRINCIPLES OF ELECTRICAL ENGINEERING (Common to EIE, E.Con.E, ECE & ECC) Time: 3 hours Max. Marks: 70 1 In a series RLC circuit, R = 5 Ω, L = 1 H and C = 1 F. A dc v ltage f 20 V is applied
More informationB.C.A 2017 DIGITAL ELECTRONICS BCA104T MODULE SPECIFICATION SHEET. Course Outline
Course Outline B.C.A 2017 DIGITAL ELECTRONICS BCA104T MODULE SPECIFICATION SHEET The purpose of the course is to teach principles of digital electronics. This course covers varieties of topics including
More informationSynthesis of Combinational Logic
Synthesis of ombinational Logic 6.4 Gates F = xor Handouts: Lecture Slides, PS3, Lab2 6.4 - Spring 2 2/2/ L5 Logic Synthesis Review: K-map Minimization ) opy truth table into K-Map 2) Identify subcubes,
More informationDIGITAL ELECTRONICS. Methods & diagrams : 1 Graph plotting : - Tables & analysis : - Questions & discussion : 6 Performance : 3
DIGITAL ELECTRONICS Marking scheme : Methods & diagrams : 1 Graph plotting : - Tables & analysis : - Questions & discussion : 6 Performance : 3 Aim: This experiment will investigate the function of the
More informationGates and and Circuits
Chapter 4 Gates and Circuits Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors Combine basic gates into circuits Describe the
More informationProblem Solving Methods
Problem olving Methods Blake Thornton One of the main points of problem solving is to learn techniques by just doing problems. o, lets start with a few problems and learn a few techniques. Patience. Find
More informationCombinational Logic Circuits. Combinational Logic
Combinational Logic Circuits The outputs of Combinational Logic Circuits are only determined by the logical function of their current input state, logic 0 or logic 1, at any given instant in time. The
More informationUC Berkeley CS61C : Machine Structures
CS61C L22 Representations of Combinatorial Logic Circuits (1) inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 22 Representations of Combinatorial Logic Circuits 27-3-9 TA David
More informationThis Figure here illustrates the operation for a 2-input OR gate for all four possible input combinations.
Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem - IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 5 Lecture Title:
More informationLogic Symbols with Truth Tables INVERTER A B NAND A B C NOR C A B A B C XNOR A B C A B Digital Logic 1
Slide Logic Symbols with Truth Tables UFFER INVERTER ND NND OR NOR XOR XNOR 6.7 Digital Logic Digital logic can be described in terms of standard logic symbols and their corresponding truth tables. The
More informationPaper No. Name of the Paper Theory marks Practical marks Periods per week Semester-I I Semiconductor
Swami Ramanand Teerth Marathwada University, Nanded B. Sc. First Year Electronics Syllabus Semester system (To be implemented from Academic Year 2009-10) Name of the Theory marks Practical marks Periods
More informationUNIT-III ASYNCHRONOUS SEQUENTIAL CIRCUITS TWO MARKS 1. What are secondary variables? -present state variables in asynchronous sequential circuits 2. What are excitation variables? -next state variables
More informationEECS-140/141 Introduction to Digital Logic Design Lecture 7:Sequential Logic Basics
EECS-140/141 Introduction to Digital Logic Design Lecture 7:Sequential Logic Basics I. OVERVIEW I.A Combinational vs. Sequential Logic Combinational Logic (everything so far): Outputs depend entirely on
More informationCombinational logic. ! Regular logic: multiplexers, decoders, LUTs and FPGAs. ! Switches, basic logic and truth tables, logic functions
Combinational logic! Switches, basic logic and truth tables, logic functions! Algebraic expressions to gates! Mapping to different gates! Discrete logic gate components (used in labs and 2)! Canonical
More informationFunction Table of 74LS138, 3-to-8 Decoder +5V 6 G1 4 G2A 5 G2B. 4-to-16 Decoder using two 74LS139, 3-to-8 Decoder
CS0 Digital Logic Design The XX8 -to-8 Decoder The -to-8, XX8 Decoder is also commonly used in logical circuits. Similar, to the -to- Decoder, the -to-8 Decoder has active-low outputs and three extra NOT
More informationExercise 1: AND/NAND Logic Functions
Exercise 1: AND/NAND Logic Functions EXERCISE OBJECTIVE When you have completed this exercise, you will be able to determine the operation of an AND and a NAND logic gate. You will verify your results
More information