Method of translating Boolean algebra into basic algebra
First Claim
Patent Images
1. A method implemented by a computer for translating Boolean algebra into basic algebra, comprising:
- (a) assigning signal values s0 and s1 to variables, preferably {s0,s1}={0,1}; and
(b) substituting respectively the words “
s0+(a−
s0)(b−
s0)/(s1−
s0)”
, “
s1−
(a−
s1)(b−
s1)/(s1−
s0)”
, and “
s0+s1−
a”
written in basic algebra for the words “
intersection of A and B”
, “
union of A and B”
, and “
complement of A”
written in Boolean algebra, so as to translate expressions of Boolean algebra into expressions of basic algebra, which can then be simplified and evaluated in the usual straightforward manner.
0 Assignments
0 Petitions
Accused Products
Abstract
Substituting words written in basic algebra for equivalent words written in Boolean algebra so as to translate Boolean algebra into basic algebra; more generally, summing combinational identity functions factored by their corresponding output values to convert a gate table into basic algebra. The resulting expressions of basic algebra can be simplified and evaluated in the usual straightforward manner.
-
Citations
3 Claims
-
1. A method implemented by a computer for translating Boolean algebra into basic algebra, comprising:
-
(a) assigning signal values s0 and s1 to variables, preferably {s0,s1}={0,1}; and (b) substituting respectively the words “
s0+(a−
s0)(b−
s0)/(s1−
s0)”
, “
s1−
(a−
s1)(b−
s1)/(s1−
s0)”
, and “
s0+s1−
a”
written in basic algebra for the words “
intersection of A and B”
, “
union of A and B”
, and “
complement of A”
written in Boolean algebra, so as to translate expressions of Boolean algebra into expressions of basic algebra, which can then be simplified and evaluated in the usual straightforward manner.
-
-
2. A method implemented by a computer for converting gate tables into basic algebra, comprising:
-
(a) assigning a signal identity function for each input data entry in a given row of a gate table as required to assign a combinational identity function for the given row in step (b); (b) assigning a combinational identity function and factoring it by its corresponding output value for each row of input data in the gate table; and (c) summing combinational identity functions factored by their corresponding output values for each row in the gate table.
-
-
3. A shortcut method implemented by a computer for converting gate tables with binary output into basic algebra, comprising:
-
(a) assigning a signal identity function for each input data entry in a given row of a gate table as required to assign a combinational identity function for the given row in step (b); (b) assigning a combinational identity function either for each row of input data in the gate table with output so or for each row with output s1; and (c) summing combinational identity functions either for rows in the gate table with output s0 or for rows with output s1, such that if rows with output s0 are selected, the sum is factored by the quantity (s0−
s1) and s1 is added to the result, or if rows with output s1 are selected, the sum is factored by the quantity (s1−
s0) and s0 is added to the result.
-
Specification