Search For:

Displaying 1-3 out of 3 total
A reduction technique for prime implicant tables
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By James F. Gimpel
Issue Date:November 1964
pp. 183-191
Solving prime implicant tables is greatly facilitated by reduction techniques such as row dominance, column dominance and essential row selection. This paper presents a new reduction technique which is operable on any otherwise irreducible table having a c...
 
The synthesis of TANT networks
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By James F. Gimpel
Issue Date:October 1965
pp. 105-125
This paper presents an algorithm for finding, for any given Boolean function, a least cost three-level AND-NOT network having uncomplemented inputs where the cost criterion is the number of gates. The approach taken is similar to the Quine-MeCluskey algori...
 
The minimization of spatially-multiplexed character sets
Found in: Communications of the ACM
By James F. Gimpel
Issue Date:June 1974
pp. 315-318
The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques are developed, and th...
     
 1