101_2_digitalSystem_Chap_2_part_3.ppt
Download as PPT, PDF0 likes22 views
This document discusses additional logic gates and circuits. It introduces complex gates that are built from more than one primitive operation type. Examples of complex gates include XOR and XNOR gates. XOR gates implement the exclusive OR function, outputting 1 only when the two inputs are different. XNOR gates are the complement and output 1 only when the two inputs are the same. The document also discusses using XOR and XNOR gates to implement odd and even functions with more than two variables. Finally, it introduces three-state logic gates that can output a high-impedance state in addition to 0 and 1, allowing their outputs to be connected together.
101_2_digitalSystem_Chap_2_part_3.ppt
- 1. Chapter 2 – Combinational Logic Circuits Part 3 – Additional Gates and Circuits Logic and Computer Design Fundamentals
- 2. Overview Part 3 – Additional Gates and Circuits • 2-8 Other Gate Types • 2-9 Exclusive-OR Operator and Gates • 2-10 High-Impedance Outputs Chapter 2 - Part 3 2
- 3. Other Gate Types Why? • Implementation feasibility and low cost • Power in implementing Boolean functions • Convenient conceptual representation Gate classifications • Primitive gate - a gate that can be described using a single primitive operation type (AND or OR) plus an optional inversion(s). • Complex gate - a gate that requires more than one primitive operation type for its description Primitive gates will be covered first Chapter 2 - Part 3 3
- 4. Chapter 2 - Part 3 4 Primitive Digital Logic Gates
- 5. Chapter 2 - Part 3 5 Primitive Digital Logic Gates
- 6. Chapter 2 - Part 3 6 Complex Digital Logic Gates
- 7. Chapter 2 - Part 3 7 Complex Digital Logic Gates
- 8. Chapter 2 - Part 3 8 Logical Operations with NAND Gate
- 9. 2-9 Exclusive-OR Operator and Gates Exclusive OR/ Exclusive NOR The eXclusive OR (XOR) function is an important Boolean function used extensively in logic circuits. The XOR function may be; • implemented directly as an electronic circuit (truly a gate) or • implemented by interconnecting other gate types (used as a convenient representation) The eXclusive NOR function is the complement of the XOR function By our definition, XOR and XNOR gates are complex gates. Chapter 2 - Part 3 9
- 10. Exclusive OR/ Exclusive NOR Uses for the XOR and XNORs gate include: • Adders/subtractors/multipliers • Counters/incrementers/decrementers • Parity generators/checkers Definitions • The XOR function is: • The eXclusive NOR (XNOR) function, otherwise known as equivalence is: Strictly speaking, XOR and XNOR gates do no exist for more that two inputs. Instead, they are replaced by odd and even functions. Chapter 2 - Part 3 10 Y X Y X Y X + = Y X Y X Y X + =
- 11. Truth Tables for XOR/XNOR Operator Rules: XOR XNOR The XOR function means: X OR Y, but NOT BOTH XOR is known as equivalence function, why? Chapter 2 - Part 3 11 X Y XY 0 0 0 0 1 1 1 0 1 1 1 0 X Y 0 0 1 0 1 0 1 0 0 1 1 1 (XY)
- 12. XOR/XNOR (Continued) The XOR function can be extended to 3 or more variables. For more than 2 variables, it is called an odd function or modulo 2 sum (Mod 2 sum), not an XOR: The complement of the odd function is the even function. The XOR identities: Chapter 2 - Part 3 12 = = X 1 X X 0 X 1 X X 0 X X = = X Y Y X = Z Y X ) Z Y ( X Z ) Y X ( = = + + + = Z Y X Z Y X Z Y X Z Y X Z Y X
- 13. Symbols For XOR and XNOR XOR symbol: XNOR symbol: Shaped symbols exist only for two inputs Chapter 2 - Part 3 13
- 14. Odd and Even Functions The odd and even functions on a K-map form “checkerboard” patterns. The 1s of an odd function correspond to minterms having an index with an odd number of 1s. The 1s of an even function correspond to minterms having an index with an even number of 1s. Implementation of odd and even functions for greater than four variables as a two-level circuit is difficult, so we use “trees” made up of : • 2-input XOR or XNORs • 3- or 4-input odd or even functions Chapter 2 - Part 3 14
- 15. Example: Odd Function Implementation Design a 3-input odd function F = X Y Z with 2-input XOR gates Factoring, F = (X Y) Z The circuit: Chapter 2 - Part 3 15 + + + + X Y Z F
- 16. Example: Even Function Implementation Design a 4-input odd function F = W X Y Z with 2-input XOR and XNOR gates Factoring, F = (W X) (Y Z) The circuit: Chapter 2 - Part 3 16 + + + + + + W X Y F Z
- 17. Parity Generators and Checkers In Chapter 1, a parity bit added to n-bit code to produce an n + 1 bit code: • Add odd parity bit to generate code words with even parity • Add even parity bit to generate code words with odd parity • Use odd parity circuit to check code words with even parity • Use even parity circuit to check code words with odd parity Example: n = 3. Generate even parity code words of length four with odd parity generator: Check even parity code words of length four with odd parity checker: Operation: (X,Y,Z) = (0,0,1) gives (X,Y,Z,P) = (0,0,1,1) and C= 0. If Y changes from 0 to 1 between generator and checker, then = 1 indicates an error. Chapter 2 - Part 3 17 X Y Z P X Y Z C P
- 18. 2-10 Hi-Impedance Outputs Logic gates introduced thus far • have 1 and 0 output values, • cannot have their outputs connected together, and • transmit signals on connections in only one direction. Three-state logic adds a third logic value, Hi-Impedance (Hi-Z), giving three states: 0, 1, and Hi-Z on the outputs. Chapter 2 - Part 3 18
- 19. Multiplexed Line OL Chapter 2 - Part 3 19