Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
|
|
- Rosemary Stephens
- 6 years ago
- Views:
Transcription
1 Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there are two permitted values: v(t) DIGITAL t t 28/02/ /02/ In real life The digital advantage A digital signal takes time to change from one value to another, and assumes intermediate values during transition Steady values are slightly inaccurate Voltages within certain ranges are guaranteed to be interpreted as certain permitted values (green regions) v(t) V s 0 (V s = supply voltage) Interpreted as HIGH AMBIGUOUS Interpreted as LOW A digital signal transition t Because voltages within a certain range are interpreted as a single value, a digital signal can contain a certain amount of error (eg distortion, noise, interference) and still be read correctly As long as we regenerate the signal (read it and reconstruct it with electronic circuits) before the error becomes too large, we can remove the error In an analog signal, we cannot tell whether the value is affected by error, because all values are permitted Digital signals can be copied, transmitted and processed without error Analog signals cannot 28/02/ /02/2006 4
2 Combinational vs Sequential Notation; Truth Tables (2) Digital circuits may be classified as combinational or sequential In a combinational circuit, the present outputs depend only on present inputs (subject to reaction times) In a sequential circuit, the present outputs may also depend on past outputs and inputs Sequential circuits usually contain combinational subcircuits The two classes of circuits have different topologies Sequential circuits contain feedback paths from the outputs to the inputs, while combinational circuits do not The values TRUE and FALSE may also be called 1 and 0, IN and OUT, ES and NO, SET and CLEAR, ON and OFF, MARK and SPACE The truth tables have been rewritten using 1 and 0 NOT : OR AND /02/ /02/ Logic gates: OR, AND, NOT Inversion bubbles, NAND & NOR If TRUE and FALSE (or 1 and 0) are represented by two different voltages, we can perform logical operations using circuits called logic gates An OR gate performs the OR (+) operation Its circuit symbol is: Z = + An AND gate performs the AND () operation Its circuit symbol is: Z = A NOT gate or inverter performs the NOT operation; its circuit symbol is: Z = The circle in the NOT gate symbol is called an inversion bubble A bubble on the output (or input) of another symbol indicates inversion; eg: means Z = In fact, an AND gate with output inversion is called a NAND gate ( Not AND ) Similarly, an OR gate with inverted output is called a NOR gate ( Not OR ) Z = () Z = (+) 28/02/ /02/2006 8
3 NAND and NOR truth tables De Morgan s laws (1) By inverting the output columns of the AND and OR truth tables, we obtain the following: NOR NAND (+) () For the NOR, the output is false iff (if and only if) either input is true; that is, the output is true iff both inputs are false For the NAND, the output is false iff both inputs are true; that is, the output is true iff either input is false In other words In a NOR gate, the output is TRUE iff the inverses of both inputs are TRUE; that is, a NOR gate performs and AND operation on the inverses So there are two symbols for a NOR gate: In a NAND gate, the output is TRUE iff the inverse of either input is TRUE; that is, a NAND gate does an OR operation on the inverses So there are two symbols for a NAND gate: 28/02/ /02/ De Morgan s laws (2) The Exclusive-OR (OR) operation If we convert the two NOR symbols into algebraic expressions and equate them, we get (+) = Doing likewise with the NAND symbols, we get () = + These equations are called De Morgan s laws If they are not already obvious, try expressing them in words: Not ( or ) = neither nor = (not ) and (not ) Not ( and ) = not both and = (not ) or (not ) Now omit the middle expressions The OR function in logic is inclusive; or means or or both The exclusive-or function, as its name suggests, excludes the or both option: xor means or but not both In equations, xor is often written The truth table is xor and the gate symbol is xor 28/02/ /02/
4 Exclusive-NOR/equivalence gate AND-OR formulation of OR Inverting the output of an OR gate gives an exclusive-nor (NOR) or equivalence gate NOR truth table: ( xor ) NOR gate symbol: ( xor ) The truth table shows why the NOR gate is called an equivalence gate: the output is true iff the inputs are the same (For the OR, the output is true iff the inputs are different) As we shall see, OR gates are used in addition and subtraction circuits Hence it is of interest to see how such gates can be constructed From the truth table, xor is true iff ( is false and is true) or ( is true and is false) More concisely, xor means ([not ] and ) or ( and [not ]) That is xor = + Note the priority of operators in the above equation: NOT ( ) comes first, followed by AND, then OR (Cf powers, multiplication, addition) 28/02/ /02/ AND-OR and NAND-NAND forms Commutative laws The function xor = + may be implemented using the circuit below Now let us introduce two inversion pairs [top right] xor xor This circuit is equivalent to the previous one [left] because the inversions cancel out But now all the multiple-input gates are NAND gates The OR, AND and OR functions are commutative; that is, for all,, + = + = xor = xor These laws are obvious because the verbal definitions of OR, AND and OR use words like either, both and only one, which do not distinguish between the two inputs The laws can be verified by swapping the input columns in the truth tables, and then reordering the rows to restore the original patterns of 1 s and 0 s Try it 28/02/ /02/
5 Associative laws Many-input gates OR and AND are also associative; that is, for all,,z, (+)+Z = +(+Z) ()Z = (Z) These laws can also be verified using truth tables The implication is that the expressions ++Z and Z are unambiguous Repeated applications of the associative laws indicate that OR and AND combinations with 4 or more variables are also unambiguous The commutative law can be brought in to show that these multi-variable expressions can be written in any order Expressions with three or more variables are implemented by logic gates with three or more inputs: Their names and functions of these gates are obvious Of course the outputs may be inverted [top right] In a multi-input AND gate, the output is true iff all of the inputs are true In a multi-input OR gate, the output is true iff any (one or more) of the inputs are true In multi-input NAND and NOR gates, the output is FALSE under the same input conditions 28/02/ /02/ De Morgan s laws - many inputs (2) The many-input forms of De Morgan s laws, like the two input forms, yield alternative symbols for logic gates: NAND: NOR: The summary rule still holds: To make an x-gate, invert the inputs to a y-gate, where one of x,y is an AND and the other is an OR, and only one is inverted 28/02/ Other associative laws? (1) Recall that the associative laws hold for OR and AND They do not hold for NOR or NAND ((+) +Z) is not identical to (+(+Z) ), and neither is identical to the three-input NOR function (++Z) = ((+)+Z) = (+(+Z)) Similarly, (() Z) is not identical to ((Z) ), and neither is identical to the three-input NAND function (Z) = (()Z) = ((Z)) The three-way equalities are of course based on the associative laws for OR and AND 28/02/
6 Parity-testing circuits Each of the following circuits combines n inputs using n-1 OR gates, and produces an output of 1 iff the number of input 1 s is odd Other gate arrangements are possible n = 3: n = 6: 28/02/ Two-level logic A sum of products (SOP) or product of sums (POS) is a two-level expression because it can be implemented by two layers of gates (excluding initial inverters) The two two-level implementations of W = Z + Z + = ( + +Z )(+Z)(+) are shown below [SOP on the left, POS on the right]: Z Z W 28/02/ Z Z W Sum of products; minterms (1) Sum of products; minterms (2) The truth table for is S = A xor B Row A B S S is true on rows 1 and 2 On row 1, A B is true On row 2, AB is true The region where S is true is the union of the two rows, so the sum-of-products form of S is S = A B + AB A product corresponding to one row of the truth table (eg A B for the row 0) is called a minterm The minterm number (or row number in the truth table) is obtained by reading the inputs as a multi-bit binary number There is a widely-used shorthand notation in which each minterm is identified by a letter m followed by the minterm number So, in a 2-input truth table, the minterms are,, and This leads to alternative notations for the sum-of-products (SOP): S = A B + AB = + = Σm(1,2) NB: In a minterm, each input appears exactly once 28/02/ /02/
7 Product of sums; maxterms (1) Product of sums; maxterms (2) We stay with S = A xor B: Row A B S The region where S is false is the union of the other two rows, or rows 0 and 3: S = A B + AB Inverting both sides and using De Morgan s laws, we get a product of sums: S = (A B + AB) = (A B ) (AB) = (A+B)(A +B ) A sum in which each input variable appears exactly once is called a maxterm Notice that the literals in the POS form of S are the complements of those in the SOP form of S But we still define the maxterm number as the row number (for each row where the function is false) So the literals in the maxterm are the complements of those on the corresponding row A maxterm is identified by a capital M followed by its number; so S = (A+B)(A +B ) = M0M3 = ΠM(0,3) Again, notice that the literals in each maxterm are complemented to work out the maxterm number 28/02/ /02/ Three-variable SOP/POS example DON T CARE outputs The truth table for the carry-out of a full adder is: Row A B C Cout Sum of products: Cout = + m5 + m6 + m7 = A BC + AB C + ABC + ABC Product of sums: Cout = M0M1M2M4 = (A+B+C)(A+B+C ) (A+B +C)(A +B+C) NB: The minterm/maxterm numbers are the row numbers for which the function is 1/0 If we know that certain combinations of inputs cannot occur, it does not matter what outputs are produced for the forbidden inputs These don t care outputs are shown as s on truth tables and K-maps For the purpose of minimizing the function on a K-map, each may be interpreted as a 1 or 0 as convenient; that is, each may be included or not included in the union of rectangles showing where the function is true, so as to simplify the pattern 28/02/ /02/
8 BCD to 7-segment converter (1) Suppose we wish to display the digits 0 to 9 on a 7- segment display, as shown below For each displayed digit, the input is a Binary Coded Decimal (BCD) number, ie one of the binary numbers 0000 to 1001 The numbers 1010 to 1111 (A to F hex) are not used; these are the minterm numbers which produce don t-care outputs 28/02/ BCD to 7-segment converter (2) Each displayed digit has 7 segments, called S0, S1,, S6 The same names refer to the logical variables that control the segments; if the variable is TRUE, the segment is ON Each displayed digit is controlled by a converter with 7 outputs S0, S1,, S6 Each output is a function of four inputs A,B,C,D, which represent the BCD digit ABCD 2 S0 S0 S1 S5 S1 A BCD S2 S6 B to S3 C 7-seg S4 S4 S2 D S5 S3 conv S6 28/02/ Other implementation methods We have seen how to implement logic functions using AND-OR and OR-AND configurations Some other systematic methods (related to the AND-OR structure) make use of the following devices: Multiplexer (MU), Demultiplexer (DEMU) or decoder (Dec), Read-Only Memory (ROM), Programmable Logic Array (PLA), Programmable Array Logic (PAL) These devices are discussed on the following slides 28/02/ Multiplexer/demultiplexer pair Suppose we want to send 8 logical variables (8 bits) over a single wire We can share the wire as follows A multiplexer (MU) selects one of the 8 inputs and feeds it to the wire A decoder (Dec) or demultiplexer (DEMU) directs the signal to the appropriate output The desired input/output is indicated by a 3-bit binary number ABC Eight inputs D0 D7 8:1 MU ABC 28/02/ Z single wire 1:8 Dec E ABC D0 D7 Eight outputs
9 Implementation of 4:1 multiplexer 2 n :1 multiplexer If we have four inputs, the selected input can be specified with a 2-bit binary number AB From the diagram, the output is Z = A B D0 + A BD1 + AB D2 + ABD3 = D0 + D1 + D2 + D3 Only one minterm is true; let it be mi Then Z reduces to midi = 1Di = Di D0 D1 D2 D3 A B Z A 2 n :1 MU follows the same pattern It has n select lines, n inverters (for the select inputs), 2 n data inputs, 2 n AND gates (each with n+1 inputs) and a 2 n - input OR gate (Putting n=2 confirms that a 4:1 MU has 2 select lines, 2 inverters, 4 data inputs, 4 3-input AND gates and a 4-input OR gate) The 2 n :1 MU output is Z = D0 + D1 + + n-1 D2 n-1 Again, one and only one minterm is true If the true minterm is mi, the output reduces to Z = midi = 1Di = Di, which is the selected input 28/02/ /02/ A MU can generate any function! The extra input A 2 n :1 MU with data inputs D0, D1,, D2 n produces the output Z = D0 + D1 + + n-1 D2 n-1 This is simply the sum of all the minterms for which the corresponding data inputs are true (1) We can pick any set of minterms, and hence implement any function, simply by setting the appropriate inputs to 1 In this way, a 2 n :1 MU can implement any function of n variables Indeed, it can implement any function of n+1 variables if we allow the extra variable to be true or inverted We wish to implement a function Z which depends on the n+1 variables S 0, S 1, S 2,, S n-1, S n We use the first n variables S 0, S 1, S 2,, S n-1 as the select inputs of a 2 n :1 MU For any combination of the select inputs, there are two values of S n and hence four ways in which Z can depend on S n ; these are shown as Z 0 to Z 3 in the table: S n Z 0 Z 1 Z 2 Z Notice that Z 0 = 0, Z 1 = S n, Z 2 = S n and Z 3 = 1 So we feed one of these four functions of S n into each data input of the MU 28/02/ /02/
10 Implementation of 1:4 decoder In the diagram we see that D0 = E A B D1 = E A B D2 = E AB D3 = E AB or, in general, Di = Emi ; i = 0,1,2,3 where mi is the ith minterm of A,B If mj is the true minterm, then Dj = E and all other Di are 0 Thus E is fed to the output selected by AB The data input is called E for Enable ; if E=0, all the outputs are 0 28/02/ E A B D0 D1 D2 D3 Minterm generator 1:4 If we set E=1, the blue equation Dec on the previous slide reduces to Di = mi ; i = 0,1,2,3 E Thus the decoder generates all the minterms at once, and we can create any function of A,B by OR-ing the available minterms The diagram shows how to implement F1 = + and F2 = ++ Notice that the minterms generated by Question: F1 and F2 the decoder can be re-used have names What are they? F1 F2 28/02/ A B AND-OR shorthand diagrams The circuit on the previous slide has an inverter array to give the complemented select inputs, an AND gate array to generate the minterms, and an OR gate array to form the desired functions from the minterms This structure can be represented by a shorthand diagram like that on the right Connections to separate gate inputs are shown as crosses on a common input line This diagram shows the same circuit as the previous slide E A B AND plane OR plane F1 F2 28/02/ :8 decoder This shorthand diagram shows the internal circuit of 1:8 decoder It has three inverters and eight 4-input AND gates It has no OR plane, but an external OR plane might be added to compute several functions from the eight minterms (The outputs are minterms provided that E=1) 28/02/ E A B C m4 m5 m6 m7
11 ROM concept (1) A B C ROM concept (2) A B C The diagram shows four functions implemented by a 1:8 decoder and an OR plane The select lines specify a 3-bit binary number ABC, which we may regard as an address The four outputs W,,,Z may be regarded as a 4-bit binary number located at the address ABC Address decoder (no enable) m4 m5 m6 m7 W Z that is, WZ 2 is the contents of the address ABC 2 Thus the complete circuit comprises a Read- Only Memory or ROM If an address decoder output is connected to an OR input, there is a 1 at that address Hence the contents may be read from the connection plane Connection plane m4 m5 m6 m7 W Z 28/02/ /02/ ROM concept (3) A cross on the connection plane means a 1 in the truth table or contents table: A B C W Z A B C Compare Connection plane W Z 28/02/ m4 m5 m6 m7 BCD to 7-segment converter in ROM A B C D S S 0 1 S 2 S 3 S 4 S 5 S x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x The truth table or contents table [left] is implemented directly by a 2 4 x 7 ROM (or, more likely, a 2 4 x 8 ROM with one output line unused) S0 S5 S4 S2 S3 28/02/ S6 S1
School of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics
Digital Circuits 1 Why are we studying digital So that one day you can design something which is better than the... circuits? 2 Why are we studying digital or something better than the... circuits? 3 Why
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationLogic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationReview for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationKarnaugh Map & Boolean Expression Simplification
Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
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 informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationCOSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2017 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables,,... represent classes
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Fall 2011 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables x, y,... represent
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationChapter 4: Designing Combinational Systems Uchechukwu Ofoegbu
Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu Temple University Gate Delay ((1.1).1) ((1.0).0) ((0.1).1) ((0.1).0) ((1.1) = 1 0 s = sum c out carry-out a, b = added bits C = carry in a
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationCHAPTER 7. Exercises 17/ / /2 2 0
CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2015 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables X,,... represent
More informationKarnaugh Maps Objectives
Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
More informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
More informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
More informationUNIT II COMBINATIONAL CIRCUITS:
UNIT II COMBINATIONAL CIRCUITS: INTRODUCTION: The digital system consists of two types of circuits, namely (i) (ii) Combinational circuits Sequential circuits Combinational circuit consists of logic gates
More informationLogic and Boolean algebra
Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationFundamentals of Boolean Algebra
UNIT-II 1 Fundamentals of Boolean Algebra Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators and
More informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationBOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationCombinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationMidterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name
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 5 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationDigital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta
Digital System Design Combinational Logic Assoc. Prof. Pradondet Nilagupta pom@ku.ac.th Acknowledgement This lecture note is modified from Engin112: Digital Design by Prof. Maciej Ciesielski, Prof. Tilman
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Examples of Solved Problems CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander
More informationLogic Design Combinational Circuits. Digital Computer Design
Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationSection 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic
Section 3: Combinational Logic Design Major Topics Design Procedure Multilevel circuits Design with XOR gates Adders and Subtractors Binary parallel adder Decoders Encoders Multiplexers Programmed Logic
More informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationReview: Additional Boolean operations
Review: Additional Boolean operations Operation: NAND (NOT-AND) NOR (NOT-OR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1
More informationELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES
EC 216(R-15) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationComputer Organization I. Lecture 13: Design of Combinational Logic Circuits
Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationComputer organization
Computer organization Levels of abstraction Assembler Simulator Applications C C++ Java High-level language SOFTWARE add lw ori Assembly language Goal 0000 0001 0000 1001 0101 Machine instructions/data
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More information