Abstract
The increasing complexity of industrial designs, and especially with the extensive use of high level languages such as VHDL or Verilog, progressively obsoletes classical Boolean optimization techniques. Thus, the application of Binary Decision Disgrams in Logic Synthesis becomes an attractive alternative to push forward the limit of design complexity. In this paper, we have developed new Optimization techniques only based on implicit techniques, and all classical steps were fully reformulated to provide a powerful system providing better results than other existing techniques.
Chapter PDF
Similar content being viewed by others
References
Akers (1978), “Functional Testing with Binary Decision Diagrams”, Proc. of the IEEE Conf. on Fault-Tolerant Comput., pp 75–82.
Besson, Bouzouzou, Crastes, Floricica and Saucier (1992), “Synthesis on Multiplexer-based F.P.G.A. using Binary Decision Diagrams”, Proc. of ICCD 92.
Brayton and al. (1984), “Logic Minimization Algorithms for VLSI Synthesis”, Kluwer Academic Publishers, Boston.
Brayton and al. (Nov. 1987), “MIS: a Multi-Level LogicOptimization System”, IEEE Transaction on CAD, pp. 1062–1081.
Bryant (1986), “Graph-Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Computers, Vol C-35, no.8, pp. 677–691.
Coudert and Madre (1992), “Implicit and Incremental Computation of Prime and Essential Prime Implicants of Boolean Functions”, 29th ACM/IEEE Design Automation Conference.
Coudert and Madre(1993a), ‘Toward a Symbolic Logic Minimization Algorithm’, Proc. VLSI Design’93 Bombay, India.
Coudert, Madre and Fraisse (1993b), “A New Viewpoint on Two-Level Minimization”, 30th ACM/IEEE Design Automation Conference.
Jeong et al (1991)., “Variable Ordering For FSM Traversal”, Proc. of the International Workshop on Logic Synthesis MCNC.
Madre and Billon (1988), ‘Proving Circuit Correctness using Formal Comparison Between Expected and Extracted Behaviour’, 25th ACMIIEEE Design Automation Conference, pp. 205–210.
Madre (1990), “PRIAM: un outil de verification formelle de circuits integres digitaux”, These de l’ENS des Telecommunications, Paris.
Murgai, Brayton, Sangiovanni-Vincentelli (1992), “An Improved Synthesis Algorithm for Multiplexor-based PGAs”, 29th ACM/IEEE Design Automation Conference, Anaheim, CA, June 1992, pp. 380–386.
MCNC (1989), Introduction to Synthesis Benchmarks, second International Workshop on Logic Synthesis, North Carolina USA, May 1989 MAINSAIL Language manual, XIDAK inc.
Minato (1992), ‘Fast Generation of Irredundant Sum-of-Products Forms from Binary Decision Diagrams’, Proc of SASIMI 82, pp. 64–73.
Minato (1993a), “Zero-Suppressed BDDs for Set Manipulation in Combinational Problems”, 30th ACM/IEEE Design Automation Conference.
Minato (1993b), “Fast weak division method for implicit cube representation”, proceeding SASIMI 93.
Moireale (1970), “Recursive Operators for Prime Implicant and Irredundant Normal Form Determination”, IEEE Trans. on Computers, 1970.
Murgai, Brayton, and Sangiovanni-Vincentelli (1992), “An Improved Synthesis Algorithm for Multiplexor-based PGAs”, 29th ACM/IEEE Design Automation Conference, Anaheim, CA, pp. 380–386.
Rudell (1993), “Dynamic Variable Ordering for Ordered Binary Decisic.,, Diagrams”, Proc. Of International Workshop in Logic Synthesis, CA.
Stanion and Sechen (1994), “Boolean division and factorization using BDDs”, IEEE Transactions on CAD vol 13, N° 9, sept. 94, pp. 1179–1184.
Touati, Brayton and Kurshan (1991), “Testing Language Containment for w-automata using BDDs”, Formal Methods in VLSI Design, Miami, ACM, New-York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Poirot, F., Tarroux, G., Roane, R. (1995). Boolean Optimization Using Implicit Techniques. In: Saucier, G., Mignotte, A. (eds) Logic and Architecture Synthesis. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34920-6_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-34920-6_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2923-7
Online ISBN: 978-0-387-34920-6
eBook Packages: Springer Book Archive