MINTERMMiniature Terminal
References in periodicals archive ?
h] = Number of the number of minterm matching (hits) between the truth table of the given function and truth table obtained for the same function and [N.
This is based on the assumption that each minterm (rather than an implicant) can be represented as a gene.
In synthesizing a given MVL function we use ants to select the next most appropriate minterm to cover and the least expensive implicant to cover that same minterm.
Two values are needed by any ant in selecting the next minterm to cover.
Where tm represents the pheromone value of minterm M and r|M represents the heuristic value of minterm M.
The outermost loop is controlled by the number of runs allowed (r), the next outer loop is controlled by the number of ants (a), and the innermost loop is used to select the next minterm (M) and the appropriate implicant to cover it (L).
n] [right arrow] {0,1} we have s(f) [greater than or equal to] bs(f)/k, where k is the size of the minterm.
Also let us assume that k [greater than or equal to] 2 as if the size of the minterm is 1 then then the function becomes trivial with s(f) = bs(f) = n.
Now that minterm can intersect at most (k [right arrow] 1) other blocks.
And B\A must have have at least one bit from all the blocks because if any block is switched fully then a minterm is formed because the minterm does not intersect any other block.
2 uses the fact that all the minterms of the Boolean function have more than k/2 number of 0 or all of them more than k/2 number of 1.
6 the fact that is used is that all the minterms are of support less than k.