2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2014
DOI: 10.1109/iccad.2014.7001328
|View full text |Cite
|
Sign up to set email alerts
|

BDD-based synthesis of reconfigurable single-electron transistor arrays

Abstract: Single-electron transistor (SET) is an ultra-low power device, which has been demonstrated as a promising alternative for CMOS devices in reducing power consumption. A suitable structure for realizing logic function using SET is a binary decision diagram (BDD)-based SET array. Previous works proposed product term-based automated synthesis methods to map a given logic function onto an SET array. In this work, we propose a novel BDD-based synthesis method that exploits the structure similarity between an SET arr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…This first is based on Binary Decision Diagrams (BDD), a compact data structure for representing Boolean functions. In [Zhao et al, 2014], algorithms have been based on the reduced-order BDD (ROBDD) data structure, which further speeds up the computation time of attractor detection. These BDD-based solutions only work for BRNs of a hundred of nodes and also suffer from the infamous state explosion problem, as the size of the BDD depends both on the regulatory functions and the number of nodes in the BRN.…”
Section: Identifying Attractors: a Major Challengementioning
confidence: 99%
“…This first is based on Binary Decision Diagrams (BDD), a compact data structure for representing Boolean functions. In [Zhao et al, 2014], algorithms have been based on the reduced-order BDD (ROBDD) data structure, which further speeds up the computation time of attractor detection. These BDD-based solutions only work for BRNs of a hundred of nodes and also suffer from the infamous state explosion problem, as the size of the BDD depends both on the regulatory functions and the number of nodes in the BRN.…”
Section: Identifying Attractors: a Major Challengementioning
confidence: 99%
“…Several works were carried out to automate the mapping onto SET architecture [7][8][9][10]. These works started from representing the Boolean function as a BDD representation.…”
Section: Introductionmentioning
confidence: 99%
“…This representation is called a diamond fabric, where the edges cannot cross each other. Later, Zhao , et al [10] provided a structural method to transform the ROBDD Boolean function into a planar graph and then to an SET array. Of the above works, Vinay , et al [6] provide the best result in terms of energy delay, and Zhao , et al [10] give the best result in terms of area of the SET array.…”
Section: Introductionmentioning
confidence: 99%