20
Functional Notation Addendum to Chapter 4

Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

Embed Size (px)

Citation preview

Page 1: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

Functional Notation

Addendum to Chapter 4

Page 2: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

2

Logic Notation SystemsWe have seen three different, but equally powerful, notational systems for describing the behaviour of gates and circuits:

Boolean expressions logic diagrams truth tables

Page 3: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

3

Recall that…Boolean expressions: expressions in Boolean algebra, a mathematical notation for expressing two-valued logic.

This algebraic notation is an elegant and powerful way to demonstrate the activity of electrical circuits.

Page 4: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

4

Recall further that…Logic diagram: A graphical representation of a circuit.

Each type of gate is represented by a specific graphical symbol.

Truth table: A table showing all possible input values and the output values associated with each set of inputs.

Page 5: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

5

A Fourth SystemIn addition to these three, there is another widely

used system of notation for logic.

Functional Notation

Page 6: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

6

Functional Notation… uses a function name followed by a list of arguments in place of the operators used in Boolean Notation.

For example:

A’ becomes NOT(A)

Page 7: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

7

Functional EquivalentsBoolean Notation Functional Notation

X=A’ X=NOT(A)

X=A + B X=OR(A,B)

X=A B X=AND(A,B)

X=(A + B)’ X=NOT(OR(A,B))

X=(A B)’ X=NOT(AND(A,B))

Page 8: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

8

XORXOR must be defined in terms of the 3 logic

primitives: AND, OR, and NOT.

Recall its explanation:

“one or the other and not both”

Page 9: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

9

XORThis translates into Boolean Notation as follows:

“one or the other” and not both

X = (A + B) (A B) ’

Page 10: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

10

XORThe Boolean Notation

X = (A + B) (A B) ’

translates as:

X = AND( OR(A,B), NOT( AND(A,B)))in Functional Notation.

Page 11: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

11

XORThe truth table for XOR

reveals a hint for simplifying our expression.

A B XOR0 0 0

0 1 1

1 0 1

1 1 0

Page 12: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

12

XORNote that XOR is False (0)

when A and B are the same, and True (1) when they are different.

A B XOR0 0 0

0 1 1

1 0 1

1 1 0

Page 13: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

13

XORSo XOR can be expressed very simply as:

X=NOT(A=B)or

X=A<>B

Page 14: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

14

XORNotice that this expression is not

strictly functional since it uses the ‘not equal’ operator.

However, we’re more interested in implementing logic in Excel, than strict Functional Notation.

Page 15: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

15

Consider this familiar circuit

How can this circuit be expressed in Functional Notation?

Page 16: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

16

Equivalent expressionsRecall the Boolean expression for the

circuit:

X=(AB + AC)

Page 99

Page 17: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

17

Equivalent expressionsReplace the most “internal” operators

with functional expressions:

X=(AB + AC)

AND(A,B) AND(A,C)

Page 18: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

18

Equivalent expressionsNow replace the “external” operators,

working “outwards”:

X=(AB + AC)

X=OR(AND(A,B), AND(A,C))

Page 19: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

19

The equivalent circuit

Page 20: Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems We have seen three different, but equally powerful, notational systems for describing

20

The equivalent circuitThe Boolean expression:

X = A (B + C)

X = AND(A, OR(B,C))

and its Functional equivalent.