These outputs are then fed as inputs to the NAND gate as shown in fig. To produce OR gate using NAND gate, the inputs A and B of the two NOT gates (obtained from the NAND gates) are joined together. The truth table of the above combination is given below. In the truth table of NAND gate, if we use B = A, we obtain the truth table of NOT gate. If the two inputs of the NAND gate are joined to make one input as shown in figure 2 below then the NAND gate functions as a NOT gate. Thus in digital circuits, it serves as a building block. The repeated use of the NAND gate can produce all other logic gates. NAND gate as Universal gateĪ universal gate is a gate which can implement any Boolean function without need to use any other gate type. The NAND and NOR gates are universal gates. Aįrom NAND gate truth table, it can be concluded that the output will be logical 0 or low when all inputs are at logical 1 or high. The NAND gate truth table for figure 1(b) is shown below. The NAND gate truth table for figure 1(a) is shown below. 1įigure 1(b) shows the NAND gate as the combination of AND gate and NOT gate. The logic symbol of NAND gate is shown in figure 1(a). In Boolean expression, the NAND gate is expressed as and is being read as “A and B negated” or “A and B bar”.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |