Research
(→Synthesis Problem) |
(→Mathematics) |
||
| Line 95: | Line 95: | ||
<br> [http://www.ecc.itu.edu.tr/images/f/fe/Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.ppt Slides] | <br> [http://www.ecc.itu.edu.tr/images/f/fe/Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.ppt Slides] | ||
|} | |} | ||
| + | |||
== Mathematics == | == Mathematics == | ||
Revision as of 18:17, 20 October 2012
Our research is multidisciplinary and spans areas such as circuit design, emerging computing models, and mathematics. Our main goal is developing novel ways of computing for nanoscale technologies.
Contents |
Computing with Networks of Nanoswitches
As current CMOS-based technology is approaching its anticipated limits, research is shifting to novel forms of nanoscale technologies including molecular-scale self-assembled systems. Unlike conventional CMOS that can be patterned in complex ways with lithography, self-assembled nanoscale systems generally consist of regular structures. Logical functions are achieved with crossbar-type switches. Our model, a network of four- terminal switches, corresponds to this type of switch in a variety of emerging technologies, including nanowire crossbar arrays and magnetic switch-based structures.
Synthesis Problem
In his seminal Master's Thesis, Claude Shannon made the connection between Boolean algebra and switching circuits. He considered two-terminal switches corresponding to electromagnetic relays. A Boolean function can be implemented in terms of connectivity across a network of switches, often arranged in a series/parallel configuration. We have developed a method for synthesizing Boolean functions with networks of four-terminal switches, arranged in rectangular lattices.
|
File:2-switch.png Shannon's model: two-terminal switches. Each switch is either ON (closed) or OFF (open). A Boolean function is implemented in terms of connectivity across a network of switches, arranged in a series/parallel configuration. This network implements the function f = x_1 x_2 x_3 + x_1 x _2 x_5 x_6 + x_4 x_5 x_2 x_3 + x_4 x_5 x_6. |
File:4-switch.png Our model: four-terminal switches. Each switch is either mutually connected to its neighbors (ON) or disconnected (OFF). A Boolean function is implemented in terms of connectivity between the top and bottom plates. This network implements the same function, f = x_1 x_2 x_3 + x_1 x _2 x_5 x_6 + x_4 x_5 x_2 x_3 + x_4 x_5 x_6. |
| Selected Publication |
|
|
Robust Computation
We have devised a novel framework for digital computation with lattices of nanoscale switches with high defect rates, based on the mathematical phenomenon of percolation. With random connectivity, percolation gives rise to a sharp non-linearity in the probability of global connectivity as a function of the probability of local connectivity. This phenomenon is exploited to compute Boolean functions robustly, in the presence of defects.
| Selected Publication |
|
|
Mathematics
Self-Duality Problem
The problem of testing whether a monotone Boolean function in irredundant disjuntive normal form (IDNF) is self-dual is one of few problems in circuit complexity whose precise tractability status is unknown. We have focused on this famous problem. We have shown that monotone self-dual Boolean functions in IDNF do not have more variables than disjuncts. We have proposed an algorithm to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The algorithm runs in O(n^4) time.
| Selected Publication |
|
|
Analog Circuit Design
Positive Feedback
The conventional wisdom is that analog circuits should not include positive feedback loops. As controversial as it seems, we have successfully used positive feedback for impedance improvement in a current amplifier. With adding few transistors we have achieved very low input resistance values. We have tested the proposed fully-differential current amplifier in a filter application.
| Selected Publication |
|
|
