Non-disjoint decomposition of Boolean functions and its application in FPGA-oriented technology mapping
Mariusz Rawski, L. Jóźwiak, M. Nowicka, Tadeusz Łuba · 2002
We present a new theory of non-disjoint serial decomposition. We also present our new decomposition tool DEMAIN. The decomposition approach implemented in DEMAIN relies on: a partition-based representation of Boolean functions; and an effective balanced decomposition strategy that switches between the parallel and non-disjoint serial decomposition. In consequence, we applied the non-disjoint serial decomposition and parallel decomposition for efficient synthesis of FPGA-based circuits directed towards area or delay optimisation.