Difference between revisions of "Mustafa Altun"
Line 6:  Line 6:  
* [[Media:Mustafa_Altun_CV.pdf  '''Curriculum Vitae''']]  * [[Media:Mustafa_Altun_CV.pdf  '''Curriculum Vitae''']]  
* [[Media:  * [[Media:Altun_An_Emerging_Computing_Model_A_Network_of_Four_Terminal_Switches.ppt  '''Research Slides''']]  
== Current Research ==  == Current Research == 
Revision as of 23:20, 23 April 2012
I am a Ph.D. candidate in the Dept. of Electrical and Computer Engineering at the University of Minnesota, Twin Cities Campus. I am pursuing research on computing models for emerging technologies. I also have a particular interest in combinatorics, more specifically hypergraphs.
Current Research
As current CMOSbased technology is approaching its anticipated limits, research is shifting to novel forms of nanoscale technologies including molecularscale selfassembled systems. Unlike conventional CMOS that can be patterned in complex ways with lithography, selfassembled nanoscale systems generally consist of regular structures. Logical functions are achieved with crossbartype 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 switchbased structures.
Switching Networks
In his seminal Master's Thesis, Claude Shannon made the connection between Boolean algebra and switching circuits. He considered twoterminal 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 fourterminal switches, arranged in rectangular lattices.


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 nonlinearity 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.


SelfDuality
The problem of testing whether a monotone Boolean function in irredundant disjuntive normal form (IDNF) is selfdual 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 selfdual 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 selfdual. The algorithm runs in time.

Contact Information
 Email Address: altu0006@umn.edu
 Cell Phone: 6129782955
 Address: 200 Union St. S.E., Room 4136, Minneapolis, MN 55455