The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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.
In this paper an improved procedure of compaction of a test set for combinational circuits is considered. The goal of optimization is to exclude a covering step from the earlier proposed method. In result we will have a heuristic algorithm which will work much quicker and will suppose a lot of possible future improvements and wide space of further development. The compaction procedure is oriented...
Trying to be effective (no matter who exactly and in what field) a person face the problem which inevitably destroys all our attempts to easily get to a desired goal. The problem is the existence of some insuperable barriers for our mind, another words barriers for principles of thinking. They are our clue and main reason for research. Here we investigate these barriers and their features exposing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.