[Show abstract][Hide abstract] ABSTRACT: Memristor is drawing more and more attraction nowadays after HP Laboratory announced its invention. Since then many researchers are taking efforts to find its applications in various areas of the information technology. Among the important applications, one of the interesting issues is the research on memristor circuits. To put forward such research, there is an urgent demand to establish a memristor SPICE model, such that people could conduct SPICE simulation to obtain the performance of the memristor circuits under their investigation. This paper reports our efforts to meet the urgent demand. Based on the memristor device fabrication technology parameters, as well as the theoretical description on memristor, we first propose memristor SPICE models, then verify the effectiveness of the proposed models by applying it to some memristor circuits. Simulation results are satisfactory.
No preview · Article · Mar 2010 · IEICE Transactions on Electronics
[Show abstract][Hide abstract] ABSTRACT: The memristor has drawn the worldwide attention sine HP laboratory released its invention on May 1, 2008 at Nature Letters. Since then many researchers are taking efforts to find its applications in various areas of the information technology. A good model will help to study and seize the behavior characteristics of memristor. In this paper, we proposed a piecewise line approximated memristor model, and tested the approximated model using several test cases. Simulation results show that the proposed approximated model can be well applied.
[Show abstract][Hide abstract] ABSTRACT: It is well known that non-Manhattan channel routing always gives a better result than that yielded from a Manhattan router in a given channel. The paper proposes a new greedy non-Manhattan channel routing algorithm based on a Manhattan-diagonal (MD) model. The router uses h track for any channel without cyclic vertical constraints, and d<h<d+1, where d is the channel density. The proposed algorithm is able to deal with both the regular and irregular channel routing cases, and can further be extended to handle the L-shaped channel, where the irregular channel and L-shaped channel often occur in a BBL layout. The effectiveness of the algorithm is verified by some examples.
[Show abstract][Hide abstract] ABSTRACT: It's well known that a non-Manhattan channel router always uses no more tracks than a Manhattan channel router. For a bubble-sorting-based non-Manhattan channel, all of the nets can be routed by bubble-sorting swap passes in an optimal bubble-sorting solution, and these bubble-sorting swap passes can be further mapped onto track-to-track-routing processes in a 4-layer routing model. However, these proposed bubble-sorting-based non-Manhattan routers do not consider crosstalk or consider less, which has become a major issue in VLSI design due to the high frequency, long interconnecting lines and small spacing between interconnects in today's integrated circuits. In this paper, we study the problem of crosstalk minimization in a bubble-sorting based non-Manhattan channel. A rerouting algorithm that combines segment-rerouting technique and layer reassignment is presented. This algorithm can decrease the wire length and modify the layout so that the crosstalk in the channel is minimized. Experimental results show that the proposed approach can reduce the crosstalk by an average of 27.9 % on a set of benchmark examples.