[Digital Electronics Digital Electronic Technology 2] - algebra logic as a function of its analytical method described

1. Description The method of logic function

1.1 Truth Table

The concept: to characterize the state of all possible forms of logic between input and output events. The following table lists truth value of propositional formulas. Usually expressed true to 1, and 0 for false
We look at a truth table below:

A, B, C represents the input, F represents an output
generally we write truth table, preferably in a certain order of permutations and combinations of all values of the input variables to write out, and then look at the situation according to the output circuit or other means. This prevents duplicate or missing

1.2 Functional Logic

In fact, these concepts are well understood, the so-called functional logic, that is, the logical relationship between the input and output languages, or other non-modular arithmetic, for example: Y = A (B + C); this is a logical function of formula

The basic formula 1.2.1 and common logic algebraic formula

Here we may be known functional logic required by Y is 0 or 1 different input determination output of 1 or 0, which we sometimes need some logic functional simplification, let insertion logic basic algebra equations and formulas used for later review using :( bloggers just recorded some of the more important)

No. official
1 0 A = 0 \quad\quad\quad\quad 0•A = 0 \quad\quad\quad\quad
2 1 A = 1 \quad\quad\quad\quad 1•A = 1 \quad\quad\quad\quad
3 A A = A \quad\quad\quad\quad A•A = A \quad\quad\quad\quad
4 A A = 0 \quad\quad\quad\quad A'•A = 0 \quad\quad\quad\quad
5 A ( B + C ) = A B + A C \quad\quad\quad\quad A•(B + C) = A • B + A • C \quad\quad
6 A ( B C ) = ( A B ) C \quad\quad\quad\quad A • (B•C) = (A•B) • C \quad\quad
7 ( A B ) = A + B \quad\quad\quad\quad (A•B)' = A' + B' \quad\quad\quad\quad
8 ( A ) = A \quad\quad\quad\quad (A')' = A \quad\quad\quad\quad
9 1 + A = A ; 0 + A = A ; A + A = A ; A + A = 1 \quad\quad\quad\quad 1 + A = A; \quad0 + A = A; \quad A + A = A; \quad A + A' = 1\quad\quad\quad
10 ( A + B ) = A B \quad\quad\quad\quad (A+B)' = A' • B' \quad\quad\quad\quad
11 A + A B = A \quad\quad\quad\quad A + A• B = A \quad\quad\quad\quad
12 A + A B = A + B \quad\quad\quad\quad A + A'• B = A + B \quad\quad\quad\quad
13 A ( A + B ) = A \quad\quad\quad\quad A • (A + B) = A \quad\quad\quad
14 A B + A B = A \quad\quad\quad\quad A • B + A • B' = A \quad\quad\quad

1.3 逻辑图

逻辑图就是将逻辑函数式中各个变量之间与,或,非等逻辑关系用图形表示出来
下面我们来复习一下两套表示与,或,非的符号:

而由与,或,非还能组成另一些复合逻辑:与非,或非,与或非,同或,异或

  1. 与非:Y = (AB)’ 顾名思义,先将两个输入做“与”运算,在将与运算的结果取反
  2. 或非:Y = (A+B)’ 类似,先做或运算,在做非运算
  3. 与或非:Y = (AB + CD)’ 与或非逻辑一般有4个输入,我们将他们两两为一组,先对每组进行与运算,再将两组与运算得到的结果进行或运算,最后再将得到的结果进行取反
  4. 同或:Y = A ⊕ B 相同为真“1”,不同为假“0”
  5. 异或:Y = A ⊙ B 相同为假“0”,不同为真“1”

这些逻辑符号的不同组合就能够得到我们的逻辑图啦

1.4 波形图

将逻辑函数输入变量每一种可能出现的取值与对应的输出值按时间顺序依次排列起来,就得到了描述该逻辑函数的波形图,也成为“时序图”。我们看看下面的例子:

2. 各种描述之间的转换方法解析

一,波形图转化为真值表:

这个比较简单,首先,我们先把输入的所有排列组合的情况先列出来,然后再根据输入组合的情况依次在波形图中找到对应的Y,并且填入真值表中
以上面的波形图为例:我们先写出输出A,B,C所有的组合情况:

A B C Y
0 0 0
0 1 0
0 0 1
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

接下来,就是根据上面不同A,B,C的组合找到对应的Y

A B C Y
0 0 0 0
0 1 0 0
0 0 1 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

二,真值表得到逻辑表达式

这里有一个技巧:首先,我们找到真值表上输出为1的所有组合(以上表为例)
那么,在上表中,Y为1的所有输入组合分别为:(011,101,110)
然后,每一组输入变量取值的组合对应一个乘积项,其中,取值为1的写入原变量,取值为0的写入反变量
最后,将这些乘积项相加,得到逻辑表达式

比如011的组合就写成:A’BC;101的组合写成:AB’C;110的组合写成:ABC’
因此,该真值表对应的逻辑表达式为:Y = A’BC + AB’C + ABC’

这里用到的知识是逻辑函数的标准形式,我们在后面的博文中会对它进行记录

三,由逻辑表达式得到波形图

这个是最简单的,直接将每一个取值画出来就OK

发布了98 篇原创文章 · 获赞 283 · 访问量 1万+

Guess you like

Origin blog.csdn.net/weixin_44586473/article/details/100692694