Designing universal logic modules

In this paper we present a new approach to find universal logic modules. We show a technique to calculate logic modules that are able to realize a given set of Boolean functions using Boolean matching operators. Our technique is able to find logic modules with up to 7 inputs in reasonable time. Such logic modules are needed e.g. to act as a function generators in FPGAs but can also be hardwired to allow for efficiency close to ASICs without the need of standard cells.