Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks

In this paper we propose a further development of compaction procedure of based on decomposition tree. The goal of the development is to simplify a decomposition tree, in other words to reduce the number Local Don´t Care sets (LDCs). A simplification is achieved due to an introduction of iteration step in the process of decomposition tree creation.