Conference Paper

A threshold logic synthesis tool for RTD circuits

Inst. de Microelectron. de Sevilla, CNM, Sevilla, Spain
DOI: 10.1109/DSD.2004.1333337 Conference: Digital System Design, 2004. DSD 2004. Euromicro Symposium on
Source: DBLP

ABSTRACT Functional devices and circuits based on resonant tunneling diodes (RTD) are receiving much attention since they allow high speed and/or low power operation. RTDs exhibit a negative differential resistance in their current-voltage characteristic which can be exploited to significantly increase the functionality implemented by a single gate in comparison to other technologies. In particular, they have proven to efficiently implement threshold gates which are a generalization of conventional Boolean gates. Suitable logic synthesis tools are required to handle these complex building blocks in order to translate the advantages of this emergent technology to the circuit and system levels. This paper describes an efficient approach to the automatic design of networks of threshold gates from functional specifications. Results for widely used logic functions and standard benchmark circuits are reported.

0 Bookmarks
 · 
84 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the recent developments in emerging switching devices the significance of threshold logic gates has drastically increased in recent years. There is an increased need to test for manufacturing defects and, in particular, for delay defects. An automatic test pattern generation approach for the transition delay fault model of pipelined current mode threshold logic circuits is introduced. This approach takes into consideration an ordering of the patterns at the input of the selected gate in order to ensure the maximum transition delay. Experimental results show the efficiency of the proposed method on selected critical gates.
    2014 9th International Conference on Design & Technology of Integrated Systems in Nanoscale Era (DTIS); 05/2014
  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A simple game consists of winning and losing coalitions of players. An integer weight for each player and an integer quota is called a weighted representation of a simple game if a coalition is winning if and only if the sum of the weights of the players meets or exceeds the quota. In this paper we present a novel approach to find weighted representations of simple games if there is one and prove the opposite otherwise. To this end, we use quasi-reduced and ordered binary decision diagrams (Qobdd) to represent a simple game and we use linear programs based on the structure of that representation. In this case the number of constraints in the linear program and the number of variables is linear in the size of the representation which is often much smaller than representations based on coalitions and models of coalitions, respectively. By way of experiments we show that the novel method is superior to the linear programming approach that uses models of the shift-minimal winning and shift-maximal losing coalitions if the number of players increases but the maximum weight of each players does not grow to too fast. Additionally, is computationally very simple to obtain the Qobdd representation of the winning coalitions of a simple game.

Preview

Download
1 Download
Available from