A Synthesis of Sub-Optimal Decision Programs
Abstract
Two heuristic techniques of suboptimal synthesis of decision diagrams (DDs) have been developed which are applicable to generally partial logic functions. The first technique generates ordered minimum or near-minimum size of DDs for M-valued logic functions, the second one sometimes yields more efficient DDs without a fixed ordering of binary variables. Both kinds of DDs are being used in designing and verification of digital systems where the minimum diagram size transforms directly into the minimum cost of function implementation or testing.Downloads
Download data is not yet available.
How to Cite
Dvořák, V., & Šustr, J. (2012). A Synthesis of Sub-Optimal Decision Programs. Computing and Informatics, 14(1), 93–103. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/222
Issue
Section
Articles