Embed Size (px)
DESCRIPTION
Citation preview
Boolean Algebra
Theory and Applications
Discrete Mathematical Structures: Theory and Applications 2
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
Discrete Mathematical Structures: Theory and Applications 3
Two-Element Boolean AlgebraLet B = {0, 1}.
Discrete Mathematical Structures: Theory and Applications 4
Discrete Mathematical Structures: Theory and Applications 5
Two-Element Boolean Algebra
Discrete Mathematical Structures: Theory and Applications 6
Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications 7
Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications 8
Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications 9
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.
Discrete Mathematical Structures: Theory and Applications 10
Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications 11
Discrete Mathematical Structures: Theory and Applications 12
Discrete Mathematical Structures: Theory and Applications 13
Discrete Mathematical Structures: Theory and Applications 14
Discrete Mathematical Structures: Theory and Applications 15
Discrete Mathematical Structures: Theory and Applications 16
Discrete Mathematical Structures: Theory and Applications 17
Discrete Mathematical Structures: Theory and Applications 18
Discrete Mathematical Structures: Theory and Applications 19
Discrete Mathematical Structures: Theory and Applications 20
Discrete Mathematical Structures: Theory and Applications 21
Discrete Mathematical Structures: Theory and Applications 22
Discrete Mathematical Structures: Theory and Applications 23
Discrete Mathematical Structures: Theory and Applications 24
Discrete Mathematical Structures: Theory and Applications 25
Discrete Mathematical Structures: Theory and Applications 26
Discrete Mathematical Structures: Theory and Applications 27
Discrete Mathematical Structures: Theory and Applications 28
Discrete Mathematical Structures: Theory and Applications 29
Discrete Mathematical Structures: Theory and Applications 30
Discrete Mathematical Structures: Theory and Applications 31
Discrete Mathematical Structures: Theory and Applications 32
Logical Gates and Combinatorial Circuits
The diagram in Figure 12.32 represents a circuit with more than one output.
Discrete Mathematical Structures: Theory and Applications 33
Discrete Mathematical Structures: Theory and Applications 34
Discrete Mathematical Structures: Theory and Applications 35
Discrete Mathematical Structures: Theory and Applications 36
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)).
Discrete Mathematical Structures: Theory and Applications 37
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.
