TABLE OF CONTENTS The ANDing operation has precedence over the ORing operation. For instance, the Boolean expression AB+C implies that A must first be ANDed with B and the result must be ORed with C.
Timing diagrams are waveforms showing changing outputs with changing inputs.
A Karnaugh map, or simply a K-map, is a matrix of squares. In general, a Boolean expression with n variables can be represented by a K-map of 2 n squares where each square represents a row of an equivalent truth table. A K-map provides a very powerful method of reducing Boolean expressions to their simplest forms. To use a K-map effectively, we must follow the procedures below.
Each square with a 1 in it must be included at least once in the combinations of the squares which were selected. However, a particular square may be included in more than one combination of squares if it can be combined with other squares.
The number of squares to be combined must be a power of 2, i.e., squares can be combined in groups of two, four, eight, and so on squares.
Each combination should be selected to include the highest possible number of squares.
Quite often, we do not care if a variable represents a logical 1 or a logical 0. In this case it is convenient to represent that variable as a don t care usually with the letter X. Don t care conditions allow us to obtain simpler Boolean...
