DIGITAL LOGIC CIRCUITS
|
|
- Stuart Cunningham
- 7 years ago
- Views:
Transcription
1 University of Ottawa - School of Information Technology - SITE Sensing and Modelling Research Laboratory SMRLab - Prof.. Emil M. Petriu DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers, watches, controllers, telephones, cameras,... Number.in whatever base Decimal value of the given number Decimal:,998 = x 3 +9x 2 +9x +8x =, =,998 Binary: = x2 +x2 9 +x2 8 +x2 7 +x2 6 +x2 3 +x2 2 +x2 =, =,998
2 Powers of 2 N 2 N Comments ,24 Kilo as 2 is the closest power of 2 to, (decimal) 2, , Hz often used as clock crystal frequency in digital watches... 2,48,576 Mega as 2 2 is the closest power of 2 to,, (decimal)... 3,73,74,824 Giga as 2 3 is the closest power of 2 to,,,(decimal)
3 Negative Powers of 2 N < 2 N = = = = = = = = = = Binary Binary numbers less than Decimal value = x2 - +x2-3 + x2-4 + x2-6 =.7325
4 HEXADECIMAL Binary: <== Decimal Hexadecimal: 7CE = 7x6 2 +2x6 +4x6 = Binary Decimal Hexadecimal A B 2 C 3 D 4 E 5 F
5 LOGIC OPERATIONS AND TRUTH TABLES Digital logic circuits handle data encoded in binary form, i.e. signals that have only two values, and. Binary logic dealing with true and false comes in handy to describe the behaviour of these circuits: is usually associated with false and with true. uite complex digital logic circuits (e.g. entire computers) can be built using a few types of basic circuits called gates, each performing a single elementary logic operation : NOT, AND, OR, NAND, NOR, etc.. Boole s binary algebra is used as a formal / mathematical tool to describe and design complex binary logic circuits.
6 GATES A A NOT A F =A A B A. B A B AND F =A. B A B A + B A B OR F = A + B
7 more GATES A B A. B A B NAND F =A. B A B A + B A B NOR F = A + B
8 and more GATES A B A B A B XOR F = A B A B A B A B EU or XNOR F = A B
9 GATES with more inputs EXAMPLES OF GATES WITH THREE INPUTS A B C A. B. C A+B+C A. B. C A+B+C A B C A B C AND OR F =A. B. C F = A+B+C A B C NAND F =A. B. C A B C NOR F = A+B+C
10 Logic Gate Array that Produces an Arbitrarily Chosen Output A B C F A B C F = A. B. C + A. B. C + A. B. C A. B. C A. B. C A. B. C + A. B. C F A. B. C A B C A B C Sum-of-products form of the logic circuit.
11 BOOLEAN ALGEBRA AND rules A. A = A A. A =. A =. A = A A. B = B. A A. (B. C) = (A. B). C A. (B + C) = A. B + A. C A. B = A + B Proof : A B C A. (B+C) A. B+A. C
12 BOOLEAN ALGEBRA continued OR rules A + A = A A + A = + A = A + A = A + B = B + A A +(B + C) = (A + B) + C A + B. C = (A + B). (A +C) A B C A + B. C (A+B). (A+C) A + B = A. B
13 DeMorgan s Theorem A. B = A + B A + B = A. B A B A. B A + B A + B A. B
14 Simplifying logic functions using Boolean algebra rules A B C Sum-of-products form of the logic function: F =ABC + ABC + ABC + ABC A. B. C A. B. C A. B. C F A. B. C A B C A B C
15 Simplifying logic functions using Boolean algebra rules continued F = ABC + ABC + ABC + ABC F = (ABC + ABC) + (ABC + ABC) F = A(BC + BC) + A ( BC + BC) A B C F = AB( C + C) + AC ( B + B) F = AB + AC A. B F A. C A A
16 Simplifying logic functions using Karnaugh maps Karnaugh map => graphical representation of a truth table for a logic function. Each line in the truth table corresponds to a square in the Karnaugh map. The Karnaugh map squares are labeled so that horizontally or vertically adjacent squares differ only in one variable. (Each square in the top row is considered to be adjacent to a corresponding square in the bottom row. Each square in the left most column is considered to be adjacent to a corresponding square in the right most column.) Karnaugh map A B C F ()... ()... (2)... (3)... (4)... (5)... (6)... (7)... A B C
17 Simplifying logic functions of 4 variables using Karnaugh maps A B C D F ()... ()... (2)... (3)... (4)... (5)... (6)... (7) (8) (9) () () (2) (3) (4) (5)... A B C D
18 Simplifying logic functions using Karnaugh maps looping The logic expressions for an output can be simplified by properly combining squares (looping) in the Karnaugh maps which contain s. Looping a pair of adjacent s eliminates the variable that appears in both direct and complemented form. A B C F A B () () (2) (3) (4) (5) (6) (7) C AB AC F = AB + AC
19 Simplifying logic functions using Karnaugh maps more looping A B C D F () () (2) (3) (4) (5) (6) (7) (8) (9) () () (2) (3) (4) (5) A B C D Looping a quad of adjacent s eliminates the two variables that appears in both direct and complemented form. F = A B D + AB + BD A B D AB BD
20 DeMorgan s Theorem Equivalent Gate Symbols A. B = A + B A B A. B = A B A+B A + B = A. B A B A+B = A B A. B
21 NAND gate implementation of the sum-of-product logic functions F = AB + AC A B C X = ( X ) NAND gates are faster than ANDs and ORs in most technologies A B C F A F A A
22 ADDING BINARY NUMBERS Inputs A B Adding two bits: Truth table Outputs Carry Sum Sum = A + B + + A B Half-Adder circuit + Carry (over) + Sum The binary number is equivalent to the decimal 2 Sum Carry Carry = A. B
23 Adding multi-bit numbers: 8 D + 9 D 98 D + Sum A 7 A 6 A 5 A 4 A 3 A 2 A A + B 7 B 6 B 5 B 4 B 3 B 2 B B S 7 S 6 S 5 S 4 S 3 S 2 S S Carry Carry Out A 7 B 7 A 6 B 6 A 5 B 5 A 4 B 4 A 3 B 3 A 2 B 2 A B A B A B A B A B A B A B A B CO CI CO CI CO CI CO CI CO CI CO CI S S S S S S A B A B CO CI CO CI S S Carry In = S 7 S 6 S 5 S 4 S 3 S 2 S S
24 Full Adder Carry Out Bits of the same rank of the two numbers A B CO CI S Sum Carry In Inputs Outputs A B CI CO S A B CI A B CI S CO A. B S = A. B. CI + A. B. CI + A. B. CI + A. B. CI C = A. B + B. CI + A. CI B. CI A. CI
25 HEX-TO-7 SEGMENT DECODER This examples illustrates how a practical problem is analyzed in order to generate truth tables,and then how truth table-defined functions are mapped on Karnaugh maps. B3 B2 B B () () (2) (3) (4) (5) (6) (7) (8) (9) (A) (B) (C) (D) (E) (F) Four-bit machine representation of the hex digits S6 S5 S3 S2 S HEX S6 S5 S S2 S3 7 SEGMENT B3 B2 B B 7-segment display to allow the user see the natural representation of the hex digits. Binary outputs; when such a signal is = then the corresponding segment in the 7-segment display is on (you see it), when the signal is = then the segment is off (you can t see it). The four-bit representation of the hex digits Natural (i.e.as humans write) representation of the hex digits.
26 B3 B2 B B () () (2) (3) (4) (5) (6) (7) (8) (9) (A) (B) (C) (D) (E) (F) S S S S S S6 S2 S6 S2 S6 S2 S6 S2 S6 S2 S5 S3 S5 S3 S5 S3 S5 S3 S5 S3 S S S S S S6 S2 S6 S2 S6 S2 S6 S2 S6 S2 S5 S3 S5 S3 S5 S3 S5 S3 S5 S3 S S S S S S6 S2 S6 S2 S6 S2 S6 S2 S6 S2 S5 S3 S5 S3 S5 S3 S5 S3 S5 S3 S We are developing ad-hoc binary-hex logic expressions used just for our convenience in the problem analysis process. Each expression will enumerate only those hex digits when the specific display-segment is on : S = A+C+E+F S2 = A+D S3 = A+B+D = B+C+D+E S5 = A+B+C+D+E+F S6 = A+B+C+E+F = A+B+D+E+F S6 S2 S5 S3
27 Hex-to-7 segment B3 B2 B B () () (2) (3) (4) (5) (6) (7) (8) (9) (A) (B) (C) (D) (E) (F) S = A+C+E+F S2 = A+D S3 = A+B+D = B+C+D+E S5 = A+B+C+D+E+F S6 = A+B+C+E+F = A+B+D+E+F B3 B2 B B As we are using ad-hoc binary-hex logic equations, (i.e. binary S outputs as functions of hex variables) it will useful in this case to have hex-labeled Karnaugh map, instead of the usual 2-D (i.e. two dimensional) binary labeled K maps. This will allow for a more convenient mapping of the binary-hex logic equations onto the K-maps. 4 C 8 5 D F B 2 6 E A
28 Hex-to-7 segment B3 B2 S B3 B2 S2 Mapping the ad-hoc binary-hex logic equations onto Karnaugh maps: B B B B B3 B2 B B 4 C 8 5 D F B B3 B2 S3 B3 B2 2 6 E A B B B B S = A+C+E+F S2 = A+D S3 = A+B+D = B+C+D+E
29 Hex-to-7 segment B3 B2 S5 B3 B2 S6 B3 B2 B B 4 C 8 5 D F B 2 6 E A B B B3 B2 B B S5 = A+B+C+D+E+F S6 = A+B+C+E+F = A+B+D+E+F B B
30 SYSTEMS of LOGIC FUNCTIONS 2- bit Comparator A A B B F F 2 F 3 () () (2) (3) (4) (5) (6) (7) (8) (9) () () (2) (3) (4) (5) Compare two 2-bit numbers: A=B F = Σ (,5,,5) A>B F 2 = Σ (4,8,9,2,3,4) A<B F 3 = Σ (,2,3,6,7,)
31 2- bit Comparator A=B F = Σ (,5,,5) A A B B AA BB F = when both numbers, A and B, are equal which happens when all their bits of the same order are identical, i.e. A = B AND A = B F = (A B) (A B)
32 2- bit Comparator A<B F 3 = Σ (,2,3,6,7,) A A B B AA BB F3 = ABB + AB + AAB
33 2- bit Comparator A A A>B F 2 = Σ (4,8,9,2,3,4) AA BB B B F2 = F + F3 AA BB F +F 3 AA BB F AA BB F 3
34 2- bit Comparator F = (A B) (A B) F2 = F + F3 B B A A F3 = ABB+AB+AAB A B F = (A B) (A B) A B F2 = F + F3 F3 = ABB+AB+AAB
35 3-to-8 Decoder A B C F A B C F F F2 F3 F4 F5F6 F7 () () (2) (3) (4) (5) (6) (7) F F2 F3 F4 F5 F6 F7
36 3-to-8 Decoder (74 38) E A B C F A B C E F F F2 F3 F4 F5 F6 F7 (x) x x x () () (2) (3) (4) (5) (6) (7) F F2 F3 F4 F5 F6 F7
37 BCD-TO-7 SEGMENT DECODER S S6 S2 S5 S3 S6 S5 S3 S2 S 7 SEGMENT BCD B3 B2 B B B3 B2 B B () () (2) (3) (4) (5) (6) (7) (8) (9) (x) (x) (x) (x) (x) (x) B3 B2 B B 4 x 8 5 x x x 2 6 x x Don t Care states/situations. As it is expected that these states are never going to occur, then we may just as well use them as fill-in s in a Karnaugh map if this helps to make larger loopings
38 BCD-to-7 segment S S S S S B3 B2 B B () () (2) (3) (4) (5) (6) (7) (8) (9) (x) (x) (x) (x) (x) (x) S6 S5 S6 S5 S2 S3 S6 S5 S2 S3 S S S2 S6 S2 S3 S5 S3 S = S2 = S3 = S6 S5 S6 S5 S S2 S3 S2 S3 S6 S2 S6 S5 S3 S5 S S S6 S2 S6 S5 S3 S5 = S5 = S6 = = S2 S3 S2 S3
39 BCD-to-7 segment S = B3 B2 B B S x x x x x S = B3 + B2B + B x B3 B2 B B 4 x 8 5 x x x 2 6 x x B3 B2 B B S2 = S2 x x x x x x + B2B + B2B S2 = B3 + B2 + BB + BB
40 BCD-to-7 segment B3 B2 B B 4 x 8 5 x 9 S3 = x x 2 6 x x = B3 B2 S3 B3 B2 B B x x x x x x B B x x x x x x S3 = B3 + BB + B + B2 = B3 + B2B + B2B + B2BB + BB
41 B3 B2 B B BCD-to-7 segment S5 = B3 B2 B B 4 x 8 5 x x x 2 6 x x S5 x S6 = B3 B2 B B S6 x = B3 B2 B B = B3 + x x x x x x B2B x x x x x x + BB2 + BB x x x x S5 = + B2B BB S6 = B3 + BB + BB2 + B2B
42 MEMORY ELEMENTS: LATCHES AND FLIP-FLOPS R-S Latch (Reset-Set) S = = I I2 S F I I2 F = = S R R = = R = = S R S = = S = = Weird state Set state Reset state Hold state R = = R = =
43 D (Transparent) Latch D S Enable D x Enable R Enable D S R S R When the Enable input is = (i.e. TRUE or HIGH) the information present at the D input is stored in the latch and will appear as it is at the output ( => it is like that there is a transparent path from the D input to the output)
44 D Latch D S Enable D S R Enable R Enable D S R Hold Hold state Transparent state Hold state
45 Latch Latch 2 Synchronous D Flip-Flop D CLK D Enab. EN D EN2 D Enab. Positive-Edge -Triggered D Flip-Flop D CLK D CLK EN D EN2 Din* Latch is Transparent D = Din* Latch 2 is Holding Input data D may change Latch is Holding Latch 2 is Transparent = D = Din* Latch is Transparent Changed input data D enter Latch Latch 2 is Holding The state of the flip-flop s output copies input D when the positive edge of the clock CLK occurs Positive-Edge-Triggered D Flip-Flop
46 Synchronous D Flip-Flop Vcc CLR2 D2 CLK2 PR Connection diagram of the 7474 Dual Positive-Edge-Triggered D Flip-Flops with Preset and Clear CLR D CLK PR GND
47 COUNTERS 4-Bit Synchronous Counter using D Flip-Flops Bit BINARY COUNTER 5 CL 6 CK CL = Σ i. 2i i = CK CL
48 DECIMAL BINARY STATE OF FLIP FLOP INPUTS STATE THE COUNTER (for the next state) 3 2 D3 D2 D D Using D flip-flops has the distinct advantage of a straightforward definition of the flip-flop inputs: the current state of these inputs is the next state of the counter. The logic equations for all four flip-flop inputs D3, D2, D, and D are derived from this truth table as functions of the current states of the counter s flip-flops: 3, 2,, and Karnaugh maps can be used to simplify these equations. 3 2 Synchronous 4-bit Counter D3 3 2 D2 3 2 D 3 2 D
49 Synchronous 4-bit Counter 3 2 D3 3 2 D2 D3 = D2 = D D = D D =
50 Synchronous 4-bit Counter CL CK D CLK R D = D =. +. D2 = D CLK R D3 = D 2 CLK R 2 D 3 CLK R 3
Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction
More informationLecture 8: Synchronous Digital Systems
Lecture 8: Synchronous Digital Systems The distinguishing feature of a synchronous digital system is that the circuit only changes in response to a system clock. For example, consider the edge triggered
More informationDigital Electronics Detailed Outline
Digital Electronics Detailed Outline Unit 1: Fundamentals of Analog and Digital Electronics (32 Total Days) Lesson 1.1: Foundations and the Board Game Counter (9 days) 1. Safety is an important concept
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationKarnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012
Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology
More informationLesson 12 Sequential Circuits: Flip-Flops
Lesson 12 Sequential Circuits: Flip-Flops 1. Overview of a Synchronous Sequential Circuit We saw from last lesson that the level sensitive latches could cause instability in a sequential system. This instability
More informationUpon completion of unit 1.1, students will be able to
Upon completion of unit 1.1, students will be able to 1. Demonstrate safety of the individual, class, and overall environment of the classroom/laboratory, and understand that electricity, even at the nominal
More informationCHAPTER 3 Boolean Algebra and Digital Logic
CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4
More informationHaving read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.
Objectives Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. describe how such a flip-flop can be SET and RESET. describe the disadvantage
More informationMemory Elements. Combinational logic cannot remember
Memory Elements Combinational logic cannot remember Output logic values are function of inputs only Feedback is needed to be able to remember a logic value Memory elements are needed in most digital logic
More informationExperiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa
Experiment # 9 Clock generator circuits & Counters Eng. Waleed Y. Mousa 1. Objectives: 1. Understanding the principles and construction of Clock generator. 2. To be familiar with clock pulse generation
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 informationDEPARTMENT OF INFORMATION TECHNLOGY
DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453
More informationCounters are sequential circuits which "count" through a specific state sequence.
Counters Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences. Two distinct types are in common usage:
More informationLecture-3 MEMORY: Development of Memory:
Lecture-3 MEMORY: It is a storage device. It stores program data and the results. There are two kind of memories; semiconductor memories & magnetic memories. Semiconductor memories are faster, smaller,
More informationLecture 5: Gate Logic Logic Optimization
Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim
More information2.0 Chapter Overview. 2.1 Boolean Algebra
Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits
Objectives ELEC - EXPERIMENT Basic Digital Logic Circuits The experiments in this laboratory exercise will provide an introduction to digital electronic circuits. You will learn how to use the IDL-00 Bit
More informationModule 3: Floyd, Digital Fundamental
Module 3: Lecturer : Yongsheng Gao Room : Tech - 3.25 Email : yongsheng.gao@griffith.edu.au Structure : 6 lectures 1 Tutorial Assessment: 1 Laboratory (5%) 1 Test (20%) Textbook : Floyd, Digital Fundamental
More informationBINARY CODED DECIMAL: B.C.D.
BINARY CODED DECIMAL: B.C.D. ANOTHER METHOD TO REPRESENT DECIMAL NUMBERS USEFUL BECAUSE MANY DIGITAL DEVICES PROCESS + DISPLAY NUMBERS IN TENS IN BCD EACH NUMBER IS DEFINED BY A BINARY CODE OF 4 BITS.
More informationAsynchronous Counters. Asynchronous Counters
Counters and State Machine Design November 25 Asynchronous Counters ENGI 25 ELEC 24 Asynchronous Counters The term Asynchronous refers to events that do not occur at the same time With respect to counter
More informationThe components. E3: Digital electronics. Goals:
E3: Digital electronics Goals: Basic understanding of logic circuits. Become familiar with the most common digital components and their use. Equipment: 1 st. LED bridge 1 st. 7-segment display. 2 st. IC
More informationBOOLEAN ALGEBRA & LOGIC GATES
BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic
More informationEngr354: Digital Logic Circuits
Engr354: igital Circuits Chapter 7 Sequential Elements r. Curtis Nelson Sequential Elements In this chapter you will learn about: circuits that can store information; Basic cells, latches, and flip-flops;
More informationDigital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell
Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates
More informationDigital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill
Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.
More informationUnited States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1
United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.
More informationDesign Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:
Design Eample: ers er: a sequential circuit that repeats a specified sequence of output upon clock pulses. A,B,C,, Z. G, O, T, E, R, P, S,!.,,,,,,,7. 7,,,,,,,.,,,,,,,,,,,. Binary counter: follows the binary
More informationGates, Circuits, and Boolean Algebra
Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks
More informationETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies
ETEC 2301 Programmable Logic Devices Chapter 10 Counters Shawnee State University Department of Industrial and Engineering Technologies Copyright 2007 by Janna B. Gallaher Asynchronous Counter Operation
More informationCounters and Decoders
Physics 3330 Experiment #10 Fall 1999 Purpose Counters and Decoders In this experiment, you will design and construct a 4-bit ripple-through decade counter with a decimal read-out display. Such a counter
More informationCombinational Logic Design Process
Combinational Logic Design Process Create truth table from specification Generate K-maps & obtain logic equations Draw logic diagram (sharing common gates) Simulate circuit for design verification Debug
More informationDecimal Number (base 10) Binary Number (base 2)
LECTURE 5. BINARY COUNTER Before starting with counters there is some vital information that needs to be understood. The most important is the fact that since the outputs of a digital chip can only be
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationEE360: Digital Design I Course Syllabus
: Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential
More informationTo design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC.
8.1 Objectives To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC. 8.2 Introduction Circuits for counting events are frequently used in computers and other digital
More informationSequential Logic Design Principles.Latches and Flip-Flops
Sequential Logic Design Principles.Latches and Flip-Flops Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Bistable Elements Latches and Flip-Flops S-R Latch
More informationChapter 5. Sequential Logic
Chapter 5 Sequential Logic Sequential Circuits (/2) Combinational circuits: a. contain no memory elements b. the outputs depends on the current inputs Sequential circuits: a feedback path outputs depends
More informationLatches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012
Latches, the D Flip-Flop & Counter Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7. Basic Latch 7.2 Gated SR Latch 7.2. Gated SR
More informationChapter 9 Latches, Flip-Flops, and Timers
ETEC 23 Programmable Logic Devices Chapter 9 Latches, Flip-Flops, and Timers Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Latches A temporary
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/20 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 informationCHAPTER 11 LATCHES AND FLIP-FLOPS
CHAPTER 11 LATCHES AND FLIP-FLOPS This chapter in the book includes: Objectives Study Guide 11.1 Introduction 11.2 Set-Reset Latch 11.3 Gated D Latch 11.4 Edge-Triggered D Flip-Flop 11.5 S-R Flip-Flop
More informationFigure 8-1 Four Possible Results of Adding Two Bits
CHPTER EIGHT Combinational Logic pplications Thus far, our discussion has focused on the theoretical design issues of computer systems. We have not yet addressed any of the actual hardware you might find
More informationRUTGERS UNIVERSITY Department of Electrical and Computer Engineering 14:332:233 DIGITAL LOGIC DESIGN LABORATORY
RUTGERS UNIVERSITY Department of Electrical and Computer Engineering 14:332:233 DIGITAL LOGIC DESIGN LABORATORY Fall 2012 Contents 1 LABORATORY No 1 3 11 Equipment 3 12 Protoboard 4 13 The Input-Control/Output-Display
More informationFlip-Flops and Sequential Circuit Design. ECE 152A Winter 2012
Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 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 informationFlip-Flops and Sequential Circuit Design
Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 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 informationUnit 3 Boolean Algebra (Continued)
Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication
More informationANALOG & DIGITAL ELECTRONICS
ANALOG & DIGITAL ELECTRONICS Course Instructor: Course No: PH-218 3-1-0-8 Dr. A.P. Vajpeyi E-mail: apvajpeyi@iitg.ernet.in Room No: #305 Department of Physics, Indian Institute of Technology Guwahati,
More informationSequential Logic. (Materials taken from: Principles of Computer Hardware by Alan Clements )
Sequential Logic (Materials taken from: Principles of Computer Hardware by Alan Clements ) Sequential vs. Combinational Circuits Combinatorial circuits: their outputs are computed entirely from their present
More informationList of Experiment. 8. To study and verify the BCD to Seven Segments DECODER.(IC-7447).
G. H. RAISONI COLLEGE OF ENGINEERING, NAGPUR Department of Electronics & Communication Engineering Branch:-4 th Semester[Electronics] Subject: - Digital Circuits List of Experiment Sr. Name Of Experiment
More informationECE380 Digital Logic
ECE38 igital Logic Flip-Flops, Registers and Counters: Flip-Flops r.. J. Jackson Lecture 25- Flip-flops The gated latch circuits presented are level sensitive and can change states more than once during
More informationDigital Logic Design Sequential circuits
Digital Logic Design Sequential circuits Dr. Eng. Ahmed H. Madian E-mail: ahmed.madian@guc.edu.eg Dr. Eng. Rania.Swief E-mail: rania.swief@guc.edu.eg Dr. Eng. Ahmed H. Madian Registers An n-bit register
More informationSECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks
UNIVERSITY OF KERALA First Degree Programme in Computer Applications Model Question Paper Semester I Course Code- CP 1121 Introduction to Computer Science TIME : 3 hrs Maximum Mark: 80 SECTION A [Very
More informationCounters. Present State Next State A B A B 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0
ounter ounters ounters are a specific type of sequential circuit. Like registers, the state, or the flip-flop values themselves, serves as the output. The output value increases by one on each clock cycle.
More informationCSE140: Components and Design Techniques for Digital Systems
CE4: Components and esign Techniques for igital ystems Tajana imunic osing ources: Where we are now What we ve covered so far (Chap -5, App. A& B) Number representations Boolean algebra OP and PO Logic
More informationCSE140: Components and Design Techniques for Digital Systems
CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned
More informationDigital Fundamentals. Lab 8 Asynchronous Counter Applications
Richland College Engineering Technology Rev. 0 B. Donham Rev. 1 (7/2003). Horne Rev. 2 (1/2008). Bradbury Digital Fundamentals CETT 1425 Lab 8 Asynchronous Counter Applications Name: Date: Objectives:
More informationDesigning Digital Circuits a modern approach. Jonathan Turner
Designing Digital Circuits a modern approach Jonathan Turner 2 Contents I First Half 5 1 Introduction to Designing Digital Circuits 7 1.1 Getting Started.......................... 7 1.2 Gates and Flip
More informationCS311 Lecture: Sequential Circuits
CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationEXPERIMENT 8. Flip-Flops and Sequential Circuits
EXPERIMENT 8. Flip-Flops and Sequential Circuits I. Introduction I.a. Objectives The objective of this experiment is to become familiar with the basic operational principles of flip-flops and counters.
More informationSistemas Digitais I LESI - 2º ano
Sistemas Digitais I LESI - 2º ano Lesson 6 - Combinational Design Practices Prof. João Miguel Fernandes (miguel@di.uminho.pt) Dept. Informática UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA - PLDs (1) - The
More informationDIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 2. LECTURE: ELEMENTARY SEUENTIAL CIRCUITS: FLIP-FLOPS 1st year BSc course 2nd (Spring) term 2012/2013 1
More informationDesign and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course
Session ENG 206-6 Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course Nikunja Swain, Ph.D., PE South Carolina State University swain@scsu.edu Raghu Korrapati,
More informationFlip-Flops, Registers, Counters, and a Simple Processor
June 8, 22 5:56 vra235_ch7 Sheet number Page number 349 black chapter 7 Flip-Flops, Registers, Counters, and a Simple Processor 7. Ng f3, h7 h6 349 June 8, 22 5:56 vra235_ch7 Sheet number 2 Page number
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. Lab 2. The Full-Adder
FORDHAM UNIVERSITY CISC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. Science Spring, 2011 Lab 2 The Full-Adder 1 Introduction In this lab, the student will construct
More informationModeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw. Sequential Circuit
Modeling Sequential Elements with Verilog Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw 4-1 Sequential Circuit Outputs are functions of inputs and present states of storage elements
More informationA single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc
Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc
More informationKarnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation
Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated
More informationDIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department
Counters By: Electrical Engineering Department 1 Counters Upon completion of the chapter, students should be able to:.1 Understand the basic concepts of asynchronous counter and synchronous counters, and
More informationChapter 1: Digital Systems and Binary Numbers
Chapter 1: Digital Systems and Binary Numbers Digital age and information age Digital computers general purposes many scientific, industrial and commercial applications Digital systems telephone switching
More informationChapter 7 Memory and Programmable Logic
NCNU_2013_DD_7_1 Chapter 7 Memory and Programmable Logic 71I 7.1 Introduction ti 7.2 Random Access Memory 7.3 Memory Decoding 7.5 Read Only Memory 7.6 Programmable Logic Array 77P 7.7 Programmable Array
More informationDESIGN OF GATE NETWORKS
DESIGN OF GATE NETWORKS DESIGN OF TWO-LEVEL NETWORKS: and-or and or-and NETWORKS MINIMAL TWO-LEVEL NETWORKS KARNAUGH MAPS MINIMIZATION PROCEDURE AND TOOLS LIMITATIONS OF TWO-LEVEL NETWORKS DESIGN OF TWO-LEVEL
More information(1) /30 (2) /30 (3) /40 TOTAL /100
Your Name: SI Number: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY AVIS IRVINE LOS ANGELES RIVERSIE SAN IEGO SAN FRANCISCO epartment of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA
More informationSo far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.
equential Logic o far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs. In sequential logic the output of the
More informationLogic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
More informationSEQUENTIAL CIRCUITS. Block diagram. Flip Flop. S-R Flip Flop. Block Diagram. Circuit Diagram
SEQUENTIAL CIRCUITS http://www.tutorialspoint.com/computer_logical_organization/sequential_circuits.htm Copyright tutorialspoint.com The combinational circuit does not use any memory. Hence the previous
More informationLab 1: Study of Gates & Flip-flops
1.1 Aim Lab 1: Study of Gates & Flip-flops To familiarize with circuit implementations using ICs and test the behavior of different logic gates and Flip-flops. 1.2 Hardware Requirement a. Equipments -
More informationTwo-level logic using NAND gates
CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place
More informationA Digital Timer Implementation using 7 Segment Displays
A Digital Timer Implementation using 7 Segment Displays Group Members: Tiffany Sham u2548168 Michael Couchman u4111670 Simon Oseineks u2566139 Caitlyn Young u4233209 Subject: ENGN3227 - Analogue Electronics
More informationCombinational circuits
Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (High-level view)
More informationexclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576
exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking
More informationDigital Systems Laboratory
Eskişehir Osmangazi University Digital Systems Laboratory Rev 3.01 February 2011 LIST OF EXPERIMENTS 1. BINARY AND DECIMAL NUMBERS 2. DIGITAL LOGIC GATES 3. INTRODUCTION TO LOGICWORKS 4. BOOLEAN ALGEBRA
More informationChapter 8. Sequential Circuits for Registers and Counters
Chapter 8 Sequential Circuits for Registers and Counters Lesson 3 COUNTERS Ch16L3- "Digital Principles and Design", Raj Kamal, Pearson Education, 2006 2 Outline Counters T-FF Basic Counting element State
More informationKarnaugh Maps (K-map) Alternate representation of a truth table
Karnaugh Maps (K-map) lternate representation of a truth table Red decimal = minterm value Note that is the MS for this minterm numbering djacent squares have distance = 1 Valuable tool for logic minimization
More informationBoolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010
Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an
More informationOperating Manual Ver.1.1
4 Bit Binary Ripple Counter (Up-Down Counter) Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94-101, Electronic Complex Pardesipura, Indore- 452010, India Tel : 91-731- 2570301/02, 4211100 Fax: 91-731-
More informationDATA SHEETS DE COMPONENTES DA FAMÍLIA LÓGICA TTL GATES AND INVERTERS POSITIVES NAND GATES AND INVERTERS DESCRIÇÃO
GATES AND INVERTERS POSITIVES NAND GATES AND INVERTERS Hex Invertes 74LS04 Quadruple 2 Inputs Gates 74LS00 Triple 3 Inputs Gates 74LS10 Dual 4 Inputs Gates 74LS20 8 Inputs Gates 74LS30 13 Inputs Gates
More informationChapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language
Chapter 4 Register Transfer and Microoperations Section 4.1 Register Transfer Language Digital systems are composed of modules that are constructed from digital components, such as registers, decoders,
More informationCopyright Peter R. Rony 2009. All rights reserved.
Experiment No. 1. THE DIGI DESIGNER Experiment 1-1. Socket Connections on the Digi Designer Experiment No. 2. LOGIC LEVELS AND THE 7400 QUADRUPLE 2-INPUT POSITIVE NAND GATE Experiment 2-1. Truth Table
More informationLayout of Multiple Cells
Layout of Multiple Cells Beyond the primitive tier primitives add instances of primitives add additional transistors if necessary add substrate/well contacts (plugs) add additional polygons where needed
More informationComputer Engineering 290. Digital Design: I. Lecture Notes Summer 2002
Computer Engineering 290 Digital Design: I Lecture Notes Summer 2002 W.D. Little Dept. of Electrical and Computer Engineering University of Victoria 1 Preface These lecture notes complement the material
More information3.Basic Gate Combinations
3.Basic Gate Combinations 3.1 TTL NAND Gate In logic circuits transistors play the role of switches. For those in the TTL gate the conducting state (on) occurs when the baseemmiter signal is high, and
More informationElectronics Merit Badge Class 3. 1/30/2014 Electronics Merit Badge Class 3 1
Electronics Merit Badge Class 3 1/30/2014 Electronics Merit Badge Class 3 1 Decimal Base 10 In base 10, there are 10 unique digits (0-9). When writing large numbers (more that 1 digit), each column represents
More informationLogic Reference Guide
Logic eference Guide Advanced Micro evices INTOUCTION Throughout this data book and design guide we have assumed that you have a good working knowledge of logic. Unfortunately, there always comes a time
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationDIGITAL COUNTERS. Q B Q A = 00 initially. Q B Q A = 01 after the first clock pulse.
DIGITAL COUNTERS http://www.tutorialspoint.com/computer_logical_organization/digital_counters.htm Copyright tutorialspoint.com Counter is a sequential circuit. A digital circuit which is used for a counting
More informationCSE140: Midterm 1 Solution and Rubric
CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms
More informationCSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps
CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms
More information