Difference between revisions of "Mustafa Altun"
Line 103: | Line 103: | ||
| [[Mustafa Altun]] and [[Marc Riedel]] | | [[Mustafa Altun]] and [[Marc Riedel]] | ||
|- valign="top" | |- valign="top" | ||
| ''' | | '''will appear in''': | ||
| [http://www.igi-global.com/Bookstore/TitleDetails.aspx?TitleId=1117&DetailsType=Description/ International Journal of Nanotechnology and Molecular Computation], 2011. | | [http://www.igi-global.com/Bookstore/TitleDetails.aspx?TitleId=1117&DetailsType=Description/ International Journal of Nanotechnology and Molecular Computation], 2011. | ||
|} | |} |
Revision as of 18:49, 22 December 2011
I am a Ph.D. student in the Dept. of Electrical and Computer Engineering at the University of Minnesota, Twin Cities Campus.
Research
I am pursuing research in the area of logic synthesis for emerging technologies. I also have a particular interest in combinatorics, more specifically hypergraphs.
Self-Duality
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 focus on this famous problem. We show that monotone self-dual Boolean functions in IDNF do not have more variables than disjuncts. We propose an algorithm to test whether a self-dual Boolean function in IDNF with n variables and n disjuncts is self-dual. The algorithm runs in
time.
|
Switching Lattices
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. Our model is applicable for variety of nanoscale technologies, such as nanowire crossbar arrays, as molecular switch-based structures.
|
|
Percolation for 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.
|
|

Education
I received my B.S. and M.Sc. degrees in Electronics Engineering at Istanbul Technical University, Turkey.
Contact Information
- Email Address: altu0006@umn.edu
- Office Phone: 612-626-8676
- Cell Phone: 612-978-2955
- Address: 200 Union St. S.E., Room 4-136, Minneapolis, MN 55455