Skip to main content

Evolutionary Graph Generation System and Its Application to Bit-Serial Arithmetic Circuit Synthesis

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN VII (PPSN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2439))

Included in the following conference series:

Abstract

This paper presents an efficient graph-based evolutionary optimization technique called Evolutionary Graph Generation (EGG), and its application to the design of bit-serial arithmetic circuits, which frequently appear in real-time DSP architectures. The potential of the proposed approach is examined through experimental synthesis of bitserial constant-coefficient multipliers. A new version of the EGG system can generate the optimal bit-serial multipliers of 8-bit coefficients with a 100% success rate in 15 minutes on an average.

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

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

  1. T. Aoki, N. Homma, and T. Higuchi,“Evolutionary design of arithmetic circuits,” IEICE Trans. Fundamentals, Vol. E82-A, No. 5, pp. 798–806, May 1999.

    Google Scholar 

  2. N. Homma, T. Aoki, and T. Higuchi,“Evolutionary graph generation system with symbolic verification for arithmetic circuit design,” IEE Electronics Letters, Vol. 36, No. 11, pp. 937–939, May 2000.

    Article  Google Scholar 

  3. N. Homma, T. Aoki, and T. Higuchi,“Evolutionary synthesis of fast constant-coefficient multipliers,” IEICE Trans. Fundamentals, Vol. E83-A, No. 9, pp. 1767–1777, September 2000.

    Google Scholar 

  4. M. Natsui, T. Aoki, and T. Higuchi,“Evolutionary graph generation with terminalcolor constraint for heterogeneous circuit synthesis,” Electronics Letters, Vol. 37, No. 13, pp. 808–810, June 2001.

    Article  Google Scholar 

  5. F. J. Miller, P. Thomson, and T. Fogarty,“Designing electronic circuits using evolutionary algorithms. arithmetic circuits: A case study,” Genetic Algorithms and Evolution Strategies in Engineering and Computer Science, pp. 105–131, September 1997.

    Google Scholar 

  6. R. J. Koza, H. F. III, Bennett, D. Andre, A. M. Keane, and F. Dunlap,“Automated synthesis of analog electrical circuits by means of genetic programming,” IEEE Trans. Evolutionary Computation, Vol. 1, No. 2, pp. 109–128, July 1997.

    Article  Google Scholar 

  7. T. Higuchi, M. Iwata, D. Keymeulen, H. Sakanashi, M. Murakawa, I. Kajitani, E. Takahashi, K. Toda, M. Salami, N. Kajihara, and N. Otsu,“Real-world applications of analog and digital evolvable hardware,” IEEE Trans. Evolutionary Computation, Vol. 3, No. 3, pp. 220–235, September 1999.

    Article  Google Scholar 

  8. D. J. Lohn and P. S. Colombano,“A circuit representation technique for automated circuit design,” IEEE Trans. Evolutionary Computation, Vol. 3, No. 3, pp. 205–219, September 1999.

    Article  Google Scholar 

  9. S. A. White,“Application of distributed arithmetic to digital signal processing: a tutorial review,” IEEE ASSP Magazine, pp. 4–19, July 1989.

    Google Scholar 

  10. K. Hwang, Computer arithmetic: principles, architecture, and design, John Wiley & Sons, 1979.

    Google Scholar 

  11. R. Zimmermann and W. Fichtner,“Low-power logic styles: CMOS versus passtrasistor logic,” IEEE J. Solid-State Circuits, Vol. 32, No. 7, pp. 1079–1090, July 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Motegi, M., Homma, N., Aoki, T., Higuchi, T. (2002). Evolutionary Graph Generation System and Its Application to Bit-Serial Arithmetic Circuit Synthesis. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-45712-7_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44139-7

  • Online ISBN: 978-3-540-45712-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics