Graph-based transistor network generation method for supergate design
Transistor network optimization represents an effective way of improving VLSI circuits. This
paper proposes a novel method to automatically generate networks with minimal transistor …
paper proposes a novel method to automatically generate networks with minimal transistor …
MiniTNtk: An Exact Synthesis-based Method for Minimizing Transistor Network
Transistor network minimization is an important step in designing new standard cells.
Existing methods for minimizing transistor networks all rely on some heuristic techniques …
Existing methods for minimizing transistor networks all rely on some heuristic techniques …
Possible reductions to generate circuits from bdds
ED Brandão, JP Nespolo, RD Peralta… - 2022 IEEE Computer …, 2022 - ieeexplore.ieee.org
This paper presents a systematic way to derive digital circuits from Binary Decision
Diagrams (BDDs). It is well known that BDD nodes correspond to the Shannon …
Diagrams (BDDs). It is well known that BDD nodes correspond to the Shannon …
Effect of Unique Table Implementation in the Performance of BDD Packages
JP Nespolo, RD Peralta, PF Butzen… - 2023 36th SBC …, 2023 - ieeexplore.ieee.org
This paper presents an evaluation of the data structures that implement the unique tables
used to represent the Binary Decision Diagrams (BDD) nodes in the strong canonical form of …
used to represent the Binary Decision Diagrams (BDD) nodes in the strong canonical form of …
Improving the methodology to build non-series-parallel transistor arrangements
This paper presents an improvement in our previous methodology to generate efficient
transistor networks. The proposed method applies graph-based optimizations and is …
transistor networks. The proposed method applies graph-based optimizations and is …
NSP kernel finder-A methodology to find and to build non-series-parallel transistor arrangements
VN Possani, FS Marques… - … 25th Symposium on …, 2012 - ieeexplore.ieee.org
The transistor arrangement optimization is an effective possibility to improve logic gates and,
consequently, VLSI design. This paper presents a graph-based methodology to determine if …
consequently, VLSI design. This paper presents a graph-based methodology to determine if …
A fast heuristic for extending standard cell libraries with regular macro cells
C Pilato, F Ferrandi, D Pandini - 2010 IEEE Computer Society …, 2010 - ieeexplore.ieee.org
Nowadays, design issues related to physical design and scalability are becoming the main
bottlenecks of modern tools for technology mapping, limiting the usage of large cells. On the …
bottlenecks of modern tools for technology mapping, limiting the usage of large cells. On the …
Transistor-level optimization of CMOS complex gates
VN Possani, FS Marques… - 2013 IEEE 4th Latin …, 2013 - ieeexplore.ieee.org
This paper presents a new methodology to generate efficient transistor networks. Transistor-
level optimization consists in an effective possibility to increase design quality when …
level optimization consists in an effective possibility to increase design quality when …
Efficient transistor-level design of CMOS gates
The transistor arrangement optimization is an effective possibility to improve VLSI design,
especially when generating CMOS logic gates to be inserted in standard cell libraries. This …
especially when generating CMOS logic gates to be inserted in standard cell libraries. This …
A graph-based technique to optimize transistor networks
VN Possani, ÉF Timm, LV Agostini… - 2011 IEEE Second …, 2011 - ieeexplore.ieee.org
The number of transistors required for implementing a logic function is an essential
consideration in digital VLSI design. While the generation of a series-parallel network can …
consideration in digital VLSI design. While the generation of a series-parallel network can …