![]() Thus, the NAND gate implementation is a less expensive and faster implementation. But we saw in Section 6.2 that a NAND gate requires fewer transistors than an AND gate or OR gate due to the signal inversion properties of transistors. The function in Equation (6.3.5) using only three NAND gates.įrom simply viewing the logic circuit diagrams, it may seem that we have not gained anything in this circuit transformation. NANDĪ binary operator the result is \(\binary\)įigure 6.3.9. And, of course, the same is true for OR gates, giving us a NOR gate. The combination is so common, it has been given the name NAND gate. We saw in that discussion that it takes fewer transistors to produce AND NOT than a pure AND. As a result, an AND gate typically requires a NOT gate at the output in order to achieve a true AND operation. That is, a high voltage at the input produces a low voltage at the output and vice versa. Because of the inherent way that transistors work, most circuits invert the signal. The discussion of transistor circuits in Section 6.2 illustrates a common characteristic. B Hints and Solutions to Selected Exercises. ![]() 19 General Purpose Input/Output (GPIO) Device.14 Bit Operations Multiplication and Division.Creating a Program in Assembly Language.Using C Programs to Explore Data Formats.Mathematical Equivalence of Binary and Decimal. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |