Skip to main content

Advanced AI Search Techniques in Modern Digital Circuit Synthesis

  • Chapter
Artificial Intelligence in Logic Design

Part of the book series: Artificial Intelligence in Logic Design ((SECS,volume 766))

  • 290 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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.

    Article  Google Scholar 

  • Beasley, D. et al. (1993a). An Overview of Genetic Algorithms — Part 1: Fundamentals. University Computing 15(2): 58–69.

    MathSciNet  Google Scholar 

  • Beasley, D. et al. (1993b). An Overview of Genetic Algorithms — Part 2: Research Topics. University Computing 15(4): 170–181.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Coudert, O. (1994). Two-Level Logic Minimization: An Overview. INTEGRATION: The VLSI Journal 17: 97–140.

    Article  MATH  Google Scholar 

  • Davis, L. (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Fraser, A. S. (1962). Simulation of Genetic Systems. Journal of Theoretical Biology: 329–349.

    Google Scholar 

  • 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.

    MATH  Google Scholar 

  • Goldberg, D. E. (1975). Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Holland, J. H. (1995). Hidden Order: How Adaptation Builds Complexity. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Jasinski, K. et al. (1989). Parallel Decomposition in Logic Synthesis. In Proc. of 15th European Solid-State Circuits Conference, 113–116.

    Chapter  Google Scholar 

  • Jóźwiak, L. & Kolsteren, J. C. (1991). An Efficient Method for the Sequential General Decomposition of Sequential Machines. Microprocessing and Microprogramming 32: 657–664.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Jóźwiak, L. (1995). General Decomposition and Its Use in Digital Circuit Synthesis. VLSI Design 3(3–4): 225–248.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Lin, B. (1993). Efficient Symbolic Support Manipulation In Proc. of ICCD’93, 513–516. IEEE Computer Society Press.

    Google Scholar 

  • Lin, T. Y. & Cercone, N. (eds.) (1997). Rough Sets and Data Mining — Analysis of Imprecise Data. Boston/Dordrecht/London: Kluwer Academic Publishers.

    MATH  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    MATH  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Pearl, J. (1984). Heuristics. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Rudell, R. (1989). Logic Synthesis for VLSI Design. Ph.D. diss., University of California, Berkeley, CA.

    Google Scholar 

  • Saaty, T. L. (1980). The Analytic Hierarchy Process. New York: McGraw-Hill.

    MATH  Google Scholar 

  • Sakawa, M. (1993). Fuzzy Sets and Interactive Multiobjective Optimization. New York: Plenum Press.

    MATH  Google Scholar 

  • Vincke, P. et al. (1992). Multicriteria Decision-Aid. Chichester: John Wiley and Sons.

    Google Scholar 

  • Wierzbicki, A. P. (1982). A Mathematical Basis for Satisficing Decision Making Mathematical Modeling 3: 391–405.

    Article  MathSciNet  MATH  Google Scholar 

  • Wierzbicki, A. P. (1986). On the Completness and Constructiveness of Parametric Characterizations to Vector Optimization Problems. Orspektrum 8: 73–87.

    Article  MathSciNet  MATH  Google Scholar 

  • Yu, P. L. (1985). Multiple-Criteria Decision Making. New York/London: Plenum Press.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics