Use of Multiwrite for General Programmability of Search Memories

Abstract

Multiwrite (selective writing in words which satisfied a previous search) is shown to permit parallel evaluation of any Boolean function (including arithmetic) in a search memory. A general method is given which expresses the Boolean function as a sum of products, searches for these products one at a time and OR8 the results of these searches. An example applying the process to arithmetic given.