Skip to main content
SpringerLink
Log in

A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits

  • Conference paper
Cellular Automata (ACRI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7495))

Included in the following conference series:

Abstract

We show the construction of a rotation- and reflection-invariant local function for a two-dimensional asynchronous cellular automaton with only 3 states and radius 1 Moore neighborhood in which one can implement arbitrary delay-insensitive circuits.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. Journal of Computer and System Sciences 70, 201–220 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lee, J., Peper, F., Adachi, S., Morita, K.: An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 67–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Lee, J., Peper, F.: Efficient Circuit Construction in Brownian Cellular Automata Based on a New Building-Block for Delay-Insensitive Circuits. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 356–364. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Nakamura, K.: Asynchronous Cellular Automata and Their Computational Ability. Systems, Computer, Control 5, 58–66 (1974)

    Google Scholar 

  5. Schneider, O.: Schaltkreise in einem Zellularautomat mit 3 Zuständen. Diploma thesis, Karlsruhe Institute for Technology, Faculty for Informatics (2012)

    Google Scholar 

  6. Wernick, W.: Complete Sets of Logical Functions. Transactions of the American Mathematical Society 51, 117–132 (1942)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology, Germany

    Oliver Schneider & Thomas Worsch

Authors
  1. Oliver Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Worsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, O., Worsch, T. (2012). A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation