EE101: Digital circuits (Part 1)

M. B. Patil
[email protected] Department of Electrical Engineering Indian Institute of Technology Bombay

M. B. Patil, IIT Bombay

Digital circuits

1
high low

analog signal

digital signal

M. B. Patil, IIT Bombay

Digital circuits

1
high low

analog signal

digital signal

* For an analog signal x (t ), the actual value (a real number) at a given time is important.

M. B. Patil, IIT Bombay

Digital circuits

1
high low

analog signal

digital signal

* For an analog signal x (t ), the actual value (a real number) at a given time is important. * A digital signal, on the other hand, is binary in nature, i.e., it takes on only two values: low (0) or high (1).

M. B. Patil, IIT Bombay

Digital circuits

1
high low

analog signal

digital signal

* For an analog signal x (t ), the actual value (a real number) at a given time is important. * A digital signal, on the other hand, is binary in nature, i.e., it takes on only two values: low (0) or high (1). * Although we have shown 0 and 1 as constant levels, in reality, that is not required. Any value in the low (high) band will be interpreted as 0 (1) by digital circuits.

M. B. Patil, IIT Bombay

Digital circuits

1
high low

analog signal

digital signal

* For an analog signal x (t ), the actual value (a real number) at a given time is important. * A digital signal, on the other hand, is binary in nature, i.e., it takes on only two values: low (0) or high (1). * Although we have shown 0 and 1 as constant levels, in reality, that is not required. Any value in the low (high) band will be interpreted as 0 (1) by digital circuits. * The denition of low and high bands depends on the technology used, such as TTL (Transitor-Transitor Logic), CMOS (Complementary MOS), ECL (Emitter-Coupled Logic), etc.

M. B. Patil, IIT Bombay

A simple digital circuit

VCC
4

Vo (Volts)

RC
C

3 2 1 0

Vo

RB Vi
B E

Vi (Volts)

M. B. Patil, IIT Bombay

A simple digital circuit

VCC
4

Vo (Volts)

RC
C

3 2 1 0

Vo

RB Vi
B E

Vi (Volts)

* If Vi is low (0), Vo is high (1). If Vi is high (1), Vo is low (0).

M. B. Patil, IIT Bombay

A simple digital circuit

VCC
4

Vo (Volts)

RC
C

3 2 1 0

Vo

RB Vi
B E

Vi (Volts)

* If Vi is low (0), Vo is high (1). If Vi is high (1), Vo is low (0). * The circuit is called an inverter because it inverts the logic level of the input. If the input is 0, it makes the output 1, and vice versa.

M. B. Patil, IIT Bombay

A simple digital circuit

VCC
4

Vo (Volts)

RC
C

3 2 1 0

Vo

RB Vi
B E

Vi (Volts)

* If Vi is low (0), Vo is high (1). If Vi is high (1), Vo is low (0). * The circuit is called an inverter because it inverts the logic level of the input. If the input is 0, it makes the output 1, and vice versa. * Digital circuits are made using a variety of devices. The simple BJT inverter we have shown should only be considered as an illustrative circuit.

M. B. Patil, IIT Bombay

A simple digital circuit

VCC
4

Vo (Volts)

RC
C

3 2 1 0

Vo

RB Vi
B E

Vi (Volts)

* If Vi is low (0), Vo is high (1). If Vi is high (1), Vo is low (0). * The circuit is called an inverter because it inverts the logic level of the input. If the input is 0, it makes the output 1, and vice versa. * Digital circuits are made using a variety of devices. The simple BJT inverter we have shown should only be considered as an illustrative circuit. * Most of the VLSI circuits today employ the MOS technology because of the high packing density and low power consumption it oers.

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

* A major advantage of digital systems is that, even if the original data gets distorted (e.g., in transmitting through optical bre or storing on a CD) due to noise, attenuation, etc., it can be retrieved easily.

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

* A major advantage of digital systems is that, even if the original data gets distorted (e.g., in transmitting through optical bre or storing on a CD) due to noise, attenuation, etc., it can be retrieved easily. * There are several other benets of using digital representation:

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

* A major advantage of digital systems is that, even if the original data gets distorted (e.g., in transmitting through optical bre or storing on a CD) due to noise, attenuation, etc., it can be retrieved easily. * There are several other benets of using digital representation: - can use computers to process the data.

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

* A major advantage of digital systems is that, even if the original data gets distorted (e.g., in transmitting through optical bre or storing on a CD) due to noise, attenuation, etc., it can be retrieved easily. * There are several other benets of using digital representation: - can use computers to process the data. - can store in a variety of storage media.

M. B. Patil, IIT Bombay

Digital circuits

V1

V2 Vref

V2 V3 Vref

V3

t original data corrupted data

comparator recovered data

* A major advantage of digital systems is that, even if the original data gets distorted (e.g., in transmitting through optical bre or storing on a CD) due to noise, attenuation, etc., it can be retrieved easily. * There are several other benets of using digital representation: - can use computers to process the data. - can store in a variety of storage media. - can program the functionality. For example, the behaviour of a digital lter can be changed simply by changing its coecients.

M. B. Patil, IIT Bombay

Logical operations

Operation

NOT

AND

OR

Gate

Truth table

Notation

Logical operations

Operation

NOT

AND

OR

Gate

X Truth table 0 1

Y 1 0

Notation

Y=A

Logical operations

Operation

NOT

AND

OR

Gate

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

X Truth table 0 1

Y 1 0

0 0 1 1

Notation

Y=A

Y= AB = AB

Logical operations

Operation

NOT

AND

OR

Gate

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

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

X Truth table 0 1

Y 1 0

0 0 1 1

Notation

Y=A

Y= AB = AB

Y=A+B

M. B. Patil, IIT Bombay

Logical operations

Operation

NAND

NOR

XOR

Gate

Truth table

Notation

Logical operations

Operation

NAND

NOR

XOR

Gate

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

Truth table

0 1 1

Notation

Y= AB = AB

Logical operations

Operation

NAND

NOR

XOR

Gate

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

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

Truth table

0 1 1

Notation

Y= AB = AB

Y= A+B

Logical operations

Operation

NAND

NOR

XOR

Gate

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

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

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

Truth table

0 1 1

Notation

Y= AB = AB

Y= A+B

Y=AB = AB + AB

M. B. Patil, IIT Bombay

Logical operations

* The AND operation is commutative. A B = B A.

M. B. Patil, IIT Bombay

Logical operations

* The AND operation is commutative. A B = B A. * The AND operation is associative. (A B ) C = A (B C ).

M. B. Patil, IIT Bombay

Logical operations

* The AND operation is commutative. A B = B A. * The AND operation is associative. (A B ) C = A (B C ). * The OR operation is commutative. A + B = B + A.

M. B. Patil, IIT Bombay

Logical operations

* The AND operation is commutative. A B = B A. * The AND operation is associative. (A B ) C = A (B C ). * The OR operation is commutative. A + B = B + A. * The OR operation is associative. (A + B ) + C = A + (B + C ).

M. B. Patil, IIT Bombay

Boolean algebra (George Boole, 1815-1864)

* Theorem: A = A.

M. B. Patil, IIT Bombay

Boolean algebra (George Boole, 1815-1864)

* Theorem: A = A. The theorem can be proved by constructing a truth table: A 0 1 A 1 0 A 0 1

M. B. Patil, IIT Bombay

Boolean algebra (George Boole, 1815-1864)

* Theorem: A = A. The theorem can be proved by constructing a truth table: A 0 1 A 1 0 A 0 1

Therefore, for all possible values that A can take (i.e., 0 and 1), A is the same as A. A = A.

M. B. Patil, IIT Bombay

Boolean algebra (George Boole, 1815-1864)

* Theorem: A = A. The theorem can be proved by constructing a truth table: A 0 1 A 1 0 A 0 1

Therefore, for all possible values that A can take (i.e., 0 and 1), A is the same as A. A = A. * Similarly, the following theorems can be proved: A+0=A A+1=1 A+A=A A+A=1 A1=A A0=0 AA=A AA=0

M. B. Patil, IIT Bombay

Boolean algebra (George Boole, 1815-1864)

* Theorem: A = A. The theorem can be proved by constructing a truth table: A 0 1 A 1 0 A 0 1

Therefore, for all possible values that A can take (i.e., 0 and 1), A is the same as A. A = A. * Similarly, the following theorems can be proved: A+0=A A+1=1 A+A=A A+A=1 A1=A A0=0 AA=A AA=0

Note the duality: (+ ) and (1 0).

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B

A+B

AB

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B

AB

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

AB

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

AB

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B .

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B . * Similiarly, A B = A + B .

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B . * Similiarly, A B = A + B . * Similar relations hold for more than two variables, e.g.,

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B . * Similiarly, A B = A + B . * Similar relations hold for more than two variables, e.g., A B C = A + B + C,

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B . * Similiarly, A B = A + B . * Similar relations hold for more than two variables, e.g., A B C = A + B + C, A + B + C + D = A B C D,

M. B. Patil, IIT Bombay

De Morgans theorems

A 0 0 1 1

B 0 1 0 1

A+B 0 1 1 1

A+B 1 0 0 0

A 1 1 0 0

B 1 0 1 0

AB 1 0 0 0

AB 0 0 0 1

AB 1 1 1 0

A+B 1 1 1 0

* Comparing the truth tables for A + B and A B , we conclude that A + B = A B . * Similiarly, A B = A + B . * Similar relations hold for more than two variables, e.g., A B C = A + B + C, A + B + C + D = A B C D, (A + B ) C = (A + B ) + C .

M. B. Patil, IIT Bombay

Distributive laws

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

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C A (B + C ) AB AC AB + AC

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) AB AC AB + AC

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) 0 0 0 0 0 1 1 1 AB AC AB + AC

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) 0 0 0 0 0 1 1 1 AB 0 0 0 0 0 0 1 1 AC AB + AC

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) 0 0 0 0 0 1 1 1 AB 0 0 0 0 0 0 1 1 AC 0 0 0 0 0 1 0 1 AB + AC

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) 0 0 0 0 0 1 1 1 AB 0 0 0 0 0 0 1 1 AC 0 0 0 0 0 1 0 1 AB + AC 0 0 0 0 0 1 1 1

M. B. Patil, IIT Bombay

Distributive laws

1. A (B + C ) = A B + A C . 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 B +C 0 1 1 1 0 1 1 1 A (B + C ) 0 0 0 0 0 1 1 1 AB 0 0 0 0 0 0 1 1 AC 0 0 0 0 0 1 0 1 AB + AC 0 0 0 0 0 1 1 1

M. B. Patil, IIT Bombay

Distributive laws

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

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC A+BC A+B A+C (A + B ) ( A + C )

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC A+B A+C (A + B ) ( A + C )

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC 0 0 0 1 1 1 1 1 A+B A+C (A + B ) ( A + C )

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC 0 0 0 1 1 1 1 1 A+B 0 0 1 1 1 1 1 1 A+C (A + B ) ( A + C )

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC 0 0 0 1 1 1 1 1 A+B 0 0 1 1 1 1 1 1 A+C 0 1 0 1 1 1 1 1 (A + B ) ( A + C )

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC 0 0 0 1 1 1 1 1 A+B 0 0 1 1 1 1 1 1 A+C 0 1 0 1 1 1 1 1 (A + B ) ( A + C ) 0 0 0 1 1 1 1 1

M. B. Patil, IIT Bombay

Distributive laws

2. A + B C = (A + B ) (A + C ). 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 BC 0 0 0 1 0 0 0 1 A+BC 0 0 0 1 1 1 1 1 A+B 0 0 1 1 1 1 1 1 A+C 0 1 0 1 1 1 1 1 (A + B ) ( A + C ) 0 0 0 1 1 1 1 1

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches:

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches: (a) Construct truth tables for LHS and RHS for all possible input combinations, and show that they are the same.

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches: (a) Construct truth tables for LHS and RHS for all possible input combinations, and show that they are the same. (b) Use identities and theorems stated earlier to show that LHS=RHS.

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches: (a) Construct truth tables for LHS and RHS for all possible input combinations, and show that they are the same. (b) Use identities and theorems stated earlier to show that LHS=RHS. A + AB = A 1 + A B = A (1 + B ) = A (1) =A

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches: (a) Construct truth tables for LHS and RHS for all possible input combinations, and show that they are the same. (b) Use identities and theorems stated earlier to show that LHS=RHS. A + AB = A 1 + A B = A (1 + B ) = A (1) =A * A (A + B ) = A .

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A. To prove this theorem, we can follow two approaches: (a) Construct truth tables for LHS and RHS for all possible input combinations, and show that they are the same. (b) Use identities and theorems stated earlier to show that LHS=RHS. A + AB = A 1 + A B = A (1 + B ) = A (1) =A * A (A + B ) = A . Proof: A (A + B ) = A A + A B = A + AB =A

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND.

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ).

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved).

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved). A (A + B ) = A .

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved). A (A + B ) = A . Similarly, consider A + A = 1, with (+ .) and (1 0).

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved). A (A + B ) = A . Similarly, consider A + A = 1, with (+ .) and (1 0). Dual of LHS = A A.

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved). A (A + B ) = A . Similarly, consider A + A = 1, with (+ .) and (1 0). Dual of LHS = A A. Dual of RHS = 0.

M. B. Patil, IIT Bombay

Duality

A + AB = A

A (A + B ) = A .

Note the duality between OR and AND. Dual of A + A B (LHS): A B A + B A + A B A (A + B ). Dual of A (RHS) = A (since there are no operations ivolved). A (A + B ) = A . Similarly, consider A + A = 1, with (+ .) and (1 0). Dual of LHS = A A. Dual of RHS = 0. A A = 0.

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A + B.

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A + B. Proof: A + A B = (A + A) (A + B ) = 1 (A + B ) =A+B Dual theorem: A (A + B ) = A B . (by distributive law)

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A + B. Proof: A + A B = (A + A) (A + B ) = 1 (A + B ) =A+B Dual theorem: A (A + B ) = A B . * A B + A B = A. (by distributive law)

M. B. Patil, IIT Bombay

Useful theorems

* A + A B = A + B. Proof: A + A B = (A + A) (A + B ) = 1 (A + B ) =A+B Dual theorem: A (A + B ) = A B . * A B + A B = A. Proof: A B + A B = A (B + B ) =A1 =A (by distributive law) (by distributive law)

Dual theorem: (A + B ) (A + B ) = A.

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date).

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai.

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C .

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C . However, this actually means, I will be in Mumbai or in Chennai or both.

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C . However, this actually means, I will be in Mumbai or in Chennai or both. Clearly, the English OR is not the same as the logical OR. The correct logical expression would be A = MC + C M .

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C . However, this actually means, I will be in Mumbai or in Chennai or both. Clearly, the English OR is not the same as the logical OR. The correct logical expression would be A = MC + C M . In some cases, a simple logical OR would be ne, e.g., A: You will nd Mr. Tandon or Mr. Gawai in the lab (at this time).

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C . However, this actually means, I will be in Mumbai or in Chennai or both. Clearly, the English OR is not the same as the logical OR. The correct logical expression would be A = MC + C M . In some cases, a simple logical OR would be ne, e.g., A: You will nd Mr. Tandon or Mr. Gawai in the lab (at this time). Dene T : You will nd Mr. Tandon in the lab (at this time). G : You will nd Mr. Gawai in the lab (at this time).

M. B. Patil, IIT Bombay

This or that: exactly which one?

Let A be the statement, I will be in Mumbai or I will be in Chennai (on a certain date). Dene M I will be in Mumbai, and C I will be in Chennai. Simply translating the English OR to logical OR leads to A = M + C . However, this actually means, I will be in Mumbai or in Chennai or both. Clearly, the English OR is not the same as the logical OR. The correct logical expression would be A = MC + C M . In some cases, a simple logical OR would be ne, e.g., A: You will nd Mr. Tandon or Mr. Gawai in the lab (at this time). Dene T : You will nd Mr. Tandon in the lab (at this time). G : You will nd Mr. Gawai in the lab (at this time). In this case, A = T + G is valid.

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met:

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century.

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets).

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century.

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS =T +T +TW +TS

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS =T +T +TW +TS = (T + T W ) + (T + T S )

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS =T +T +TW +TS = (T + T W ) + (T + T S ) = (T + T ) (T + W ) + (T + T ) (T + S )

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS =T +T +TW +TS = (T + T W ) + (T + T S ) = (T + T ) (T + W ) + (T + T ) (T + S ) =T +W +T +S =T +W +S

M. B. Patil, IIT Bombay

A game of words

In an India-Australia match, India will win if one or more of the following conditions are met: (a) Tendulkar scores a century. (b) Tedulkar does not score a century AND Warne fails (to get wickets). (c) Tedulkar does not score a century AND Sehwag scores a century. Let T S W I Tendulkar scores a century. Sehwag scores a century. Warne fails. India wins.

I =T +TW +TS =T +T +TW +TS = (T + T W ) + (T + T S ) = (T + T ) (T + W ) + (T + T ) (T + S ) =T +W +T +S =T +W +S i.e., India will win if one or more of the following hold: (a) Tendulkar strikes, (b) Warne fails, (c) Sehwag strikes.

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

This form is called the sum of products form (sum corresponding to OR and product corresponding to AND).

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

This form is called the sum of products form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for X in a systematic manner:

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

This form is called the sum of products form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for X in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities.

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

This form is called the sum of products form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for X in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities. (2) Tabulate X1 = A B C , etc. Note that X1 is 1 only if A = B = C = 1 (i.e., A = 0, B = 1, C = 0), and 0 otherwise.

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function X of three variables A, B , C : X = A B C +A B C +A B C +A B C X1 +X2 +X3 +X4

This form is called the sum of products form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for X in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities. (2) Tabulate X1 = A B C , etc. Note that X1 is 1 only if A = B = C = 1 (i.e., A = 0, B = 1, C = 0), and 0 otherwise. (3) Since X = X1 + X2 + X3 + X4 , X is 1 if any of X1 , X2 , X3 , X4 is 1; else X is 0. tabulate X .

M. B. Patil, IIT Bombay

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 X2 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 1 X1 X2 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 1 X2 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 1 X3 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 0 0 0 0 1 0 0 0 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 0 0 0 0 1 0 0 0 1 X4 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 0 0 0 0 1 0 0 0 X4 0 0 0 0 0 0 1 0 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 0 0 0 0 1 0 0 0 X4 0 0 0 0 0 0 1 0 1 1 1 1 X

Sum of products form

X = X1 + X2 + X3 + X4 = A B C + A B C + A B C + A B C 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 X1 0 0 1 0 0 0 0 0 X2 0 0 0 1 0 0 0 0 X3 0 0 0 0 1 0 0 0 X4 0 0 0 0 0 0 1 0 X 0 0 1 1 1 0 1 0

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

This form is called the product of sums form (sum corresponding to OR and product corresponding to AND).

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

This form is called the product of sums form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for Y in a systematic manner:

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

This form is called the product of sums form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for Y in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities.

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

This form is called the product of sums form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for Y in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities. (2) Tabulate Y1 = A + B + C , etc. Note that Y1 is 0 only if A = B = C = 0; Y1 is 1 otherwise.

M. B. Patil, IIT Bombay

Logical functions in standard forms

Consider a function Y of three variables A, B , C : Y = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C ) Y1 Y2 Y3 Y4

This form is called the product of sums form (sum corresponding to OR and product corresponding to AND). We can construct the truth table for Y in a systematic manner: (1) Enumerate all possible combinations of A, B , C . Since each of A, B , C can take two values (0 or 1), we have 23 possibilities. (2) Tabulate Y1 = A + B + C , etc. Note that Y1 is 0 only if A = B = C = 0; Y1 is 1 otherwise. (3) Since Y = Y1 Y2 Y3 Y4 , Y is 0 if any of Y1 , Y2 , Y3 , Y4 is 0; else Y is 1. tabulate Y .

M. B. Patil, IIT Bombay

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 Y2 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 Y2 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 0 Y2 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 0 Y3 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 0 Y4 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 Y4 1 1 1 1 1 1 1 0 Y

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 Y4 1 1 1 1 1 1 1 0 0 0 Y 0 0

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 Y4 1 1 1 1 1 1 1 0 Y 0 0 1 1 1 0 1 0

Product of sums form

Y = Y1 Y2 Y3 Y4 = (A + B + C) (A + B + C) (A + B + C) (A + B + C) 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 Y1 0 1 1 1 1 1 1 1 Y2 1 0 1 1 1 1 1 1 Y3 1 1 1 1 1 0 1 1 Y4 1 1 1 1 1 1 1 0 Y 0 0 1 1 1 0 1 0

Note that Y is identical to X (seen two slides back). This is an example of how the same function can be written in two seemingly dierent forms (in this case, the sum-of-products form and the product-of-sums form).

M. B. Patil, IIT Bombay

Standard sum-of-products form

Consider a function X of three variables A, B , C : X = AB C + AB C + AB C

M. B. Patil, IIT Bombay

Standard sum-of-products form

Consider a function X of three variables A, B , C : X = AB C + AB C + AB C This form is called the standard sum-of-products form, and each individual term (consisting of all three variables) is called a minterm.

M. B. Patil, IIT Bombay

Standard sum-of-products form

Consider a function X of three variables A, B , C : X = AB C + AB C + AB C This form is called the standard sum-of-products form, and each individual term (consisting of all three variables) is called a minterm. In the truth table for X , the numbers of 1s is the same as the number of minterms, as we have seen in an example.

M. B. Patil, IIT Bombay

Standard sum-of-products form

Consider a function X of three variables A, B , C : X = AB C + AB C + AB C This form is called the standard sum-of-products form, and each individual term (consisting of all three variables) is called a minterm. In the truth table for X , the numbers of 1s is the same as the number of minterms, as we have seen in an example. X can be rewritten as, X = A B C + A B (C + C ) = A B C + A B.

M. B. Patil, IIT Bombay

Standard sum-of-products form

Consider a function X of three variables A, B , C : X = AB C + AB C + AB C This form is called the standard sum-of-products form, and each individual term (consisting of all three variables) is called a minterm. In the truth table for X , the numbers of 1s is the same as the number of minterms, as we have seen in an example. X can be rewritten as, X = A B C + A B (C + C ) = A B C + A B. This is also a sum-of-products form, but not the standard one.

M. B. Patil, IIT Bombay

Standard product-of-sums form

Consider a function X of three variables A, B , C : X = (A + B + C ) (A + B + C ) (A + B + C )

M. B. Patil, IIT Bombay

Standard product-of-sums form

Consider a function X of three variables A, B , C : X = (A + B + C ) (A + B + C ) (A + B + C ) This form is called the standard product-of-sums form, and each individual term (consisting of all three variables) is called a maxterm.

M. B. Patil, IIT Bombay

Standard product-of-sums form

Consider a function X of three variables A, B , C : X = (A + B + C ) (A + B + C ) (A + B + C ) This form is called the standard product-of-sums form, and each individual term (consisting of all three variables) is called a maxterm. In the truth table for X , the numbers of 0s is the same as the number of maxterms, as we have seen in an example.

M. B. Patil, IIT Bombay

Standard product-of-sums form

Consider a function X of three variables A, B , C : X = (A + B + C ) (A + B + C ) (A + B + C ) This form is called the standard product-of-sums form, and each individual term (consisting of all three variables) is called a maxterm. In the truth table for X , the numbers of 0s is the same as the number of maxterms, as we have seen in an example. X can be rewritten as, X = (A + B + C ) (A + B + C ) (A + B + C ) = (A + B + C ) (A + C + B ) (A + C + B ) = (A + B + C ) (A + C + B B ) = (A + B + C ) (A + C ).

M. B. Patil, IIT Bombay

Standard product-of-sums form

Consider a function X of three variables A, B , C : X = (A + B + C ) (A + B + C ) (A + B + C ) This form is called the standard product-of-sums form, and each individual term (consisting of all three variables) is called a maxterm. In the truth table for X , the numbers of 0s is the same as the number of maxterms, as we have seen in an example. X can be rewritten as, X = (A + B + C ) (A + B + C ) (A + B + C ) = (A + B + C ) (A + C + B ) (A + C + B ) = (A + B + C ) (A + C + B B ) = (A + B + C ) (A + C ). This is also a product-of-sums form, but not the standard one.

M. B. Patil, IIT Bombay

The dont care condition

I want to design a box (with inputs A, B , C , and output S ) which will help in scheduling my appointments. A I am in town, and the time slot being suggested for the appointment is free. B My favourite player is scheduled to play a match (which I can watch on TV). C The appointment is crucial for my business. S Schedule the appointment.

M. B. Patil, IIT Bombay

The dont care condition

I want to design a box (with inputs A, B , C , and output S ) which will help in scheduling my appointments. A I am in town, and the time slot being suggested for the appointment is free. B My favourite player is scheduled to play a match (which I can watch on TV). C The appointment is crucial for my business. S Schedule the appointment. The following truth table summarizes the expected functioning of the box. A 0 1 1 1 B X 0 1 1 C X X 0 1 S 0 1 0 1

M. B. Patil, IIT Bombay

The dont care condition

I want to design a box (with inputs A, B , C , and output S ) which will help in scheduling my appointments. A I am in town, and the time slot being suggested for the appointment is free. B My favourite player is scheduled to play a match (which I can watch on TV). C The appointment is crucial for my business. S Schedule the appointment. The following truth table summarizes the expected functioning of the box. A 0 1 1 1 B X 0 1 1 C X X 0 1 S 0 1 0 1

Note that we have a new entity called X in the truth table.

M. B. Patil, IIT Bombay

The dont care condition

I want to design a box (with inputs A, B , C , and output S ) which will help in scheduling my appointments. A I am in town, and the time slot being suggested for the appointment is free. B My favourite player is scheduled to play a match (which I can watch on TV). C The appointment is crucial for my business. S Schedule the appointment. The following truth table summarizes the expected functioning of the box. A 0 1 1 1 B X 0 1 1 C X X 0 1 S 0 1 0 1

Note that we have a new entity called X in the truth table. X can be 0 or 1 (it does not matter) and is therefore called the dont care condition.

M. B. Patil, IIT Bombay

The dont care condition

I want to design a box (with inputs A, B , C , and output S ) which will help in scheduling my appointments. A I am in town, and the time slot being suggested for the appointment is free. B My favourite player is scheduled to play a match (which I can watch on TV). C The appointment is crucial for my business. S Schedule the appointment. The following truth table summarizes the expected functioning of the box. A 0 1 1 1 B X 0 1 1 C X X 0 1 S 0 1 0 1

Note that we have a new entity called X in the truth table. X can be 0 or 1 (it does not matter) and is therefore called the dont care condition. Dont care conditions can often be used to get a more ecient implementation of a logical function.

M. B. Patil, IIT Bombay