Computer Architecture and Organization
|
|
- Bartholomew Chambers
- 6 years ago
- Views:
Transcription
1 A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic
2 A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational Logic A.3 Truth Tables A.4 Logic Gates A.5 Properties of Boolean Algebra A.6 The Sum-of-Products Form and Logic Diagrams A.7 The Product-of-Sums Form A.8 Positive vs. Negative Logic A.9 The Data Sheet A.10 Digital Components A.11 Sequential Logic A.12 Design of Finite State Machines A.13 Mealy vs. Moore Machines A.14 Registers A.15 Counters A.16 Reduction of Combinational Logic and Sequential Logic A.17 Reduction of Two-Level Expressions A.18 State Reduction
3 A-3 Appendix A - Digital Logic Some Definitions Combinational logic: a digital logic circuit in which logical decisions are made based only on combinations of the inputs. e.g. an adder. Sequential logic: a circuit in which decisions are made based on combinations of the current inputs as well as the past history of inputs. e.g. a memory unit. Finite state machine: a circuit which has an internal state, and whose outputs are functions of both current inputs and its internal state. e.g. a vending machine controller.
4 A-4 Appendix A - Digital Logic The Combinational Logic Unit Translates a set of inputs into a set of outputs according to one or more mapping functions. Inputs and outputs for a CLU normally have two distinct (binary) values: high and low, 1 and 0, 0 and 1, or 5 V. and 0 V. for example. The outputs of a CLU are strictly functions of the inputs, and the outputs are updated immediately after the inputs change. A set of inputs i 0 i n are presented to the CLU, which produces a set of outputs according to mapping functions f 0 f m.
5 A-5 Appendix A - Digital Logic Truth Tables Developed in 1854 by George Boole further developed by Claude Shannon (Bell Labs) Outputs are computed for all possible input combinations (how many input combinations are there? Consider a room with two light switches. How must they work? Don't show this to your electrician, or wire your house this way. This circuit definitely violates the electric code. The practical circuit never leaves the lines to the light "hot" when the light is turned off. Can you figure how?
6 A-6 Appendix A - Digital Logic Alternate Assignments of Outputs to Switch Settings Logically identical truth table to the original (see previous slide), if the switches are configured up-side down.
7 A-7 Appendix A - Digital Logic Truth Tables Showing All Possible Functions of Two Binary Variables The more frequently used functions have names: AND, XOR, OR, NOR, XOR, and NAND. (Always use upper case spelling.)
8 A-8 Appendix A - Digital Logic Logic Gates and Their Symbols Logic symbols for AND, OR, buffer, and NOT Boolean functions Note the use of the inversion bubble. (Be careful about the nose of the gate when drawing AND vs. OR.)
9 A-9 Appendix A - Digital Logic Logic symbols for NAND, NOR, XOR, and XNOR Boolean functions
10 A-10 Appendix A - Digital Logic Variations of Basic Logic Gate Symbols
11 A-11 Appendix A - Digital Logic The Inverter at the Transistor Level Power Terminals Transistor Symbol A Transistor Used as an Inverter Inverter Transfer Function
12 A-12 Appendix A - Digital Logic Allowable Voltages in Transistor- Transistor-Logic (TTL) Assignments of logical 0 and 1 to voltage ranges (left) at the output of a logic gates, (right) at the input to a logic gate.
13 A-13 Appendix A - Digital Logic Transistor-Level Circuits For 2-Input NAND and NOR Gates
14 A-14 Appendix A - Digital Logic CMOS Configurations Schematic symbols for (left) n-channel transistor and (right) p-channel transistor. CMOS configurations for (a) NOT, (b) NOR, and (c) NAND gates.
15 A-15 Appendix A - Digital Logic Tri-State Buffers Outputs can be 0, 1, or electrically disconnected.
16 A-16 Appendix A - Digital Logic The Basic Properties of Boolean Algebra Principle of duality: The dual of a Boolean function is made by replacing AND with OR and OR with AND, constant 1s by 0s, and 0s by 1s A, B, etc. are literals; 0 and 1 are constants.
17 A-17 Appendix A - Digital Logic DeMorgan s Theorem Discuss: Applying DeMorgan s theorem by pushing the bubbles, and bubble tricks.
18 A-18 Appendix A - Digital Logic NAND Gates Can Implement AND and OR Gates Inverted inputs to a NAND gate are implemented with NAND gates.
19 A-19 Appendix A - Digital Logic The Sum-of-Products (SOP) Form Truth Table for The Majority Function Transform the function into a two-level AND-OR equation Implement the function with an arrangement of logic gates from the set {AND, OR, NOT} M is true when A=0, B=1, and C=1, or when A=1, B=0, and C=1, and so on for the remaining cases. Represent logic equations by using the sum-of-products (SOP) form
20 A-20 Appendix A - Digital Logic The SOP Form of the Majority Gate The SOP form for the 3-input majority gate is: M = ABC + ABC + ABC + ABC = m3 + m5 +m6 +m7 = Σ (3, 5, 6, 7) Each of the 2 n terms are called minterms, running from 0 to 2 n - 1 Note the relationship between minterm number and boolean value. Discuss: common-sense interpretation of equation.
21 A-21 Appendix A - Digital Logic A 2-Level AND-OR Circuit Implements the Majority Function The encircled T intersections are electrically common (see next slide).
22 A-22 Appendix A - Digital Logic Notation Used at Circuit Intersections
23 A-23 Appendix A - Digital Logic A 2-Level OR-AND Circuit Implements the Majority Function
24 A-24 Appendix A - Digital Logic Positive vs. Negative Logic Positive logic: truth, or assertion is represented by logic 1, higher voltage; falsity, de- or unassertion, logic 0, is represented by lower voltage. Negative logic: truth, or assertion is represented by logic 0, lower voltage; falsity, de- or unassertion, logic 1, is represented by lower voltage
25 A-25 Appendix A - Digital Logic Positive and Negative Logic (Cont d.)
26 A-26 Appendix A - Digital Logic Bubble Matching Active low signals are signified by a prime or overbar or /. Active high: enable Active low: enable, enable, enable/ Ex: microwave oven control: Active high: Heat = DoorClosed Start Active low:? (hint: begin with AND gate as before.)
27 A-27 Appendix A - Digital Logic Bubble Matching (Cont d.)
28 A-28 Appendix A - Digital Logic The Data Sheet
29 A-29 Appendix A - Digital Logic Digital Components High level digital circuit designs are normally made using collections of logic gates referred to as components, rather than using individual logic gates. The majority function can be viewed as a component. Levels of integration (numbers of gates) in an integrated circuit (IC): Small scale integration (SSI): gates. Medium scale integration (MSI): 100 to 1000 gates. Large scale integration (LSI): ,000 logic gates. Very large scale integration (VLSI): 10,000-upward. These levels are approximate, but the distinctions are useful in comparing the relative complexity of circuits. Let us consider several useful MSI components:
30 A-30 Appendix A - Digital Logic The Multiplexer
31 A-31 Appendix A - Digital Logic Gate-Level Layout of Multiplexer
32 A-32 Appendix A - Digital Logic Implementing the Majority Function with an 8-1 Mux Principle: Use the mux select to pick out the selected minterms of the function.
33 A-33 Appendix A - Digital Logic Efficiency: Using a 4-1 Mux to Implement the Majority Function Principle: Use the A and B inputs to select a pair of minterms. The value applied to the MUX input is selected from {0, 1, C, C} to pick the desired behavior of the minterm pair.
34 A-34 Appendix A - Digital Logic The Demultiplexer (DEMUX)
35 A-35 Appendix A - Digital Logic The Demultiplexer is a Decoder with an Enable Input
36 A-36 Appendix A - Digital Logic A 2-to-4 Decoder
37 A-37 Appendix A - Digital Logic Using a 3-to-8 Decoder to Implement the Majority Function
38 A-38 Appendix A - Digital Logic The Priority Encoder An encoder translates a set of inputs into a binary encoding, Can be thought of as the converse of a decoder. A priority encoder imposes an order on the inputs. A i has a higher priority than A i+1
39 A-39 Appendix A - Digital Logic Programmable Logic Arrays (PLAs) A PLA is a customizable AND matrix followed by a customizable OR matrix:
40 A-40 Appendix A - Digital Logic Using a PLA to Implement the Majority Function
41 A-41 Appendix A - Digital Logic Using PLAs to Implement an Adder
42 A-42 Appendix A - Digital Logic A Multi-Bit Ripple- Carry Adder PLA Realization of a Full Adder
43 A-43 Appendix A - Digital Logic Sequential Logic The combinational logic circuits we have been studying so far have no memory. The outputs always follow the inputs. There is a need for circuits with memory, which behave differently depending upon their previous state. An example is a vending machine, which must remember how many coins and what kinds of coins have been inserted. The machine should behave according to not only the current coin inserted, but also upon how many coins and what kinds of coins have been inserted previously. These are referred to as finite state machines, because they can have at most a finite number of states.
44 A-44 Appendix A - Digital Logic Classical Model of a Finite State Machine An FSM is composed of a combinational logic unit and delay elements (called flipflops) in a feedback path, which maintains state information.
45 A-45 Appendix A - Digital Logic NOR Gate with Lumped Delay The delay between input and output (which is lumped at the output for the purpose of analysis) is at the basis of the functioning of an important memory element, the flip-flop.
46 A-46 Appendix A - Digital Logic S-R Flip-Flop The S-R flip-flop is an active high (positive logic) device.
47 A-47 Appendix A - Digital Logic NAND Implementation of S-R Flip-Flop A NOR implementation of an S-R flip-flop is converted into a NAND implementation.
48 A-48 Appendix A - Digital Logic A Hazard It is desirable to be able to turn off the flip-flop so it does not respond to such hazards.
49 A-49 Appendix A - Digital Logic A Clock Waveform: The Clock Paces the System In a positive logic system, the action happens when the clock is high, or positive. The low part of the clock cycle allows propagation between subcircuits, so that the signals settle at their correct values when the clock next goes high.
50 A-50 Appendix A - Digital Logic Scientific Prefixes For computer memory, 1K = 2 10 = For everything else, like clock speeds, 1K = 1000, and likewise for 1M, 1G, etc.
51 A-51 Appendix A - Digital Logic Clocked S-R Flip-Flop The clock signal, CLK, enables the S and R inputs to the flip-flop.
52 A-52 Appendix A - Digital Logic Clocked D Flip-Flop The clocked D flip-flop, sometimes called a latch, has a potential problem: If D changes while the clock is high, the output will also change. The Master-Slave flip-flop (next slide) addresses this problem.
53 A-53 Appendix A - Digital Logic Master-Slave Flip-Flop The rising edge of the clock loads new data into the master, while the slave continues to hold previous data. The falling edge of the clock loads the new master data into the slave.
54 A-54 Appendix A - Digital Logic Clocked J-K Flip-Flop The J-K flip-flop eliminates the disallowed S=R=1 problem of the S-R flip-flop, because Q enables J while Q disables K, and vice-versa. However, there is still a problem. If J goes momentarily to 1 and then back to 0 while the flip-flop is active and in the reset state, the flip-flop will catch the 1. This is referred to as 1 s catching. The J-K Master-Slave flip-flop (next slide) addresses this problem.
55 A-55 Appendix A - Digital Logic Master-Slave J-K Flip-Flop
56 A-56 Appendix A - Digital Logic Clocked T Flip-Flop The presence of a constant 1 at J and K means that the flip-flop will change its state from 0 to 1 or 1 to 0 each time it is clocked by the T (Toggle) input.
57 A-57 Appendix A - Digital Logic Negative Edge-Triggered D Flip-Flop When the clock is high, the two input latches output 0, so the Main latch remains in its previous state, regardless of changes in D. When the clock goes high-to-low, values in the two input latches will affect the state of the Main latch. While the clock is low, D cannot affect the Main latch.
58 A-58 Appendix A - Digital Logic Example: Modulo-4 Counter Counter has a clock input (CLK) and a RESET input. Counter has two output lines, which take on values of 00, 01, 10, and 11 on subsequent clock cycles.
59 A-59 Appendix A - Digital Logic State Transition Diagram for Mod-4 Counter
60 A-60 Appendix A - Digital Logic State Table for Mod-4 Counter
61 A-61 Appendix A - Digital Logic State Assignment for Mod-4 Counter
62 A-62 Appendix A - Digital Logic Truth Table for Mod-4 Counter
63 A-63 Appendix A - Digital Logic Logic Design for Mod-4 Counter
64 A-64 Appendix A - Digital Logic Example: A Sequence Detector Example: Design a machine that outputs a 1 when exactly two of the last three inputs are 1. e.g. input sequence of produces an output sequence of Assume input is a 1-bit serial line. Use D flip-flops and 8-to-1 multiplexers. Start by constructing a state transition diagram (next slide).
65 A-65 Appendix A - Digital Logic Sequence Detector State Transition Diagram Design a machine that outputs a 1 when exactly two of the last three inputs are 1.
66 A-66 Appendix A - Digital Logic Sequence Detector State Table
67 A-67 Appendix A - Digital Logic Sequence Detector State Assignment
68 A-68 Appendix A - Digital Logic Sequence Detector Logic Diagram
69 A-69 Appendix A - Digital Logic Example: A Vending Machine Controller Example: Design a finite state machine for a vending machine controller that accepts nickels (5 cents each), dimes (10 cents each), and quarters (25 cents each). When the value of the money inserted equals or exceeds twenty cents, the machine vends the item and returns change if any, and waits for next transaction. Implement with a PLA and D flip-flops.
70 A-70 Appendix A - Digital Logic Vending Machine State Transition Diagram
71 A-71 Appendix A - Digital Logic Vending Machine State Table and State Assignment
72 A-72 Appendix A - Digital Logic PLA Vending Machine Controller
73 A-73 Appendix A - Digital Logic Moore Counter Mealy Model: Outputs are functions of Inputs and Present State. Previous FSM designs were Mealy Machines, in which next state was computed from present state and inputs. Moore Model: Outputs are functions of Present State only.
74 A-74 Appendix A - Digital Logic Four-Bit Register Makes use of tri-state buffers so that multiple registers can gang their outputs to common output lines.
75 A-75 Appendix A - Digital Logic Left-Right Shift Register with Parallel Read and Write
76 A-76 Appendix A - Digital Logic Modulo-8 Counter Note the use of the T flip-flops, implemented as J-K s. They are used to toggle the input of the next flip-flop when its output is 1.
77 A-77 Appendix A - Digital Logic Reduction (Simplification) of Boolean Expressions It is often possible to simplify the canonical SOP (or POS) forms. A smaller Boolean equation generally translates to a lower gate count in the target circuit. We cover three methods: algebraic reduction, Karnaugh map reduction, and tabular (Quine-McCluskey) reduction.
78 A-78 Appendix A - Digital Logic Reduced Majority Function Circuit Compared with the AND-OR circuit for the unreduced majority function, the inverter for C has been eliminated, one AND gate has been eliminated, and one AND gate has only two inputs instead of three inputs. Can the function by reduced further? How do we go about it?
79 A-79 Appendix A - Digital Logic The Algebraic Method Consider the majority function, F. We apply the algebraic method to reduce F to its minimal two-level form:
80 A-80 Appendix A - Digital Logic The Algebraic Method This majority circuit is functionally equivalent to the previous majority circuit, but this one is in its minimal two-level form:
81 A-81 Appendix A - Digital Logic Karnaugh Maps: Venn Diagram Representation of Majority Function Each distinct region in the Universe represents a minterm. This diagram can be transformed into a Karnaugh Map.
82 A-82 Appendix A - Digital Logic K-Map for Majority Function Place a 1 in each cell that corresponds to that minterm. Cells on the outer edge of the map wrap around
83 A-83 Appendix A - Digital Logic Adjacency Groupings for Majority Function F = BC + AC + AB
84 A-84 Appendix A - Digital Logic Minimized AND-OR Majority Circuit F = BC + AC + AB The K-map approach yields the same minimal two-level form as the algebraic approach.
85 A-85 Appendix A - Digital Logic K-Map Groupings Minimal grouping is on the left, non-minimal (but logically equivalent) grouping is on the right. To obtain minimal grouping, create smallest groups first.
86 A-86 Appendix A - Digital Logic K-Map Corners are Logically Adjacent
87 A-87 Appendix A - Digital Logic K-Maps and Don t Cares There can be more than one minimal grouping, as a result of don t cares.
88 A-88 Appendix A - Digital Logic 3-Level Majority Circuit K-Kap Reduction results in a reduced two-level circuit (that is, AND followed by OR. Inverters are not included in the two-level count). Algebraic reduction can result in multi-level circuits with even fewer logic gates and fewer inputs to the logic gates.
89 A-89 Appendix A - Digital Logic Truth Table with Don t Cares A truth table representation of a single function with don t cares.
90 A-90 Appendix A - Digital Logic Tabular (Quine-McCluskey) Reduction Tabular reduction begins by grouping minterms for which F is nonzero according to the number of 1 s in each minterm. Don t cares are considered to be nonzero. The next step forms a consensus (the logical form of a cross product) between each pair of adjacent groups for all terms that differ in only one variable.
91 A-91 Appendix A - Digital Logic Table of Choice The prime implicants form a set that completely covers the function, although not necessarily minimally. A table of choice is used to obtain a minimal cover set.
92 A-92 Appendix A - Digital Logic Reduced Table of Choice In a reduced table of choice, the essential prime implicants and the minterms they cover are removed, producing the eligible set. F = ABC + ABC + BD + AD
93 A-93 Appendix A - Digital Logic Multiple Output Truth Table The power of tabular reduction comes into play for multiple functions, in which minterms can be shared among the functions.
94 A-94 Appendix A - Digital Logic Multiple Output Table of Choice F 0 (A,B,C) = ABC + BC F 1 (A,B,C) = AC + AC + BC F 2 (A,B,C) = B
95 A-95 Appendix A - Digital Logic Speed and Performance The speed of a digital system is governed by: the propagation delay through the logic gates, and the propagation delay across interconnections. We will look at characterizing the delay for a logic gate, and a method of reducing circuit depth using function decomposition.
96 A-96 Appendix A - Digital Logic Propagation Delay for a NOT Gate (Adapted from: Hamacher et. al. 2001)
97 A-97 Appendix A - Digital Logic MUX Decomposition
98 A-98 Appendix A - Digital Logic OR-Gate Decomposition Fanin affects circuit depth.
99 A-99 Appendix A - Digital Logic State Reduction Description of state machine M 0 to be reduced.
100 A-100 Appendix A - Digital Logic Distinguishing Tree A next state tree for M 0.
101 A-101 Appendix A - Digital Logic Reduced State Table A reduced state table for machine M 1.
102 A-102 Appendix A - Digital Logic Sequence Detector State Transition Diagram
103 A-103 Appendix A - Digital Logic Sequence Detector State Table
104 A-104 Appendix A - Digital Logic Sequence Detector Reduced State Table
105 A-105 Appendix A - Digital Logic Sequence Detector State Assignment
106 A-106 Appendix A - Digital Logic Sequence Detector K-Maps K-map reduction of next state and output functions for sequence detector.
107 A-107 Appendix A - Digital Logic Sequence Detector Circuit
Principles of Computer Architecture. Appendix A: Digital Logic
A-1 Appendix A - Digital Logic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationChapter Contents. Appendix A: Digital Logic. Some Definitions
A- Appendix A - Digital Logic A-2 Appendix A - Digital Logic Chapter Contents Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A. Introduction A.2 Combinational
More information1. Convert the decimal number to binary, octal, and hexadecimal.
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
More informationMODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1
DAY MODU LE TOPIC QUESTIONS Day 1 Day 2 Day 3 Day 4 I Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation Phase Shift Wein Bridge oscillators.
More informationUsing minterms, m-notation / decimal notation Sum = Cout = Using maxterms, M-notation Sum = Cout =
1 Review of Digital Logic Design Fundamentals Logic circuits: 1. Combinational Logic: No memory, present output depends only on the present input 2. Sequential Logic: Has memory, present output depends
More informationMODULE 3. Combinational & Sequential logic
MODULE 3 Combinational & Sequential logic Combinational Logic Introduction Logic circuit may be classified into two categories. Combinational logic circuits 2. Sequential logic circuits A combinational
More informationMicroprocessor Design
Microprocessor Design Principles and Practices With VHDL Enoch O. Hwang Brooks / Cole 2004 To my wife and children Windy, Jonathan and Michelle Contents 1. Designing a Microprocessor... 2 1.1 Overview
More informationChapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
More informationR13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A
SET - 1 Note: Question Paper consists of two parts (Part-A and Part-B) Answer ALL the question in Part-A Answer any THREE Questions from Part-B a) What are the characteristics of 2 s complement numbers?
More informationR13 SET - 1 '' ''' '' ' '''' Code No: RT21053
SET - 1 1. a) What are the characteristics of 2 s complement numbers? b) State the purpose of reducing the switching functions to minimal form. c) Define half adder. d) What are the basic operations in
More informationDepartment of Computer Science and Engineering Question Bank- Even Semester:
Department of Computer Science and Engineering Question Bank- Even Semester: 2014-2015 CS6201& DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common to IT & CSE, Regulation 2013) UNIT-I 1. Convert the following
More informationQuestion Bank. Unit 1. Digital Principles, Digital Logic
Question Bank Unit 1 Digital Principles, Digital Logic 1. Using Karnaugh Map,simplify the following boolean expression and give the implementation of the same using i)nand gates only(sop) ii) NOR gates
More informationLESSON PLAN. Sub Code: EE2255 Sub Name: DIGITAL LOGIC CIRCUITS Unit: I Branch: EEE Semester: IV
Unit: I Branch: EEE Semester: IV Page 1 of 6 Unit I Syllabus: BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS 9 Boolean algebra: De-Morgan s theorem, switching functions and simplification using K-maps & Quine
More informationSolution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,
Solution to Digital Logic -2067 Solution to digital logic 2067 1.)What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it, A Magnitude comparator is a combinational
More informationDIGITAL SYSTEM DESIGN UNIT I (2 MARKS)
DIGITAL SYSTEM DESIGN UNIT I (2 MARKS) 1. Convert Binary number (111101100) 2 to Octal equivalent. 2. Convert Binary (1101100010011011) 2 to Hexadecimal equivalent. 3. Simplify the following Boolean function
More informationMODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100
MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER 2016 CS 203: Switching Theory and Logic Design Time: 3 Hrs Marks: 100 PART A ( Answer All Questions Each carries 3 Marks )
More information1.b. Realize a 5-input NOR function using 2-input NOR gates only.
. [3 points] Short Questions.a. Prove or disprove that the operators (,XOR) form a complete set. Remember that the operator ( ) is implication such that: A B A B.b. Realize a 5-input NOR function using
More informationThe word digital implies information in computers is represented by variables that take a limited number of discrete values.
Class Overview Cover hardware operation of digital computers. First, consider the various digital components used in the organization and design. Second, go through the necessary steps to design a basic
More informationDigital Principles and Design
Digital Principles and Design Donald D. Givone University at Buffalo The State University of New York Grauu Boston Burr Ridge, IL Dubuque, IA Madison, Wl New York San Francisco St. Louis Bangkok Bogota
More informationEXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.
EXPERIMENT: 1 DATE: VERIFICATION OF BASIC LOGIC GATES AIM: To verify the truth tables of Basic Logic Gates NOT, OR, AND, NAND, NOR, Ex-OR and Ex-NOR. APPARATUS: mention the required IC numbers, Connecting
More informationFind the equivalent decimal value for the given value Other number system to decimal ( Sample)
VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI 65 009 Department of Information Technology Model Exam-II-Question bank PART A (Answer for all Questions) (8 X = 6) K CO Marks Find the equivalent
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationEE292: Fundamentals of ECE
EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 23 121120 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Combinatorial Logic Sequential Logic 3 Combinatorial Logic Circuits
More informationPage 1. Some Definitions. Chapter 3: Sequential Logic. Sequential Logic. The Combinational Logic Unit. A NOR Gate with a Lumped Delay
3- hapter 3 equential Logic hapter 3: equential Logic 3-2 hapter 3 equential Logic ome efinitions r. Tim McGuire am Houston tate University ased on notes by Miles Murdocca ombinational logic: a digital
More informationA Review of logic design
Chapter 1 A Review of logic design 1.1 Boolean Algebra Despite the complexity of modern-day digital circuits, the fundamental principles upon which they are based are surprisingly simple. Boolean Algebra
More informationBachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 151) Pass Marks: 24
2065 Computer Science and Information Technology (CSc. 151) Pass Marks: 24 Time: 3 hours. Candidates are required to give their answers in their own words as for as practicable. Attempt any TWO questions:
More informationTribhuvan University Institute of Science and Technology Bachelor of Science in Computer Science and Information Technology
Tribhuvan University Institute of Science and Technology Bachelor of Science in Computer Science and Information Technology Course Title: Digital Logic Full Marks: 60 + 0 + 0 Course No.: CSC Pass Marks:
More informationSt. MARTIN S ENGINEERING COLLEGE
St. MARTIN S ENGINEERING COLLEGE Dhulapally, Kompally, Secunderabad-500014. Branch Year&Sem Subject Name : Electronics and Communication Engineering : II B. Tech I Semester : SWITCHING THEORY AND LOGIC
More informationChapter 4. Logic Design
Chapter 4 Logic Design 4.1 Introduction. In previous Chapter we studied gates and combinational circuits, which made by gates (AND, OR, NOT etc.). That can be represented by circuit diagram, truth table
More informationMC9211 Computer Organization
MC9211 Computer Organization Unit 2 : Combinational and Sequential Circuits Lesson2 : Sequential Circuits (KSB) (MCA) (2009-12/ODD) (2009-10/1 A&B) Coverage Lesson2 Outlines the formal procedures for the
More informationWINTER 15 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 informationME 515 Mechatronics. Introduction to Digital Electronics
ME 55 Mechatronics /5/26 ME 55 Mechatronics Digital Electronics Asanga Ratnaweera Department of Faculty of Engineering University of Peradeniya Tel: 8239 (3627) Email: asangar@pdn.ac.lk Introduction to
More informationUNIT 1 NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES 1. Briefly explain the stream lined method of converting binary to decimal number with example. 2. Give the Gray code for the binary number (111) 2. 3.
More informationUNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.
UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers. Digital computer is a digital system that performs various computational tasks. The word DIGITAL
More informationUNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram
UNIT III INTRODUCTION In combinational logic circuits, the outputs at any instant of time depend only on the input signals present at that time. For a change in input, the output occurs immediately. Combinational
More informationCS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Academic Year: 2015-16 BANK - EVEN SEMESTER UNIT I PART-A 1 Find the octal equivalent of hexadecimal
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics
Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and
More informationLaboratory Objectives and outcomes for Digital Design Lab
Class: SE Department of Information Technology Subject Logic Design Sem : III Course Objectives and outcomes for LD Course Objectives: Students will try to : COB1 Understand concept of various components.
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 informationVignana Bharathi Institute of Technology UNIT 4 DLD
DLD UNIT IV Synchronous Sequential Circuits, Latches, Flip-flops, analysis of clocked sequential circuits, Registers, Shift registers, Ripple counters, Synchronous counters, other counters. Asynchronous
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 Spring 2012 Question No: 1 ( Marks: 1 ) - Please choose one A SOP expression is equal to 1
More informationEECS 270 Final Exam Spring 2012
EECS 270 Final Exam Spring 2012 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Page # Points 2 /20 3 /12 4 /10 5 /15
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationTIME SCHEDULE. MODULE TOPICS PERIODS 1 Number system & Boolean algebra 17 Test I 1 2 Logic families &Combinational logic
COURSE TITLE : DIGITAL INSTRUMENTS PRINCIPLE COURSE CODE : 3075 COURSE CATEGORY : B PERIODS/WEEK : 4 PERIODS/SEMESTER : 72 CREDITS : 4 TIME SCHEDULE MODULE TOPICS PERIODS 1 Number system & Boolean algebra
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad ELECTRICAL AND ELECTRONICS ENGINEERING
Course Name INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK : SWITCHING THEORY AND LOGIC DESISN Course Code : A40407
More informationSubject : EE6301 DIGITAL LOGIC CIRCUITS
QUESTION BANK Programme : BE Subject : Semester / Branch : III/EEE UNIT 1 NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES Review of number systems, binary codes, error detection and correction codes (Parity
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationTYPICAL QUESTIONS & ANSWERS
DIGITALS ELECTRONICS TYPICAL QUESTIONS & ANSWERS OBJECTIVE TYPE QUESTIONS Each Question carries 2 marks. Choose correct or the best alternative in the following: Q.1 The NAND gate output will be low if
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationproblem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2002 4/5/02 Midterm Exam II Name: Solutions ID number:
More informationCS 61C: Great Ideas in Computer Architecture
CS 6C: Great Ideas in Computer Architecture Combinational and Sequential Logic, Boolean Algebra Instructor: Alan Christopher 7/23/24 Summer 24 -- Lecture #8 Review of Last Lecture OpenMP as simple parallel
More informationCombinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics
Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and
More informationPHYSICS 5620 LAB 9 Basic Digital Circuits and Flip-Flops
PHYSICS 5620 LAB 9 Basic Digital Circuits and Flip-Flops Objective Construct a two-bit binary decoder. Study multiplexers (MUX) and demultiplexers (DEMUX). Construct an RS flip-flop from discrete gates.
More informationFinal Exam review: chapter 4 and 5. Supplement 3 and 4
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationUNIVERSITY OF MASSACHUSSETS LOWELL Department of Electrical & Computer Engineering Course Syllabus for Logic Design Fall 2013
UNIVERSITY OF MASSACHUSSETS LOWELL Department of Electrical & Computer Engineering Course Syllabus for 16.265 Logic Design Fall 2013 I. General Information Section 201 Instructor: Professor Anh Tran Office
More informationCourse Plan. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs) PSO-1 PSO-2
Course Plan Semester: 4 - Semester Year: 2019 Course Title: DIGITAL ELECTRONICS Course Code: EC106 Semester End Examination: 70 Continuous Internal Evaluation: 30 Lesson Plan Author: Ms. CH SRIDEVI Last
More informationAnalogue Versus Digital [5 M]
Q.1 a. Analogue Versus Digital [5 M] There are two basic ways of representing the numerical values of the various physical quantities with which we constantly deal in our day-to-day lives. One of the ways,
More informationSUBJECT NAME : DIGITAL ELECTRONICS SUBJECT CODE : EC8392 1. State Demorgan s Theorem. QUESTION BANK PART A UNIT - I DIGITAL FUNDAMENTALS De Morgan suggested two theorems that form important part of Boolean
More informationVU Mobile Powered by S NO Group
Question No: 1 ( Marks: 1 ) - Please choose one A 8-bit serial in / parallel out shift register contains the value 8, clock signal(s) will be required to shift the value completely out of the register.
More informationSection 6.8 Synthesis of Sequential Logic Page 1 of 8
Section 6.8 Synthesis of Sequential Logic Page of 8 6.8 Synthesis of Sequential Logic Steps:. Given a description (usually in words), develop the state diagram. 2. Convert the state diagram to a next-state
More informationSequential Logic. Analysis and Synthesis. Joseph Cavahagh Santa Clara University. r & Francis. TaylonSi Francis Group. , Boca.Raton London New York \
Sequential Logic Analysis and Synthesis Joseph Cavahagh Santa Clara University r & Francis TaylonSi Francis Group, Boca.Raton London New York \ CRC is an imprint of the Taylor & Francis Group, an informa
More informationWINTER 14 EXAMINATION
Subject Code: 17320 WINTER 14 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)
More informationThe basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of
1 The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of the AND gate, you get the NAND gate etc. 2 One of the
More informationDHANALAKSHMI SRINIVASAN INSTITUTE OF RESEARCH AND TECHNOLOGY CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN. I Year/ II Sem PART-A TWO MARKS UNIT-I
DHANALAKSHMI SRINIVASAN INSTITUTE OF RESEARCH AND TECHNOLOGY CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I Year/ II Sem PART-A TWO MARKS UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES 1) What are basic properties
More informationEE6301 DIGITAL LOGIC CIRCUITS UNIT-I NUMBERING SYSTEMS AND DIGITAL LOGIC FAMILIES 1) What are basic properties of Boolean algebra? The basic properties of Boolean algebra are commutative property, associative
More informationDepartment of Electrical and Computer Engineering Mid-Term Examination Winter 2012
1 McGill University Faculty of Engineering ECSE-221B Introduction to Computer Engineering Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012 Examiner: Rola Harmouche Date:
More information1 Hour Sample Test Papers: Sample Test Paper 1. Roll No.
6.1.2 Sample Test Papers: Sample Test Paper 1 Roll No. Institute Name: Course Code: EJ/EN/ET/EX/EV/IC/IE/IS/MU/DE/ED/ET/IU Subject: Principles of Digital Techniques Marks: 25 1 Hour 1. All questions are
More informationD Latch (Transparent Latch)
D Latch (Transparent Latch) -One way to eliminate the undesirable condition of the indeterminate state in the SR latch is to ensure that inputs S and R are never equal to 1 at the same time. This is done
More informationAIM: To study and verify the truth table of logic gates
EXPERIMENT: 1- LOGIC GATES AIM: To study and verify the truth table of logic gates LEARNING OBJECTIVE: Identify various Logic gates and their output. COMPONENTS REQUIRED: KL-31001 Digital Logic Lab( Main
More informationDIGITAL CIRCUIT COMBINATORIAL LOGIC
DIGITAL CIRCUIT COMBINATORIAL LOGIC Logic levels: one zero true false high low CMOS logic levels: 1 => 0.7 V DD 0.4 V DD = noise margin 0 =< 0.3 V DD Positive logic: high = 1 = true low = 0 = false Negative
More informationWhere Are We Now? e.g., ADD $S0 $S1 $S2?? Computed by digital circuit. CSCI 402: Computer Architectures. Some basics of Logic Design (Appendix B)
Where Are We Now? Chapter 1: computer systems overview and computer performance Chapter 2: ISA (machine-spoken language), different formats, and various instructions Chapter 3: We will learn how those
More informationSequential Logic Circuits
Sequential Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch- Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has memory
More informationA.R. ENGINEERING COLLEGE, VILLUPURAM ECE DEPARTMENT
.R. ENGINEERING COLLEGE, VILLUPURM ECE EPRTMENT QUESTION BNK SUB. NME: IGITL ELECTRONICS SUB. COE: EC223 SEM: III BRNCH/YER: ECE/II UNIT-I MINIMIZTION TECHNIQUESN LOGIC GTES PRT- ) efine Minterm & Maxterm.
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) WINTER 2018 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 themodel answer scheme. 2) The model answer and the answer written by candidate may
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:
More informationUNIT IV. Sequential circuit
UNIT IV Sequential circuit Introduction In the previous session, we said that the output of a combinational circuit depends solely upon the input. The implication is that combinational circuits have no
More informationTHE KENYA POLYTECHNIC
THE KENYA POLYTECHNIC ELECTRICAL/ELECTRONICS ENGINEERING DEPARTMENT HIGHER DIPLOMA IN ELECTRICAL ENGINEERING END OF YEAR II EXAMINATIONS NOVEMBER 006 DIGITAL ELECTRONICS 3 HOURS INSTRUCTIONS TO CANDIDATES:
More informationREPEAT EXAMINATIONS 2002
REPEAT EXAMINATIONS 2002 EE101 Digital Electronics Solutions Question 1. An engine has 4 fail-safe sensors. The engine should keep running unless any of the following conditions arise: o If sensor 2 is
More informationLogic and Computer Design Fundamentals. Chapter 7. Registers and Counters
Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationSwitching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm)
Switching Circuits & Logic Design, Fall 2011 Final Examination (1/13/2012, 3:30pm~5:20pm) Problem 1: (15 points) Consider a new FF with three inputs, S, R, and T. No more than one of these inputs can be
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Digital Logic: Recap - Review: truth table => SOP => simplification - dual / complement - Minterm / Maxterm - SOP
More informationNorth Shore Community College
North Shore Community College Course Number: IEL217 Section: MAL Course Name: Digital Electronics 1 Semester: Credit: 4 Hours: Three hours of Lecture, Two hours Laboratory per week Thursdays 8:00am (See
More informationBHARATHIDASAN ENGINEERING COLLEGE, NATTRAMPALLI DEPARTMENT OF ECE
BHARATHIDASAN ENGINEERING COLLEGE, NATTRAMPALLI DEPARTMENT OF ECE CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN 1 st year 2 nd semester CSE & IT Unit wise Important Part A and Part B Prepared by L.GOPINATH
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 03 February 09, 2012 Dohn Bowden 1 Today s Lecture Registers and Counters Chapter 12 2 Course Admin 3 Administrative Admin for tonight Syllabus
More informationPage No.1. CS302 Digital Logic & Design_ Muhammad Ishfaq
Page No.1 File Version Update: (Dated: 17-May-2011) This version of file contains: Content of the Course (Done) FAQ updated version.(these must be read once because some very basic definition and question
More informationDigital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic
Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential
More informationDigital Logic Design Sequential Circuits. Dr. Basem ElHalawany
Digital Logic Design Sequential Circuits Dr. Basem ElHalawany Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs
More informationPhysics 323. Experiment # 10 - Digital Circuits
Physics 323 Experiment # 10 - Digital Circuits Purpose This is a brief introduction to digital (logic) circuits using both combinational and sequential logic. The basic building blocks will be the Transistor
More informationRS flip-flop using NOR gate
RS flip-flop using NOR gate Triggering and triggering methods Triggering : Applying train of pulses, to set or reset the memory cell is known as Triggering. Triggering methods:- There are basically two
More informationS.K.P. Engineering College, Tiruvannamalai UNIT I
UNIT I NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES Part - A Questions 1. Convert the hexadecimal number E3FA to binary.( Nov 2007) E3FA 16 Hexadecimal E 3 F A 11102 00112 11112 10102 So the equivalent binary
More informationFor Teacher's Use Only Q Total No. Marks. Q No Q No Q No
FINALTERM EXAMINATION Spring 2010 CS302- Digital Logic Design (Session - 4) Time: 90 min Marks: 58 For Teacher's Use Only Q 1 2 3 4 5 6 7 8 Total No. Marks Q No. 9 10 11 12 13 14 15 16 Marks Q No. 17 18
More information1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.
[Question 1 is compulsory] 1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. Figure 1.1 b) Minimize the following Boolean functions:
More informationIn this chapter, you will...
In this chapter, you will... Master Boolean algebra. Learn about different types of logic. Discover logic symbols and circuits. Try your hand at logic design. Understand sequential logic circuits. Up until
More informationLogic Design Viva Question Bank Compiled By Channveer Patil
Logic Design Viva Question Bank Compiled By Channveer Patil Title of the Practical: Verify the truth table of logic gates AND, OR, NOT, NAND and NOR gates/ Design Basic Gates Using NAND/NOR gates. Q.1
More informationCS 151 Final. Instructions: Student ID. (Last Name) (First Name) Signature
CS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 19 pages including this cover. 2. Write down your Student-Id on the top of
More informationFlip-Flops and Sequential Circuit Design
Flip-Flops and Sequential Circuit Design ECE 52 Summer 29 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6
More information