Boolean Algebra   Theory and Applications
Learning Objectives Learn about Boolean expressions Become aware of the basic properties of Boolean algebra Explore the application of Boolean algebra in the design of electronic circuits Learn the application of Boolean algebra in switching circuits
Two-Element Boolean Algebra Let  B  = {0, 1}.
 
Two-Element Boolean Algebra
Logical Gates and Combinatorial Circuits
Logical Gates and Combinatorial Circuits
Logical Gates and Combinatorial Circuits
Logical Gates and Combinatorial Circuits In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called  combinatorial circuits . The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The word circuit instead of symbol is also used.
Logical Gates and Combinatorial Circuits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Logical Gates and Combinatorial Circuits The diagram in Figure 12.32 represents a circuit with more than one output.
 
 
 
Logical Gates and Combinatorial Circuits A NOT gate can be implemented using a NAND gate (see Figure 12.36(a)). An AND gate can be implemented using NAND gates (see Figure 12.36(b)). An OR gate can be implemented using NAND gates (see Figure12.36(c)).
Logical Gates and Combinatorial Circuits Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NAND gates. Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NOR gates.

Boolean algebra

  • 1.
    Boolean Algebra Theory and Applications
  • 2.
    Learning Objectives Learnabout Boolean expressions Become aware of the basic properties of Boolean algebra Explore the application of Boolean algebra in the design of electronic circuits Learn the application of Boolean algebra in switching circuits
  • 3.
  • 4.
  • 5.
  • 6.
    Logical Gates andCombinatorial Circuits
  • 7.
    Logical Gates andCombinatorial Circuits
  • 8.
    Logical Gates andCombinatorial Circuits
  • 9.
    Logical Gates andCombinatorial Circuits In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called combinatorial circuits . The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The word circuit instead of symbol is also used.
  • 10.
    Logical Gates andCombinatorial Circuits
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.
  • 22.
  • 23.
  • 24.
  • 25.
  • 26.
  • 27.
  • 28.
  • 29.
  • 30.
  • 31.
  • 32.
    Logical Gates andCombinatorial Circuits The diagram in Figure 12.32 represents a circuit with more than one output.
  • 33.
  • 34.
  • 35.
  • 36.
    Logical Gates andCombinatorial Circuits A NOT gate can be implemented using a NAND gate (see Figure 12.36(a)). An AND gate can be implemented using NAND gates (see Figure 12.36(b)). An OR gate can be implemented using NAND gates (see Figure12.36(c)).
  • 37.
    Logical Gates andCombinatorial Circuits Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NAND gates. Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NOR gates.