目录
Basic postulates and Other identities of Boolean algebra
Combining circuits for AB'+BC'
Truth Table < → Boolean Expression
From Truth Table to Boolean Expression
From Boolean Expression To Truth Table
functionally complete sets of gates(功能完整的门集)
Implementation of Boolean functions(布尔函数的实现)
Logic gates
the fundamental building block of all digital logic circuits(数字逻辑电路);
a simple Boolean operation on its input signals and produce an output signal;
Logic gates have inputs driven by voltages(由电压驱动的输入),representing truth values.
0V might be False, 5V might be True.
Logic gates output a voltage representing the result(逻辑门输出一个代表该结果的电压).
three ways of definition
algebraic notation
truth table
graphic symbol
six basic logical gates used in digital logic:
AND, OR, NOT, NAND, NOR, XOR
And gate(和门)
AND gate and its truth table.
Expression: Y = AB or A•B
And gate circuit
OR gate(或门)
OR gate and its truth table.
Expression: Y = A+B
Or gate circuit
NOT gate(非门)
NOT gate and its truth table.
Expression: Y = A’ or A
NAnd gate(与非门)
NOR gate(或非门)
XOR gate(异或门)
Basic postulates and Other identities of Boolean algebra
Combinational circuits(组合电路)
An interconnected set of gates
Its output at any time is a function of the input at that time.(在任何时候的输出都是当时输入的函数)
It consists of n binary inputs and m binary outputs.(由n个二进制输入和m个二进制输出组成)
Three ways of definition:
Graphic symbols(图形符号): interconnected layout of gates.
Boolean equations(布尔方程): each output signal is expressed as a Boolean function of its input signals.
Truth table(真值表): For each of the 2n possible combinations of input signals, the binary value of each of the m output signals is listed.
Combining circuits for AB'+BC'
A | B | C | Y |
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 0 |
Truth Table < → Boolean Expression
From Truth Table to Boolean Expression
Any given truth table can be converted to a Boolean expression using only NOT, AND, OR operators.(任何给定的真值表都可以仅使用非、与、或运算符转换为布尔表达式)
A | B | Y=AB |
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
f(A,B)=A’B
A | B | F(A,B)=? |
0 | 0 | 1 |
0 | 1 | 1 |
1 | 0 | 0 |
1 | 1 | 0 |
f(A,B) = A’B’ + A’B
A | B | C | F(A,B,C)=? |
0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 0 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 |
f(A,B,C) = A’B’ C’+ A’BC+ABC
From Boolean Expression To Truth Table
Produce the Truth Table for the boolean expression (A+B)C. Then make a circuit online to verify your table.
A | B | C | (A+B)C |
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 |
The circuit for the given boolean expression looks like below:
functionally complete sets of gates(功能完整的门集)
any Boolean function can be implemented using only the gates in the set.(任何布尔函数都可以只使用集合中的门来实现)
Not all gate types are used in implementation.(并不是所有的门类型都在实现中使用)
Design and fabrication are simpler.
The following are functionally complete sets:
AND, OR, NOT
AND, NOT
OR, NOT
NAND
NOR
Some uses of NAND gate
Implementation of Boolean functions(布尔函数的实现)
A | B | C | F(A,B,C)=? |
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 1 |
0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 0 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 0 |
ANS: f(A,B,C) = A’BC’+A’BC+ABC’
SOP: sum of products,form expresses that the output is 1 if any of the input combinations that
produce 1 is true. Has one term for each 1.