O. Coudert, J. Madre, H. Fraisse, and H. Touati. Implicit prime cover computation: An overview. In Proc. Workshop on Synth. and Syst. Int. of Mixed Tech., Oct. 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Semantic Minimization of 3-Valued Propositional Formulae - Reps, Loginov, Sagiv (2002) (Correct)
....the answer by a different, and more efficient, method: A drawback of MinimizeFormula is the need to generate all prime implicants. One might try to substitute other sum of products expressions that can be used to represent a given function (in 2 valued logic) such as an irredundant prime cover [15, 10]. This approach is not tenable, however; for instance, for the formula = xy x z yz, if we substitute the irredundant prime cover algorithm from [10] for the two calls on Primes[ in line [3] of MinimizeFormula, we would get the following formula: y z yz x z xz t : x yz xyz) ....
.... other sum of products expressions that can be used to represent a given function (in 2 valued logic) such as an irredundant prime cover [15, 10] This approach is not tenable, however; for instance, for the formula = xy x z yz, if we substitute the irredundant prime cover algorithm from [10] for the two calls on Primes[ in line [3] of MinimizeFormula, we would get the following formula: y z yz x z xz t : x yz xyz) 21) However, formula (21) is not a semantically minimal variant of : for the assignment [x 7 0; y 7 1; z 7 1=2] Eqn. 16) evaluates to 1, whereas formula ....
O. Coudert, J. Madre, H. Fraisse, and H. Touati. Implicit prime cover computation: An overview. In Proc. Workshop on Synth. and Syst. Int. of Mixed Tech., Oct. 1993.
Unate Decomposition of Boolean Functions - James Jacob Alan (Correct)
....as wrappers around a call to a SOP minimizer. In the early version of our algorithm, these procedures called Espresso with option so both, which minimizes the cover with phase assignment. Later we found that calls to Espresso may be replaced by Irredundant Sum of Product (ISOP) computation [5,6]. ISOP is called for both phases of the cover. Only the cover with a smaller cube count is returned. Using ISOP instead of Espresso resulted in several orders of magnitude speed up without effecting the quality of results. The implementation of procedure GetUnateSubset( is shown in Fig. 3. It ....
O. Coudert, J. C. Madre, H. Fraisse, H. Touati, Implicit Prime Cover Computation: An Overview, inProc. of SASIMI '93, Nara, Japan.
Implicit Representation of Discrete Objects - Mishchenko (2000) (Correct)
....specified boolean functions. The performance of procedures using implicit cube representation is practically independent of the number of cubes in the set. It explains why this representation has played a central role in creating efficient procedures for irredundant cover computation [11] and two level sum of products minimization [12] which outperformed the widely known explicit SOP minimizer ESPRESSO [13] by orders of magnitude on large examples. Suppose P n is the set of all cubes that can be constructed using variables (x 1 ,x 2 , x n ) The set P n has 3 n ....
O.Coudert, J.C.Madre, H.Fraisse, H.Touati. "Implicit Prime Cover Computation: An Overview". Proc. of SASIMI (Synthesis And Simulation Meeting and Int'l Interchange), Nara, Japan, 1993.
A Symbolic Algorithm for Low Power Sequential Synthesis - Kumthekar, Moon, Somenzi (1997) (2 citations) (Correct)
No context found.
O. Coudert, J. C. Madre, H. Fraisse, and H. Touati. Implicit prime cover computation: An overview. In SASIMI '93, pages 413--422, Nara, Japan, October 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC