Logical minimization of multilevel coded functions

Since parallel-input/parallel-output optical truth-table-lookup processors can be constructed based on holographic content-addressable memories, it is essential to know the minimum storage required to implement various functions. A new simple method for reducing multivalued functions is presented. The Quine-McCluskey minimization method used for binary logic functions is applied to the truth tables representing modified signed-digit addition, residue addition, and residue multiplication. A programmable logic-array gate configuration for the modified signed-digit adder is presented. (Author)