 • Temperature Indicator

#### Design Challenge 3

In this challenge you will be asked to build and minimize a combinational circuit using K-Map that outputs a signal when temperature is in a specific range.

4.10K
• Logic Minimization

#### Introduction to K-maps

Truth tables are not very useful for minimizing logic systems, and Boolean algebra has limited utility. Logic graphs offer the easiest and most useful pen-and-paper method of minimizing a logic system.

16.3K
• Logic Minimization

#### K-maps with Don't Cares

Situations can arise where a circuit has N input signals, but not all 2N combinations of inputs are possible. Or, if all 2N combinations of inputs are possible, some combinations might be irrelevant.

7.43K
• Logic Minimization

#### K-maps with Entered Variables

Entered variable maps simplify the process further by visually minimizing a K-map. The compression of the map makes a multi-variable system much easier to visualize and minimize.

23.4K
Temperature Indicator

#### Design Challenge 3

In this challenge you will be asked to build and minimize a combinational circuit using K-Map that outputs a signal when temperature is in a specific range.

4.10K
×
Logic Minimization

#### Introduction to K-maps

Truth tables are not very useful for minimizing logic systems, and Boolean algebra has limited utility. Logic graphs offer the easiest and most useful pen-and-paper method of minimizing a logic system.

16.3K
×
Logic Minimization

#### K-maps with Don't Cares

Situations can arise where a circuit has N input signals, but not all 2N combinations of inputs are possible. Or, if all 2N combinations of inputs are possible, some combinations might be irrelevant.

7.43K
×
Logic Minimization

#### K-maps with Entered Variables

Entered variable maps simplify the process further by visually minimizing a K-map. The compression of the map makes a multi-variable system much easier to visualize and minimize.

23.4K
×