Abstract
Progress in microelectronic technology is extremely fast and it is outstripping the designers’ abilities to make use of the created opportunities. Development and application of new more suitable design methods and tools is therefore very important for the modern system industry. This paper shows the importance of the AI search techniques for the circuits and systems design space exploration, explains what sorts of search techniques are useful for this aim, and discusses the place, role and way of use of these techniques in circuit and system design. In particular, the paper explains the importance and usage of the heuristic search techniques for the automatic construction and selection of the most promising solutions to the circuit synthesis problems. The discussion and conclusions of the paper are illustrated with examples of three effective and efficient search algorithms, and experimental results from their application to two important circuit synthesis problems. The knowledge presented in the paper combines numerous valuable concepts of modern system engineering and artificial intelligence, and forms a base for further research and application of the AI search techniques to design of complex circuits and systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almaini, A. E. A. et al. (1995). State Assignment of Finite State Machines Using a Genetic Algorithm. IEE Proc. Comput. Digit. Tech. 142(4): 279–285.
Beasley, D. et al. (1993a). An Overview of Genetic Algorithms — Part 1: Fundamentals. University Computing 15(2): 58–69.
Beasley, D. et al. (1993b). An Overview of Genetic Algorithms — Part 2: Research Topics. University Computing 15(4): 170–181.
Benten, M. S. T. & Sait, S. M. (1994). GAP: A Genetic Algorithm to Optimize Two-bit Decoder PLAs. Int. J. Electronics 176(1): 99–106.
Chattopadhyay, S. & Chaurhuri, P.P. (1997). Genetic Algorithm Based Approach for Integrated State Assignment and Flip-Flop Selection in Finite State Machine Synthesis. In Proc. of the Int. Conf. On VLSI Design, 522–527.
Coudert, O. (1994). Two-Level Logic Minimization: An Overview. INTEGRATION: The VLSI Journal 17: 97–140.
Davis, L. (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
Dill, K. M. & Perkowski, M. A. (1998). Evolutionary Minimization of Generalized Reed Muller Forms. In Proc. of ICCIMA’98 Conference, 727–733. Melbourne: World Scientific.
Dill, K. M. & Perkowski M. A. (2001). Baldwinian Learning Utilizing Genetic and Heuristic Algorithms for Logic Synthesis and Minimization of Incompletely Specified Data with Generalized Reed-Muller (AND-EXOR) Forms. Journal of Systems Architecture 47(6): 477–489.
Fraser, A. S. (1962). Simulation of Genetic Systems. Journal of Theoretical Biology: 329–349.
Garey, M. R. & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company.
Goldberg, D. E. (1975). Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.
Hart, P. E. et al. (1968). A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. Syst. Sci. & Cybern. 4(2): 100–107.
Holland, J. H. (1992). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Cambridge, MA: Cambridge MIT Press.
Holland, J. H. (1995). Hidden Order: How Adaptation Builds Complexity. Reading, MA: Addison-Wesley.
Jasinski, K. et al. (1989). Parallel Decomposition in Logic Synthesis. In Proc. of 15th European Solid-State Circuits Conference, 113–116.
Jóźwiak, L. & Kolsteren, J. C. (1991). An Efficient Method for the Sequential General Decomposition of Sequential Machines. Microprocessing and Microprogramming 32: 657–664.
Jóźwiak, L. (1992a). An Efficient Heuristic Method for State Assignment of Large Sequential Machines. Journal of Circuits, Systems and Computers 2(1): 1–26.
Jóźwiak, L. & Volf, F. (1992). An Efficient Method for Decomposition of Multiple Output Boolean Functions and Assigned Sequential Machines. In Proc. of EDAC — The European Conference on Design Automation, 114–122. Brussels: IEEE Computer Society Press.
Jóźwiak, L. (1992b). A Method for General Simultaneous Full-Decomposition of Sequential Machines: Algorithms and Implementation, EUT-Report 92-E-267. The Netherlands: Eindhoven University of Technology.
Jóźwiak, L. & Volf, E A. M. (1995). Efficient Decomposition of Assigned Sequential Machines and Boolean Functions for PLD Implementations. In Proc. of International Conference on Electronic Technology Directions, 259–266. Adelaide: IEEE Computer Society Press.
Jóźwiak, L. (1995). General Decomposition and Its Use in Digital Circuit Synthesis. VLSI Design 3(3–4): 225–248.
Jóźwiak, L. & Ong, A. (1996). Quality-Driven Decision Making Methodology for SystemLevel Design. In Proc. of EUROMICRO’96 Conference, 8–18. Prague: Computer Society Press.
Jóźwiak, L. & Konieczny, P. A. (1996). Input Support Minimization for Efficient PLD and FPGA Synthesis. In Proc. of IWLAS’96, 30–37. Grenoble: IFIP.
Jóźwiak, L. et al. (1998). Solving Synthesis Problems with Genetic Algorithms. In Proc. of EUROMICRO’98 Conference, 1–7. Vasteras: IEEE Computer Society Press.
Jóźwiak, L. et al. (2001). Fast and Compact Sequential Circuits Through the Information Driven Circuit Synthesis In Proc. of DSD’2001— Euromicro Symposium on Digital System Design, 46–53. Warsaw: IEEE Computer Society Press.
Jóźwiak, L. & Chojnacki, A. (2001). Effective and Efficient FPGA Synthesis through Functional Decomposition Based on Information Relationship Measures. In Proc. of DSD’2001 — Euromicro Symposium on Digital System Design, 30–37. Warsaw: IEEE Computer Society Press.
Jóźwiak, L. (2001). Quality-Driven Design in the System-on-a-Chip Era: Why and How? Journal of Systems Architecture 47(3–4): 201–224.
Jóźwiak, L. & Postula, A. (2002). Genetic Engineering versus Natural Evolution: Genetic Algorithms with Deterministic Operator. Journal of Systems Architecture 48(1–3): 99–112.
Lin, B. (1993). Efficient Symbolic Support Manipulation In Proc. of ICCD’93, 513–516. IEEE Computer Society Press.
Lin, T. Y. & Cercone, N. (eds.) (1997). Rough Sets and Data Mining — Analysis of Imprecise Data. Boston/Dordrecht/London: Kluwer Academic Publishers.
Louis, S. J. & Rawlins, G. J. E. (1992). Syntactic Analysis of Convergence in Genetic Algorithms. In Rawlins, G. J. E. (ed.) Foundation of Genetic Algorithms 2, 141–151. Morgan Kaufman Publishers Inc.
Luba, T. & Rybnik, J. (1992a). Algorithm of Elimination of Attributes and Arguments Based on Unate Complement Concept. Bulletin of the Polish Academy of Sciences 40(3): 313–322.
Luba, T. & Rybnik, J. (1992b). Rough Sets and Some Aspects of Logic Synthesis. In Slowinski, R. (ed.) Intelligent Decision Support. Boston/Dordrecht/London: Kluwer Academic Publishers.
Mishchenko, A. et al. (2000). Implicit Algorithms for Multi-Valued Input Support Manipulation In Proc. of 4th Intl. Workshop on Boolean Problems. Freiberg: University of Freiberg.
Pearl, J. (1984). Heuristics. Reading, MA: Addison-Wesley.
Rudell, R. (1989). Logic Synthesis for VLSI Design. Ph.D. diss., University of California, Berkeley, CA.
Saaty, T. L. (1980). The Analytic Hierarchy Process. New York: McGraw-Hill.
Sakawa, M. (1993). Fuzzy Sets and Interactive Multiobjective Optimization. New York: Plenum Press.
Vincke, P. et al. (1992). Multicriteria Decision-Aid. Chichester: John Wiley and Sons.
Wierzbicki, A. P. (1982). A Mathematical Basis for Satisficing Decision Making Mathematical Modeling 3: 391–405.
Wierzbicki, A. P. (1986). On the Completness and Constructiveness of Parametric Characterizations to Vector Optimization Problems. Orspektrum 8: 73–87.
Yu, P. L. (1985). Multiple-Criteria Decision Making. New York/London: Plenum Press.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Jóźwiak, L. (2004). Advanced AI Search Techniques in Modern Digital Circuit Synthesis. In: Artificial Intelligence in Logic Design. Artificial Intelligence in Logic Design, vol 766. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2075-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2075-9_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6583-4
Online ISBN: 978-1-4020-2075-9
eBook Packages: Springer Book Archive