TY - GEN
T1 - Area minimization synthesis for reconfigurable single-electron transistor arrays with fabrication constraints
AU - Chen, Yi Hang
AU - Chen, Jian Yu
AU - Huang, Juinn-Dar
PY - 2014/3/24
Y1 - 2014/3/24
N2 - As fabrication processes exploit even deeper submicron technology, power dissipation has become a crucial issue for most electronic circuit and system designs nowadays. In particular, leakage power is becoming a dominant source of power consumption. Recently, the reconfigurable single-electron transistor (SET) array has been proposed as an emerging circuit design style for continuing Moore's Law due to its ultra-low power consumption. Several automated synthesis approaches have been developed for the reconfigurable SET array in the past few years. Nevertheless, all of those existing methods consider fabrication constraints, which are mandatory, merely in late synthesis stages. In this paper, we propose a synthesis algorithm, featuring both variable reordering and product term reordering, for area minimization. In addition, our algorithm takes those mandatory fabrication constraints into account in early stages for better outcomes. Experimental results show that our new method can achieve an area reduction of up to 24% as compared to current state-of-the-art techniques.
AB - As fabrication processes exploit even deeper submicron technology, power dissipation has become a crucial issue for most electronic circuit and system designs nowadays. In particular, leakage power is becoming a dominant source of power consumption. Recently, the reconfigurable single-electron transistor (SET) array has been proposed as an emerging circuit design style for continuing Moore's Law due to its ultra-low power consumption. Several automated synthesis approaches have been developed for the reconfigurable SET array in the past few years. Nevertheless, all of those existing methods consider fabrication constraints, which are mandatory, merely in late synthesis stages. In this paper, we propose a synthesis algorithm, featuring both variable reordering and product term reordering, for area minimization. In addition, our algorithm takes those mandatory fabrication constraints into account in early stages for better outcomes. Experimental results show that our new method can achieve an area reduction of up to 24% as compared to current state-of-the-art techniques.
KW - area minimization
KW - automatic synthesis
KW - binary decision diagram
KW - reconfigurable
KW - single-electron transistor
UR - http://www.scopus.com/inward/record.url?scp=84903825169&partnerID=8YFLogxK
U2 - 10.7873/DATE2014.136
DO - 10.7873/DATE2014.136
M3 - Conference contribution
AN - SCOPUS:84903825169
SN - 9783981537024
T3 - Proceedings -Design, Automation and Test in Europe, DATE
BT - 2014 Design, Automation and Test in Europe Conference and Exhibition (DATE)
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 17th Design, Automation and Test in Europe, DATE 2014
Y2 - 24 March 2014 through 28 March 2014
ER -