http://mriedel.ece.umn.edu/wiki/index.php?title=Mustafa_Altun&feed=atom&action=historyMustafa Altun - Revision history2024-03-29T09:52:13ZRevision history for this page on the wikiMediaWiki 1.37.1http://mriedel.ece.umn.edu/wiki/index.php?title=Mustafa_Altun&diff=45393&oldid=prevStudent: /* Switching Networks */2014-08-04T16:39:42Z<p><span dir="auto"><span class="autocomment">Switching Networks</span></span></p>
<p><b>New page</b></p><div>__NOTOC__<br />
[[Image:Mustafa_Altun.jpg|200px]]<br />
<br />
I received my Ph.D. degree in electrical engineering with a Ph.D. minor in mathematics at the [http://www.umn.edu University of Minnesota, Twin Cities Campus] in 2012. My Ph.D. studies include research on [[Research#Computing with Nanoscale Lattices | emerging computing models]], reliability of nanoscale circuits, and combinatorics.<br />
<br />
Currently I am an assistant professor at [http://www.itu.edu.tr/en/ Istanbul Technical University (ITU)]. For up-to-date information please check [http://www.ecc.itu.edu.tr my group's website] at ITU.<br />
<br />
== Research at the U==<br />
<br />
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. <br />
<br />
=== Switching Networks ===<br />
In his seminal Master's Thesis, [http://en.wikipedia.org/wiki/Claude_Shannon 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. <br />
{|<br />
|<br />
{| style="background:#F0E68C"<br />
|- valign=top<br />
| width="100" |'''title''':<br />
| width="500"|[[Media:Altun_Riedel_Logic_Synthesis_for_Switching_Lattices.pdf | Logic Synthesis for Switching Lattices]]<br />
|- valign="top"<br />
| '''authors''':<br />
| [[Mustafa Altun]] and [[Marc Riedel]]<br />
|- valign="top"<br />
| '''will appear&nbsp;in''':<br />
| [http://www.computer.org/portal/web/tc IEEE Transactions on Computers], 2011.<br />
|}<br />
| align=center width="70" | <br />
<span class="plainlinks"><br />
[http://cadbio.com/wiki/images/c/ca/Altun_Riedel_Logic_Synthesis_for_Switching_Lattices.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span><br />
<br><br />
[[Media:Altun_Riedel_Logic_Synthesis_for_Switching_Lattices.pdf | Paper]]<br />
|}<br />
<br />
{|<br />
| <br />
{| style="background:#F0E68C"<br />
|- valign=top<br />
| width="100" |'''title''':<br />
| width="500"|[[Media:Altun_Riedel_Lattice-Based_Computation_of_Boolean_Functions.pdf | Lattice-Based Computation of Boolean Functions]]<br />
|- valign="top"<br />
| '''authors''':<br />
| [[Mustafa Altun]] and [[Marc Riedel]]<br />
|- valign="top"<br />
| '''presented&nbsp;at''':<br />
| [http://www.dac.com Design Automation Conference], Anaheim, CA, 2010.<br />
|}<br />
| align=center width="70" | <br />
<span class="plainlinks"><br />
[http://cadbio.com/wiki/images/7/7b/Altun_Riedel_Lattice-Based_Computation_of_Boolean_Functions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span><br />
<br><br />
[[Media:Altun_Riedel_Lattice-Based_Computation_of_Boolean_Functions.pdf | Paper]]<br />
| align="center" width="70" | <br />
<span class="plainlinks"><br />
[http://mriedel.ece.umn.edu/wiki/images/2/28/Altun_Riedel_Lattice-Based_Computation_of_Boolean_Functions.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span><br />
<br> [http://mriedel.ece.umn.edu/wiki/images/2/28/Altun_Riedel_Lattice-Based_Computation_of_Boolean_Functions.ppt Slides]<br />
|}<br />
<br />
{|align="center"<br />
|<br />
[[Image:2-switch.png|center|thumb|none|400px|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 <math>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<br />
x_5 x_6</math>.]]<br />
|| &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
|| [[Image:4-switch.png|center|thumb|none|375px|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, <math>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<br />
x_5 x_6</math>.]] <br />
|}<br />
<br />
===Percolation for Robust Computation===<br />
<br />
<br />
We have devised a novel framework for digital computation with lattices of nanoscale switches with high defect rates, based on the mathematical phenomenon of [http://en.wikipedia.org/wiki/Percolation_theory 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.<br />
<br />
{|<br />
|<br />
{| style="background:#F0E68C"<br />
|- valign=top<br />
| width="100" |'''title''':<br />
| width="500"|[[Media:Altun_Riedel_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf | Synthesizing Logic with Percolation in Nanoscale Lattices]]<br />
|- valign="top"<br />
| '''authors''':<br />
| [[Mustafa Altun]] and [[Marc Riedel]]<br />
|- valign="top"<br />
| '''appeared&nbsp;in''':<br />
| [http://www.igi-global.com/Bookstore/TitleDetails.aspx?TitleId=1117&DetailsType=Description/ International Journal of Nanotechnology and Molecular Computation], <br>Vol. 3, Issue 2, pp. 12&ndash;30, 2011.<br />
|}<br />
| align=center width="70" | <br />
<span class="plainlinks"><br />
[http://cadbio.com/wiki/images/3/3b/Altun_Riedel_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span><br />
<br><br />
[[Media:Altun_Riedel_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf | Paper]]<br />
|}<br />
<br />
{|<br />
<br />
| <br />
{| style="background:#F0E68C"<br />
|- valign=top<br />
| width="100" |'''title''':<br />
| width="500" |[[Media:Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.pdf | Nanoscale Digital Computation Through Percolation]]<br />
|- valign=top<br />
| '''authors''':<br />
| [[Mustafa Altun]], [[Marc Riedel]], and [http://www.cbs.umn.edu/eeb/faculty/NeuhauserClaudia/ Claudia Neuhauser]<br />
|- valign=top<br />
| '''presented&nbsp;at''':<br />
| [http://www.dac.com Design Automation Conference], San Francisco, CA, 2009.<br />
|}<br />
| align="center" width="70" | <br />
<span class="plainlinks"><br />
[http://mriedel.ece.umn.edu/wiki/images/0/0c/Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span><br />
<br>[[Media:Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.pdf | Abstract]]<br />
| align="center" width="70" | <br />
<span class="plainlinks">[http://mriedel.ece.umn.edu/wiki/images/f/fe/Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span><br />
<br> [http://mriedel.ece.umn.edu/wiki/images/f/fe/Altun_Riedel_Neuhauser_Nanoscale_Digital_Computation_Through_Percolation.ppt Slides]<br />
|}<br />
<br />
[[Image:Lattice-defects-percolation.gif|center|thumb|none|700px|In a switching network with defects, percolation can be exploited to produce robust Boolean functionality. Unless the defect rate exceeds an error margin, with high probability no connection forms between the top and bottom plates for logical zero ("OFF"); with high probability, a connection forms for logical one ("ON").]]<br />
<br />
== Contact Information ==<br />
<br />
* Email Address: [mailto:altu0006@umn.edu altu0006@umn.edu]<br />
* Cell Phone: 612-978-2955<br />
* Address: 200 Union St. S.E., Room 4-136, Minneapolis, MN 55455</div>Student