16 October 2003 in Electronics Letters
7 December 1995 in Electronics Letters
A new implementation of a threshold gate based on a latch-type comparator that does not consume static power is presented. Simulation results indicate high operation speed and low power consumption, which make it very attractive when used as a basic building block in digital design.
1 February 2008 in Microelectronics Journal
11 September 2006 in IEEE Transactions on Nanotechnology
The augmentation of transistor technologies with resonant tunnelling diodes (RTDs) has demonstrated improved circuit performance. The negative differential resistance exhibited by these devices can be exploited to increase the functionality implemented by a single gate in comparison to transistor-only technologies. Complex threshold gates (TGs) are efficiently realized by resorting to the operation principle of the clocked series connection of a pair of RTDs (MOBILE). This paper focuses the implementation of logic blocks using RTDs and transistors which further increase the functionality of previously reported topologies. Multithreshold-threshold gates (MTTGs) is the logic concept underlying the proposed realizations. The MOBILE principle is extended to three or more RTDs in series which allows us to implement MTTGs. Novel and extremely compact realizations of programmable gates using the MTTG topology are presented. A number of logic blocks useful for digital design are shown and their operation is verified through simulation with extensively validated models for actual devices
1 January 1994 in IEE Proceedings - Computers and Digital Techniques
The authors describe a state assignment algorithm for FSMs which produces an assignment of non-necessarily distinct, and eventually, incompletely specified codes. In this new approach, state-reduction and state assignment are dealt with concurrently, and a restricted state splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility relations among its states because the potentials of state merging are exploited during the state assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next state and output functions suitable to minimise with ESPRESSO. The machines in the MCNC benchmark set are used to test the new algorithm and to compare it with a well known state assignment program.