Nanoscale digital computation through percolation

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. Categories and Subject Descriptors B.7.1 [integrated circuits]: Types and Design Styles ? advanced technologies. General Terms: Design, Reliability.

• Type: Conference
• Year: 2009
• Where: DAC
• Authors: Mustafa Altun, Marc D. Riedel, Claudia Neuhauser
• Keywords: DAC 2009, Design Automation, Nanoscale Lattices, Percolation Theory, Robust Digital Computation