Harvard Chart Method
Harvard Chart Method of Logical Equation Reduction[1][2] was developed to address the need to automate the process of logical equation reduction in the early days of computer hardware and switching circuit development. Large scale production of computer circuitry entailed many more variables than could be reasonably handled by manual methods using Boolean logic, Venn diagrams, etc. Automated methods of logical equation reduction were necessary to minimize logic circuits and thereby reduce the number of logic gates which used vacuum tubes as switches due to their relatively high cost and excessive thermal emission.
The Harvard Chart Method of logical equation reduction is capable of reducing binary logical equations having five or more variables to minimum form. As the number of variables increase, the number of operations required to minimize a logical equation increases exponentially, placing practical limits on performing logical equation reduction by hand. The Harvard Chart Method was developed to solve this problem by using a computerized method to automate the process of logical reduction. The method represents one of the first instances where computers were able to assist in the design of the circuits of which they are made. Application of this method is limited only by the logical speed and size of the computer (or computer network) on which it is run. A method based on the Harvard Chart Method has since been developed to reduce multi-valued logical equations to minimum form.
Logical Equation Reduction, Simplification or Minimization
[edit | edit source](note this chart uses upper case to represent the logic state of "TRUE" and lower case to represent the logic state of "FALSE"
Lets simplify the following equation:
f = ABc + ABC + aBC + aBc + AbC
The Harvard Chart (style 1)
[edit | edit source]
The Harvard Chart (style 2)
[edit | edit source]The Harvard Chart 1 2 3 4 5 6 7 A B C AB AC BC ABC a b c ab ac bc abc Row1 a b C ab aC bC abC Row2 a B c aB ac Bc aBc Row3 a B C aB aC BC aBC Row4 A b c Ab Ac bc Abc Row5 A b C Ab AC bC AbC Row6 A B c AB Ac Bc ABc Row7 A B C AB AC BC ABC Row8
The Reduction Steps
[edit | edit source]- Draw a line through all rows whose terms are not contained in the expression being simplified (rows 1,2 and 5).
- Starting with the left column (column 1) cross out all terms which have been lined out in step 1. (a is lined out in rows 1 and 2, and A in row 5; thus, all terms are lined out in the left column of this example.)
- In column 2 only b (lower case) is eliminated. Circle all B's for easy identification as a part of the final answer.
- Going to the right, cross out all terms containing B in all the rows with a circled B. For example, in row 4 the terms AB, BC, and aBC are lined out.
- Continue with lines 3 and 4.
- In column 5 the term AC is not crossed out, so it must be circled.
- Going to the right in rows containing AC, cross out all other terms containing AC.
- All terms in columns 6 and 7 (column BC and ABC) are now crossed out and the process ends. Only B and AC are left.
- Therefore the answer is: f = B + AC
See Also
[edit | edit source]See Table of logic symbols for explanations of symbols used in logic.
Notes and References
[edit | edit source]- ↑ *Hunter, William L. [10-1975]. Chapter 4, "The Laws of Logic, Boolean Equation Simplification - The Harvard Chart". Digital/Logic electronics Handbook(in English), pp.112-113, Blue Ridge summit, PA 17214: Tab Books / No. 774, 1975. ISBN 0-8306-5774-6, ISBN 0-8306-4774-0
- ↑ Moved from original location in Wikipedia Harvard Chart Method of Logical Equation Reduction to Wikibooks by "author request, no substantial contributions by anyone else"