Nanoscale digital computation through percolation

Mustafa Altun, Marc Riedel, Claudia Neuhauser

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graphs. We exploit the non-linearity that occurs through percolation to produce Boolean functionality. We show that the error margins, defined in terms of the steepness of the non-linearity, translate into the degree of defect tolerance. We study the problem of mapping Boolean functions onto lattices with good error margins.

Original languageEnglish (US)
Title of host publication2009 46th ACM/IEEE Design Automation Conference, DAC 2009
Pages615-616
Number of pages2
StatePublished - Nov 10 2009
Event2009 46th ACM/IEEE Design Automation Conference, DAC 2009 - San Francisco, CA, United States
Duration: Jul 26 2009Jul 31 2009

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0738-100X

Other

Other2009 46th ACM/IEEE Design Automation Conference, DAC 2009
CountryUnited States
CitySan Francisco, CA
Period7/26/097/31/09

Keywords

  • Logic synthesis
  • Nanoscale digital computation
  • Percolation

Fingerprint Dive into the research topics of 'Nanoscale digital computation through percolation'. Together they form a unique fingerprint.

  • Cite this

    Altun, M., Riedel, M., & Neuhauser, C. (2009). Nanoscale digital computation through percolation. In 2009 46th ACM/IEEE Design Automation Conference, DAC 2009 (pp. 615-616). [5227079] (Proceedings - Design Automation Conference).