Abstract
In this paper we present a heuristic technique of the iterative decomposition of incompletely specified multipleoutput Boolean functions. Its main contribution is that the bottom-up synthesis of MTBDD does not require knowledge of optimum ordering of variables, because the order of variables is generated concurrently. Obtained MTBDDs can be used in hardware (LUT cascades), firmware (branching microprograms) and software implementation of combinational and sequential functions.