Proceedings. Tenth Annual IEEE International ASIC Conference and Exhibit (Cat. No.97TH8334)
DOI: 10.1109/asic.1997.617005
|View full text |Cite
|
Sign up to set email alerts
|

Synthesize pass transistor logic gate by using free binary decision diagram

Abstract: In this paper, Heuristic algorithm for Free BDD node minimization is presented. This algorithm is designed to minimize small size FBDDs with application to synthesize Pass Transistor Logic gate families. Experimental results based on 169 single output functions from MCNC benchmark two-level logic examples indicate 22 to 24 % reduction of node count compared with initial ROBDD. Also, experimental results based on HWB functions (N=3 -16) indicate node count reduced to 30 to 40 % larger than theoretical limit.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…For example, the variable s associated with the node in Figure 1(b) is the control signal in the multiplexer in Figure 1(a). Pass‐transistor logic (PTL) has the capability to implement a logic function with a smaller number of transistors and less power dissipation, and several studies on realizing circuits with PTL have been published 1–4, showing that this technology is viable. Unfortunately, a function may require BDD representation of exponential size if it is mapped onto PTL 5.…”
Section: Introductionmentioning
confidence: 99%
“…For example, the variable s associated with the node in Figure 1(b) is the control signal in the multiplexer in Figure 1(a). Pass‐transistor logic (PTL) has the capability to implement a logic function with a smaller number of transistors and less power dissipation, and several studies on realizing circuits with PTL have been published 1–4, showing that this technology is viable. Unfortunately, a function may require BDD representation of exponential size if it is mapped onto PTL 5.…”
Section: Introductionmentioning
confidence: 99%