Functional memory type parallel processor architecture for solving combinational problems

We propose a new parallel processor architecture which is suitable for use with current VLSI technology. We term this architecture FMPP (Functional Memory type Parallel Processor architecture). The integration density of this architecture can be increased in accordance with the regular nature of its structure in a manner similar to memory chips. We regard the simple logic function equivalent to the roughly 100 transistors of each RAM word added, as a l-word bit serial processor. We take the memory to be an SIMD parallel computer system consisting of simple processors for many numbers as there are RAM words. This architecture implements a simple parallel algorithm for solving several combinational problems and combinational optimization problems. We call this algorithm a parallel exhaustive search (PRE).