Draft notes or 22C: 040

Simplification of Boolean functions

Example 1

= = = =

A.B + A.B + B.C A. (B + B) + B.C A.1 + B.C A + B.C How many gates do you save from this simplification?

B B F C

Draft notes or 22C: 040

Example 2 F = = = = = A.B.C + A.B.C + A.B.C + A.B.C A.B.C + A.B.C + A.B.C + A.B.C + A.B.C + A.B.C (A.B.C + A.B.C) + (A.B.C + A.B.C) + (A.B.C + A.B.C) (A + A). B.C + (B + B). C.A + (C + C). A.B B.C + C.A + A.B

Example 3

Show that A + A.B = A

A + AB = = = = A.1 + A.B A. (1 + B) A. 1 A

Draft notes or 22C: 040

Simplification using Karnaugh Maps

A B 1 0 0 0 1 1 1 1 K-map of 2-variable OR function

BC A 0 1 1 00 01 11 1 1 1 K-map of majority function 10

Follow the class lectures to understand how to simplify Boolean functions using K-maps. Several examples will be worked out in the class.

Draft notes or 22C: 040

Other types of gates

A A.B B

A B A+B

NAND gate

NOR gate

Be familiar with the truth tables of these gates.

A B A + B = A.B + A.B

Exclusive OR (XOR) gate

Draft notes or 22C: 040

NAND and NOR are universal gates

Any function can be implemented using only NAND or only NOR gates. How can we prove this?

(Proof for NAND gates)

Any boolean function

can be implemented using AND, OR and NOT gates. So if AND, OR and NOT gates can be implemented using NAND gates only, then we prove our point.

1. Implement NOT using NAND

Draft notes or 22C: 040

2. Implementation of AND using NAND

A B

A.B A

1. Implementation of OR using NAND

A.B = A+B B B

(Exercise) Prove that NOR is a universal gate.

Draft notes or 22C: 040

Example (to be worked out in class) How to convert any circuit that uses AND, OR and NOT gates to a version that uses NAND (or NOR gates only)?

Additional properties of XOR XOR is also called modulo-2 addition. Why?

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

F 0 1 1 0 1 0 0 1

A B = 1 only when there are an odd number of 1s in (A,B). The same is true for A B C also.

1 0

A=A A=A

Why?

Draft notes or 22C: 040

Logic Design Exercise

Half Adder

A A B
Half Adder

B 0 1 0 1

S 0 1 1 0

C 0 0 0 1

Sum (S) Carry (C)

0 0 1

S=A C = A.B

A S B C

Draft notes or 22C: 040

Full Adder

Sum (S) A B Cin Full Adder Carry (Cout)

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

S 0 1 1 0 1 0 0 1

Cout 0 0 0 1 0 1 1 1

S=A

Cin

Cout = A.B + B.Cin + A.Cin

How can you add two 32-bit numbers? It will be discussed in the class.

10

Draft notes or 22C: 040

Combinational vs. Sequential Circuits

Combinational circuits. The output depends only on the current values of the inputs and not on the past values. Examples are adders, subtractors, and all the circuits that we have studied so far

Sequential circuits. The output depends not only on the current values of the inputs, but also on their past values. These hold the secret of how to memorize information. We will study sequential circuits later.

11

Draft notes or 22C: 040

Decoders

A typical decoder has n inputs and 2 outputs.

Enable D0 A B D1 D2 D3

A 0 0 1 1

B 0 1 0 1

D3 D2 D1 0 0 0 1 0 0 1 0 0 1 0 0

D0 1 0 0 0

A 2-to-4 decoder and its truth table.

D3 = A.B D2 = A.B D1 = A.B D0 = A.B

Draw the circuit of this decoder.

The decoder works per specs when (Enable = 1). When Enable = 0, all the outputs are 0.

Exercise.

Design a 3-to-8 decoder.

Draft notes or 22C: 040

Encoders
A typical encoder has 2 inputs and n outputs.
n

D0 D1 D0 D1 D2 D3 A B 1 0 0 0 0 1 0 0

D2 D3 A 0 0 1 0 0 0 0 1 0 0 1 1

B 0 1 0 1

A 4-to-2 encoder and its truth table.

A = D1 + D3 B = D2 + D3

13

Draft notes or 22C: 040

Multiplexor

It is a many-to-one switch, also called a selector.

A B

0 1

S = 0, F = A S = 1, F = B

Control S

Specifications of the mux

A 2-to-1 mux

F = S. A + S. B

Exercise.

Design a 4-to-1 mux.

14

Draft notes or 22C: 040

Another design of a decoder

A B C D
D0 D1 D2 D3
2-to-4 decoder

Exercise 1. Design a 2-to-4 decoder using 1-to-2 decoders only. Exercise 2. Design a 4-to-1 multiplexor using 2-1 multiplexors only.

To be discussed in the class.

15

Draft notes or 22C: 040

Demultiplexors

A demux is a one-to-many switch.

X Y

S = 0, X = A S = 1, Y = B

A
1

A 1-to-2 demux, and its specification.

So, X = S. A, and Y = S. B

Exercise.

Design a 1-4 demux.

We will discuss the design of a 1-bit ALU in class.

16