Functional decomposition is an important and powerful technique in the logic synthesis. The ternary matrix cover approach is one of the existing methods of this type. This method is also used in decomposition of a system of completely specified Boolean functions. Before constructing the desired superposition, it needs to encode a table. There is a trivial encoding method. But to find a better solution, it is important to use a special approach, because the result of the encoding has a direct influence on the obtained functions. In this paper, an efficient algorithm to encode this table is presented. It uses the approach connected with the assembling Boolean hyper cube method. The proposed algorithm is explained in details with an example. The benefits and impacts of the suggested technique are also discussed.

To guarantee the performance of ad hoc networks, utilizing a hierarchical architecture model is necessary. An instance of this structure is clustering. In this paper a cluster-based topology control algorithm is proposed which builds an energy-efficient and a low interference topology. It uses low-quality information, exchanges a few messages, and does not need for extra hardware equipment as well. It is also suitable for practical use, because in the implementation of this algorithm is not needed to know the location or the direction information of the network nodes. So it is possible to classify this algorithm as a neighbor-based topology control algorithm. In addition, for the transmitting and the maintained power levels of each node, a modification is applied according to the real hardware platforms. It improves the energy consumption in the ideal conditions.