The second part of electronic

technology

Digital circuit
(Chapter 4-6)
 Chapter4 Fundamentals of
digital logic
§4.1 Number system and code system

§4.2 Basic operation in logic algebra

§4.3 Basic rules and formulas in logic algebra

§4.4 Logic function and expressing methods

§4.5 Logic function's simplification by formulas

§4.6 Logic function's simplification by Karnaugh-

map
 Digital era has been
coming
Digital circuit is the core of
digital electronic technology, and
it is the hardware foundation of
computer and digital communication.

Key points of Chapter 4

Basic concept of digital circuit
Popular number system and code system in digital circuit
Basic logic operation in digital logic
Logic function's expression and simplification
Analog & digital signals
The signals in electronic circuits can be divided into two categories ：

Analog signal——A physical quantity that changes continuously in

time or in numerical terms, called analog quantities, such as
the voltage signals produced by thermocouples when they are
working (the measured temperature changes). The signals to
be expressed as analog quantities are called analog signals,
and the electronic circuits which work under analog signals
are called analog circuits.

Digital signal——The physical quantities which are discontinuous

(discrete) in time or in numerical value are called digital
quantities, such as the time signals of the electronic watch
and the counting signal of the number of parts recorded on
the production line. The changes of these signals occur in a
series of discrete moments, and their values are discrete. The
signals to be expressed as digital quantities is called a digital
signal, and electronic circuits operating under digital signals
are called digital circuits.
Digital Signal

1. Digital signal has only two

values ：“ 0” and“1”.
Note ： The "0" and "1" do not mean
1 is bigger than 0, only
representing two opposite
states, called logic 0 and
logic 1, also known as two
valued digital logic.
2. Digital signals often show as abrupt
voltage or current in a digital circuit
(1)Signals only have two voltage
values ， 5V and 0V.
We can use 5V to represent logic 1, V(V)
and 0V to represent logic 0; of
course, we can also use 0V to 5
represent logic 1, and 5V to
represent logic 0. Therefore, these
two voltages are often referred to
0 t (ms)
as logical levels. The 5V is high 10 20 30 40 50
level, and the 0V is low level.
A typical digital signal wave
(2) Signal from high level to low
level, or from low level to high
level is a sudden change
process, this signal is also
called pulse signal .
4.1 Numeral system and code system

4.1.1 Numeral system

It is often not enough to use only one digit to represent the
large amount of physical quantity with digital quantity.
Therefore, it is often necessary to use the method of carry
counting to make use of many bits of digital. We take a method
of every one of a number of digital and carry rules from low to
high called numeral system .
1. Decimal
Digits ： 0 、 1 、 2 、 3 、 4 、 5 、 6 、 7 、 8 、 9
Carry rule ： when 10 is full, a carry is
occurred to a higher position
The base number for counting ： 10

k i: coefficient for ith

position ；
D  k i 10 i
i
10 :weight of ith position.

143.65D 110 2 1
 4 10  3 10 0

1 2
 6 10  5 10
2 、 Binary
Digits ： 0 、 1
Carry rule ： When two is full, a carry
is occurred.
Base number ： 2
k i: coefficient for ith
D  k i2i position ；
i
2 :weight of ith position.
10011.11B
12 4  0 23  0 2 2  121  120  12  1  12  2
(19.75)10
3 、 Hexadecimal
Digits ： 0 ～
9 、 A(10) 、 B(11) 、 C(12) 、 D(13) 、
Carry E(14)
rule ：、 When
F(15)16 is full, a carry
is occurred.
Base number ： 16
k i: coefficient for ith
position ；
D  k i16 i
i
16 :weight of ith position.

3D.BE H 3 161
 13 16 0
 11 16 -1
 14 16 2
4.1.2 Code system
A set of numbers representing different things is called code
(such as postal code, telephone number, citizen ID number,
student's card number, etc.), and the rules that are followed
when compiling code are called code system.
（ Each bit cell“1” representing fixed value ： constant weight ）

8421
Constant weight
Code code ： 5421
classification
Cyclic codes(Gray code ）
Invariable weight
Reminder 3 cyclic codes
code ：
（ Each bit cell“1” doesn't represent fixed value ： invariable
weight ）
BCD Code ： 4 bit binary digits are used to represent one decimal number.
These codes are called binary-to-decimal codes, referred to as
BCD codes.

8421 2421 5121 Reminder 3 Reminder 3

Decimal
BCD code BCD code BCD code code cyclic code

0 0000 0000 0000 0011 0010

1 0001 0001 0001 0100 0110
2 0010 0010 0010 0101 0111
3 0011 0011 0110 0110 0101
4 0100 0100 0111 0111 0100
5 0101 1011 1000 1000 1100
6 0110 1100 1001 1001 1101
7 0111 1101 1010 1010 1111
8 1000 1110 1011 1011 1110
9 1001 1111 1111 1100 1010
 Gray Code
Features of Gray code ：
 Between any two adjacent codes only one original bit is
different (between 0 and the maximum number is also only a bit
different) , so also known as gray cyclic code. The gray code in the
process of encoding and transmission is not easy to make a
mistake.
0 and 1 in the highest position is changed only once. If the
interface between top 0 and 1 is viewed as axis, other low bits
show symmetrical arrangement in the middle of the axis, using
this feature can be easily composed of different digits gray;
 Gray is a kind of no weight code, not easy to direct operations,
but can easily be converted to binary;
The gray code has many forms, such as reminder 3 cyclic code.
 Gray
Code
2-bit Gray code 3-bit Gray code 4-bit Gray code
0 0 0 0 0 0 0 0 0
0 1 0 0 1 0 0 0 1
1 1 0 1 1 0 0 1 1
1 0 0 1 0 0 0 1 0
1 1 0 0 1 1 0
1 1 1 0 1 1 1
1 0 1 0 1 0 1
1 0 0 0 1 0 0
1 1 0 0
1 1 0 1
1 1 1 1
1 1 1 0
1 0 1 0
1 0 1 1
1 0 0 1
1 0 0 0
Eg ： 4-bit Cyclic Gray Code
Decimal number Gray code
0 0000
adjacent adjacent
1 0001
2 0011
3 0010 adjacent

4 0110
5 0111
6 0101 adjac
ent
7 0100
 Eg ： 4-bit Cyclic Gray Code
the last two bits
十Decimal
进制数 Graycode
Gray 码 十Decimal
进 制 数 Gray
Gray 码
code
0 0000 8 1100
1 0001 9 1101
2 0011 10 1111
3 0010 11 1110
4 0110 12 1010
5 0111 13 1011
6 0101 14 1001
7 0100 15 1000
The first two bits
§4.2 Basic operations in logic algebra
A mathematical method for describing the logical
relationship of objective things, called Boolean algebra.
Boolean algebra is widely used to solve the analysis and
design of switching circuits and digital logic circuits, so
Boolean algebra is called logic algebra or switching
algebra.

A letter is also used to express variables in logical

algebra, called logical variables. In two valued logic, each
logical variable value only "1" and "0" two. They only
represent two different logic states, instead of big value or
small value.
4.2.1 Logic AND Y A  B

A B
Y

A B Y A  B Y
switch off switch off off
 0 0 0
Input all
switch on switch off off  1 0 0 are
switch off switch on off  0 1 0 1s ， output
is 1.
switch on switch on on  1 1 1
4.2.1 Logic AND Y A  B

The unit circuit implementing logic AND operation is

called the AND gate.

＆ A
A Y
Y B
B
0•0=0 0•1=0
1•0=0 1•1=1
“AND”Gate Sign
4.2.2 Logic OR Y A  B
B

A Y

A B Y A+B Y
switch off switch off off
 0+0=0
switch on switch off on  1+0=1 If input
has
switch off switch on on  0+1=1 1 ， output
switch on switch on on  1+1=1 must be 1.
4.2.2 Logic OR Y A  B

The unit circuit implementing logic OR operation is

called the OR gate.
≥1
A A
Y B Y
B

0+0=0 0+1=1
“OR”gate sign 1+0=1 1+1=1
4.2.3 Logic NOT Y A

A Y

A Y A Y
switch off on  0 1 Not 0 is
switch on off  1 0 1 ， not 1
is 0.
4.2.3 Logic NOT Y A

The unit circuit implementing logic NOT

operation is called the NOT gate.

1
A Y A Y

“NOT”gate sign
4.2.4 Compound logic

1 、 NAND operation

Y AB
A B Y ＆
A
0 0 1 B
Y

0 1 1
1 0 1
A
1 1 0 Y
B
4.2.4 Compound logic

2 、 NOR operation

Y A  B
A B Y A
≥1
Y
0 0 1 B

0 1 0
1 0 0 A
Y
1 1 0 B
4.2.4 Compound logic

3 、 eXclusive-OR operation

Y  AB  A B  A  B 1
A
Y
A B Y B
0 0 0
0 1 1 A
Y
1 0 1 B
1 1 0
4.2.4 Compound logic
Y  A  B  A  B A  B
4 、 inclusive-OR logic A B Y
0 0 1
0 1 0
1 0 0
1 1 1
=1 A
Y
B
 Outline
• Review of last class
– Digital logic
– Boolean algebra
– And, Not, Or, XOR, Inclusive-or logic operation
– Today's class
– Basic rules and common formulas in digital logic
– Simplification of logic function by formulas
– Simplification of logic function by Karnaugh map
§4.3 Basic rules and common formulas in logic algebra
4.3.1 Basic rules
1. Commutative rule A  B B  A A  B B  A

A  B  C A  B  C
2. Associative rule
A  B  C A  B  C

3. Distributive rule A  B  C A  B  A  C
A  B  C A  B  A  C

4. Inversion law (Morgan's law)

AB A  B A  B A  B
§4.3 Basic rules and common formulas in logic algebra
4.3.2 Common formulas

1. Constant and variable 0  0 0 0  1 0 1  1 1

0  0 0 0  1 1 1  1 1
0 1 1 0

2. Constant and variable 0  A 0 1 A A

0  A A 1  A 1

3. Variable and variable A  A A A  A 0

A  A A A  A 1
A A
4.3.3 Common formulas
4.3.3 Common formulas

1. A + AB = A

2.A  AB  A  B

3.AB  AC  BC  AB  AC
§4.4 Logical function and its expressions
What's the logical function
If the logical variable is used
as input, and the operation result
is used as output, then the value
of output will be determined when
the input variable is determined.
Therefore, between input and output
is a function, this function is
called logical function.
Y F A， B， C，......
 Outline
• Review
– 4.1 Analog signal & digital signal
• Code system (BCD & Gray code)
– 4.2 Basic operations in logic algebra
• AND & OR & NOT & XOR & Clusive OR
– 4.3 Basic rules and common formulas in logic
algebra
• Today's contents
– 4.4 Logical function and its expressions
– 4.5 Logical functions' simplification by
formula
4.4.1 Establishment of logic function
Eg: Three people vote on one thing and the result is decided by the
principle of 'minority is subordinated to the majority. Please build
the logical function to solve the problem.
3 steps to build logical function ：
Step 1: defining independent variablesand dependent variables.
The three person's opinion is set as independent variable A, B,
C, and the regulation can only agree or disagree with the two
opinions. The voting result is set as dependent variable Y,
obviously only through or not through two kinds of situations.

Step 2: define the logical value of the variable state. For the
independent variables A, B, C set: agree to logic '1' , do not
agree to logic '0'. For the dependent variable Y: let the vote be
logical '1' and not pass logical '0'.
Step 3: the problem according to the above provisions and
writing logic function.
4.4.1 Establishment of logic function
Eg: three people vote on one thing and the result is decided
by the principle of 'minority is subordinate to the majority',
and the logical function is established.

Truth table
A B C Y See from the truth table, A, B, C
0 0 0 0 when the independent variable
0 0 1 0 definite value, because the value of
0 1 0 0
the variable Y is completely
determined. So, Y is a function of A,
0 1 1 1
B, C. A, B C, often referred to as the
1 0 0 0
input variable, output logic variable
1 0 1 1 called Y.
1 1 0 1
1 1 1 1
4.4.2 Expression of logic function
Expressions of logic function ：
Logic state table （ truth table ）
Logic function
Logic diagram
Karnaugh map
4.4.2 Expression of logic function
There is a T corridor, a street lamp at the cross point. A
switch is at each corridor of A, B, C, respectively.

Control requirements ：
Turning off anyone of switches ， Y is on;
Turning off any two of switches, Y is
off;
Turning off all the them, Y is on.

A C
Y

B
 4.4.2 Expression of logic function
Control requirements ：
Turning off anyone of switches ， Y
s on ；
Turning off any two of switches, Y
s off; A C
Turning off all the them, Y is on. Y
Step1 ： definition of independent
variable and dependent variable B

As the independent variable, the control switch is

represented by A, B and C, and the state of the switch is
turning on or turning off.
Street lamp as dependent variable, expressed by Y, its state
is on or off.
4.4.2 逻辑函数的表示方法
A C
Step2 ： defining value of variable Y

Switch （ independent variable ）： turning on

——“1” ， turning off——“0” ；
lamp （ dependent variable ）： on——“1” ； off——“0”.
4.4.2 Expressions of logic function

Step3 ： list truth table according to

requirement
Turning on anyone of
A B C Y switches ， Y is on ；
0 0 0 0 Turning on any two of
0 0 1 1 switches, Y is off;
0 1 0 1 Turning on all the
0 1 1 0 them, Y is on.
1 0 0 1
1 0 1 0
1 1 0 0 A C
1 1 1 1 Y

B
 4.4.2 Expressions of logic function
Logic function formula: the logical relation between the independent
variable and dependent variable is expressed by operators such as "AND",
"OR", "NOT", and so on, that is, the logic function formula.

A B C Y 1. Find out the combination of the

independent variable values
0 0 0 0
corresponding to the function
0 0 1 1 value "1", and write the product of
ABC
0 1 0 1 independent variable
AB C
0 1 1 0 corresponding to the value
1 0 0 1 combination. "1" is written as the
AB C original variable, and "0" is
1 0 1 0
written as an inverse variable.
1 1 0 0
ABC 1 1 1 1
2. By adding these product terms, the
logical function formula of Y is
Y ABC  ABC  ABC  ABC obtained.
4.4.2 Expressions of logic function
Logic diagram: the logical function is
represented by graphical symbols in
the logical function among the A C
variables, such as, or, or not. Y
A B C

1 1 1
B
＆

≥1
Y
＆

＆ Y ABC  ABC  ABC  ABC

A A B B C C
§4.5 Logical functions' simplification by formula
AND&OR logic: if the logical formula is composed of
several product terms, then the logical form is called
AND&OR logic.

Eg： Y ABC  BC
NAND logic: if the logical form is composed of all
NADN operations, the logical form is called NAND
logic.

Eg： Y ABC  BC ABC  BC

AND&OR logic→NADN logic

§4.5 Logical functions' simplification by formula
The least product terms in function.
Simplest
AND&OR The least variables in each term.
form

The principle of formula simplification is to use

the basic formula and common formula of logical
algebra repeatedly to eliminate the redundant
product and factor in function formula, so as to
obtain the simplest form of function.
There is no fixed step during simplification.
§4.5 Logical functions' simplification by formula

Eg ：

F1  AB  BD  ABD  ABCD  A B

B  BD  ABD  ABCD
B  BD

F1 B  D
§4.5 Logical functions' simplification by formula

F2  AD  A D  AB  AC  BD  ACEF  BEF  DEFG

A  AC  BD  BEF  DEFG

DEF: redundant factor

DEFG: redundant term

 F2  A  C  BD  BEF
§4.5 Logical functions' simplification by formula

F3  AB  AC  BC  BC  BD  B D  ADE(F  G )

A
AB

A  BC  BC  BD  B D

CD
 F3  A  BC  B D  CD
§4.5 Logical functions' simplification by formula

F3  AB  AC  BC  BC  BD  B D  ADE(F  G )

A
AB

A  BC  BC  BD  B D

CD
 F3 A  BC  BD  CD
§4.5 Logical functions' simplification by formula

Discussion:
F3  AB  AC  BC  BC  BD  B D  ADE(F  G )

Simplified AND&OR form

F3  A  BC  B D  CD
or:
F3  A  BC  BD  CD

not unique
 Outline
Last class Today's contents
• 4.3 Expressions of • 4.6 Simplication by
logic functions Karnaugh map
– Truth table&function – 1. Karnaugh map
– diagram&Karnaugh – 2. Simplification
map • Conclusion
• 4.4 Design of logic
circuit
• 4.5 Simplification by
rules
§4.6 Simplification of logic function by Karnaugh map
4.6.1 Expressing logic function by Karnaugh map
1. The form of sum of minimum terms in logical function

Minimum terms
In the n variable logic function, if M is the product item containing N factors,
and the N variables appear in M in the form of the original variable or the
inverse variable, then M is called the minimum item of the group variable.
The minimum item of a N variable should be 2n.

Eg ： Three variables A,B,C all the minimum terms

ABC、 ABC、 ABC、 ABC、 3

total ： 2 =8
ABC、 ABC、 ABC、 A B C
§4.6 Simplification of logic function by Karnaugh map
4.6.1 Expressing logic function by Karnaugh map

The value of each set of input variables makes the value of a

corresponding minimum item equal to 1.
§4.6 Simplification of logic function by Karnaugh map

Minimum item's features ：

1. There must be a minimum item at any value of the input variable, and only one minimum
item is 1;
2. The sum of all minimal items is 1;
3. The product of any two minimum terms is 0;
4. The sum of two minimum items with adjacency (two minimum items with only one factor
difference) can be merged into one item, and a pair of factors is eliminated.

Eg: ABC  ABC AB

§4.6 Simplification of logic function by Karnaugh map

Eg ：

Y ABC  BC

ABC  (A  A )BC

ABC  ABC  ABC

m 6  m 7  m 3  mi (i 3,6,7)
i

 m(3,6,7)
§4.6 Simplification of logic function by Karnaugh map

Y ABCD  ACD  ABD

 
ABCD  A B  B CD  AB(C  C)D

ABCD  ABCD  ABCD  ABCD  ABCD

ABCD  ABCD  ABCD  ABCD

 m(7,12,13, 14)
§4.6 Simplification of logic function by Karnaugh map

2. Expression of logic function by Karnaugh Map

The N variable all the minimum each with a small

box, and the minimum is the logical neighbor (i.e.
two minimum only 1 different values) in the
geometrical position are arranged adjacent, the
graph is called Karnaugh map N the minimum
variable.
Because this method was first proposed by the
American engineer Karnaugh, it was called the
Karnaugh map.
 Four variables
Two variables Three variables

1. The graphics on both sides marked "0" and "1" are the corresponding variable gray
code encoding;
2. Corresponding to the 2 logical variable combination of gray code encoding the
combination of the grid and encoding as "the smallest item “1";
3. The size of the decimal number corresponding to the 3 logical variable gray code
encoding combination is corresponding to the minimum number of;
4. The table contains natural and logical items between the adjacent adjacent. The
table in each row or column of the tail is a logical neighbor.
5 variables （ A 、 B 、 C 、 D 、 E ） minimum items
Eg ： 4-bit Cyclic Gray Code
Decimal number Gray code
0 0000
adjacent adjacent
1 0001
2 0011
3 0010 adjacent

4 0110
5 0111
6 0101 adjac
ent
7 0100
2. Expression of logic function by Karnaugh Map
Since any logic function can be expressed as the
number of minimum sum form, it can be said that an
arbitrary logic function by Karnaugh map.

1. The logic function of the minimum sum of the

form;
2. Fill in "1" on the Kano map corresponding to the
minimum items, fill in "0" or not fill in the rest.
2. Expression of logic function by Karnaugh Map

Eg ： Logic function by Karnaugh map

Y ABCD  AB D  ACD  AB
1. Convert Y as the sum of minimum items
Y ABCD  AB(C  C)D  A(B  B )CD  AB(C  C)(D  D)
ABCD  ABCD  ABCD  ABCD
 ABCD  ABCD  ABCD  ABCD
m1  m4  m6  m8  m9  m10  m11  m15
2. Expression of logic function by Karnaugh Map
According to 4 variables Karnaugh Map, fill in “1” in the
function Y into the map.

Y ABCD  ABCD  ABCD  ABCD  ABCD  ABCD  ABCD  ABCD

m1  m4  m6  m8  m9  m10  m11  m15
Logic
CD
AB 00 01 11 10 Function
00 1 Y

01 1 1

11 1

10 1 1 1 1
4.6.2 Simplification of logic function by
Karnaugh map

Simplification steps :
1.Lay out
3 steps 2.Filling items

3.Draw circles to simplify

 1 ） N=2n grid: minimum items

1. Lay out 2 ） Gray code cyclinc arrangement

3 ） Minimun items

CD
AB 00 01 11 10
Logic adjacent: 00 A BC D A BC D A BCD A BC D
Only one variable
is different
between the 01 ABC D ABC D ABCD ABC D
adjacent two
items.
11 AB C D ABC D ABCD ABC D

10 A BC D A BC D A BCD A BC D
 （ 8421
Minimum item code
According ）
to decimal number : m0 m15

Low bits
CD D
AB 00 01 11 10
High bits
00 m0 m1 m3 m2
01 m4 m5 m7 m6
B
11 m12 m13 m15 m14
A
10 m8 m9 m11 m10

C
2. Filling in items
expressing logic function by karnaugh
map

1)Mininum items are filled into the table

directly
2)Brush items (items included in the common
factor)
 Eg1: Y1 (A, B, C, D) A B  BD  ABD  ABCD  A B
（ C  C)
CD D
AB 00 01 11 10
Common factor: 00
ABD
01 1 1
B
11
A
10

C
 例 1: Y1 (A, B, C, D) A B  BD  ABD  ABCD  A B

Brush D
items ： CD
filling items they A B 00 01 11 10
have common
factors into
proper grids 00

01 1 1
Commom item:
B
BD 11 1 1
A
10

C
Eg1: Y1 (A, B, C, D) A B  BD  ABD  ABCD  A B

CD D
AB 00 01 11 10
00 1 1 1 1

01 1 1
B
11 1 1
A
10 1 1 1 1

C
Eg1: Y1 (A, B, C, D) A B  BD  ABD  ABCD  A B
CD D
AB 00 01 11 10
00 1 1 1 1
01 1 1
B
11 1 1
A
10 1 1 1 1

C
If all the itmes have been filled into the proper
grids, then finished.
3. Draw circles to simplify by Karnaugh
map
Methods: the adjacent square lattices with the value of ‘1’
were rectangular or square, and the adjacent small squares
included the small squares adjacent to the logic.

Note ：
1. Circles are as large as possible, that is, the number of circles should
be minimal, the number of '1's in a circle should be the most ；
2. The number of '1' in a circle should be 2n;
3. When a new circle is added, it must contain at least one '1' that
has not appeared in any circle drawed before;
4. No '1' left, simplification is finished.
例 1: Y1 (A, B, C, D) A B  BD  ABD  ABCD  A B
 Y1 (A, B, C, D) B  D
CD
AB 00 01 11 10
00 1 1 1 1
Common
D：
factor 01 1 1
Common
11 1 1
factor:
B
10 1 1 1 1
Y2 ( A, B, C , D)  AB  BC D  ABD  ABC D

Filling ： CD D
AB 00 01 11 10
00

01 1
B
11 1
A
10 1 1 1 1

C
Y2 ( A, B, C , D)  AB  BC D  ABD  ABC D

CD D
AB 00 01 11 10
00

01 1 1
B
11 1 1 1
A
10 1 1 1 1

C
 Y2 ( A, B, C , D)  AB  BC D  ABD  ABC D
 Y ( A, B, C , D)  AC  AB  BC  AD
2

CD D
AB 00 01 11 10
00
BC
01 1 1
AD B
11 1 1 1
redundant
A
item 10 1 1 1 1
AC
C AB
 Y2 ( A, B, C , D)  AB  BC  AD
Eg2 ： The simplified Y3 is computed by formula. Is it the simplest form?
If not, please simplify it by Karnaugh map.

Y3 ( A, B, C )  AB  AC  AB  BC

C
BC00 01 11 10
A
0 1 1

1 1 1

B
 Y3 ( A, B, C )  AB  AC  AB  BC

C
BC00 01 11 10
A
0 1 1 1

1 1 1 1

B
 Y3 ( A, B, C )  AB  AC  AB  BC

BC
AC
BC00 01 11 10
A
0 1 1 1

1 1 1 1

AB
 Y3 ( A, B, C )  AB  AC  BC
 Y3 ( A, B, C )  AB  AC  AB  BC
 Y3 ( A, B, C )  AB  AC  BC 
BC AB
BC00 01 11 10
A
0 1 1 1

1 1 1 1

AC  Y3 ( A, B, C )  AC  BC  AB
 BC
A 00 01 11 10
0 1 1 1

1 1 1 1
Y3 ( A, B, C )  AB  AC  BC
BC
A 00 01 11 10
0 1 1 1

1 1 1 1
Y3 ( A, B, C )  AC  BC  AB

Note:the final result is not unique.

Eg3 ：
Simplification F(A,B,C,D)=m(0,2,3,5,6,8,9,10,1
1, 12,13,14,15)
CD
00 01 11 10
AB
00 1 0 1 1
01 0 1 0 1
11 1 1 1 1
10 1 1 1 1
Eg3: F(A,B,C,D)=m(0,2,3,5,6,8,9,10,11,
12,13,14,15)
CD
00 01 11 10 BC
AB
00 1 0 1 1
BCD
01 0 1 0 1 CD
11 1 1 1 1
BD A
10 1 1 1 1

F  A  CD  BC  B D  BCD
Note ：
1. Each circle should contain as many '1's as
possible, at the same time, avoid redundant
items.

2. The final results are different because of the

circles drew are different.
 Conclusion
• 4.1Number & code • 4.4 Logic function and
system its expressions
– Binary,decimal, – Truth table&function
hexdecimal, octal – diagram&Karnaugh
– BCD,Gray code map
• 4.2 Basic operations • 4.5 Simplification
– Basic operations: logic function by rules
AND,OR, NOT
– Compound • 4.6 Simplification
operations ： logic function by
NAND,NOR,XOR, Karnaugh map
Clusive OR – Master 2,3,4 virables
• 4.3 Basic fomular and simplification by
rules in logic algebra Karnaugh map
 Quiz
Please use Karnaugh Map to simplify the
following logic functions.
 Practices for Karnaugh map
Please use Karnaugh Map to simplify the following functions.

1.Y ( A, B, C , D )  AB  BC D  ABD  ABCD

2. Y ( A, B, C , D)  m (1, 4, 6,8, 9,10,11,13,15)

3. Y ( A, B, C , D)  ( m1 , m2 , m4 , m7 , m8 , m9 , m12 , m15 )

4. Y ( A, B, C ) ( m1, m2 , m4 , m5 , m6 , m7 )

5. Y ( A, B, C )  AB  AC  AB  BC
1.Y ( A, B, C , D )  AB  BC D  ABD  ABCD

 AB  AC  BC  AD 2. Y ( A, B, C , D)  m (1,4,6,8,9,10,11,13,15)
 AB  AD  BCD  BCD  ABCD
CD CD
00 01 11 10 00 01 11 10
AB AB
00 00 1
01 1 1 01 1 1
11 1 1 1 11 1 1
10 1 1 1 1 10 1 1 1 1
3. Y ( A, B, C , D) ( m1, m2 , m4 , m7 , m8 , m9 , m12 , m15 )
 ABC  BC D  BCD  BCD  ABC D

CD
00 01 11 10
AB
00 1 1
01 1 1
11 1 1
10 1 1
 BC
A 00 01 11 10
4. Y ( A, B, C ) ( m1 , m2 , m4 , m5 , m6 , m7 )
0 1 1  A  BC  BC

1
1 1 1 1

BC
A 00 01 11 10
5. Y ( A, B, C )  AB  AC  AB  BC
0 1 1 1  A  B  C

1 1 1 1 1