Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Exact minimization"”.

  1. Application of the constrained implicants set concept to the minimization of binary functions

    … logic. Most of them use prime implicants during minimization process. An efficient search strategy has been developed for finding minimal sum-of-products expressions for multiple-valued logic (MVL) functions by using the constrained implicants set concept. The search space can be considerably …

    nps Repository record for Application of the constrained implicants set concept to the minimization of binary functions (opens in a new tab)

  2. The minimization of multiple valued logic expressions using parallel processors

    The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood Decoupling (ND) Algorithm by Yang and Wang. This algorithm finds …

    nps Repository record for The minimization of multiple valued logic expressions using parallel processors (opens in a new tab)

  3. Minimization of Generalized Reed-Muller Expansion and Its Sub-class

    … expression, is created, along with an efficient minimization algorithm. This new AND/EXOR circuit form has the following features: • Since this sub-family of ESOP (with a total of n2n-I22n-i - (n-1)2n forms which includes the 2n Fixed-Polarity Reed-Muller forms) is much larger than the Kronecker …

    portland-state Repository record for Minimization of Generalized Reed-Muller Expansion and Its Sub-class (opens in a new tab)

  4. Ελαχιστοποίηση εκφράσεων αποκλειστικού Ή - κβαντικοί αλγόριθμοι

    … with which deals the present thesis is the minimization of logic “eΧclusive OR” or (XOR) expressions for an arbitrary logic function, and more particularly, with the reduction of number of terms that constitute this function, as well as with the mapping of such expressions in architectures …

    greece Repository record for Ελαχιστοποίηση εκφράσεων αποκλειστικού Ή - κβαντικοί αλγόριθμοι (opens in a new tab)

  5. Αλγόριθμοι ελαχιστοποίησης μη πλήρως ορισμένων λογικών συναρτήσεων

    … care terms complicates even more the finding of exact expressions. Initially, we are interested in the minimization of ESOP expressions. First of all, we propose a heuristic algorithm for the generation and the minimization of such expressions for arbitrary multiple-output incompletely specified …

    greece Repository record for Αλγόριθμοι ελαχιστοποίησης μη πλήρως ορισμένων λογικών συναρτήσεων (opens in a new tab)