An Algorithm for exact extended algebraic division

Autores: Giuseppe Caruso
Localización: IEICE transactions on fundamentals of electronics, communications and computer, ISSN 0916-8508, Vol. 86, Nº 2, 2003, págs. 462-471
Idioma: inglés
Texto completo no disponible (Saber más ...)
Resumen
- Methods usually employed for carrying out division in logic are based on algebraic or Boolean techniques. Algebraic division is fast but results may be less than optimal. Boolean division will yield better results but generally it is much slower because a minimization step is required. In [4], Kim and Dietmeyer proposed a new type of division, called extended algebraic division, and described a heuristic algorithm for it. A feature is that, unlike Boolean division, it does not require a minimization step. The present paper is concerned with an efficient algorithm for exact extended algebraic division. The algorithm was developed within the SIS environment, a program for logic synthesis developed at U.C. Berkeley. Experiments on factoring PLA's demonstrate a significant improvement in quality with a reasonable increase in run time.