Merging of cubes of distinct weights to minimize a multivalued logic function

A method amenable to computer programming is presented for minimizing the total amount of hardware required for realizing a partially specified multivalued logic function. The method modifies the Pomper-Armstrong algorithm (1981) for obtaining a direct cover for the function in three distinct ways. Then it extends each extendable cube in the cover toward every one of its vertices, whenever possible, so as to excite it maximally. Finally, instead of realizing a cube in the cover individually, it attempts to realize a number of cubes collectively whenever they have some specified properties. The proposed method yields an almost-minimal circuit