Proceedings of IEEE International Conference on Computer Aided Design (ICCAD) ICCAD-97 1997
DOI: 10.1109/iccad.1997.643608
|View full text |Cite
|
Sign up to set email alerts
|

Library-less synthesis for static CMOS combinational logic circuits

Abstract: Traditional synthesis techniques optimize CMOS circuits in two phases i) logic minimization and ii) library mapping phase. Typically, the structures and the sizes of the gates in the library are chosen to yield a good synthesis results over many blocks or even for an entire chip. Consequently, this approach precludes an optimal design of individual blocks which may need custom structures. In this paper we present a new transistor bvel technique that optimizes CMOS circuits both structurally and size-wise. Our … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
27
0

Year Published

1998
1998
2011
2011

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(27 citation statements)
references
References 10 publications
0
27
0
Order By: Relevance
“…The targets of latest improvements in combinational logic synthesis are refined covering algorithms [Cou92,Lia97,Gol97], optimizations on networks described using black boxes [Liu97], power optimization [Nar97,Tiw96], etc. Similarly, the research activity in technology mapping has been streamlined towards library- [Gav97,Ped96] and LUT-targeted [Hua96,Con96a] algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…The targets of latest improvements in combinational logic synthesis are refined covering algorithms [Cou92,Lia97,Gol97], optimizations on networks described using black boxes [Liu97], power optimization [Nar97,Tiw96], etc. Similarly, the research activity in technology mapping has been streamlined towards library- [Gav97,Ped96] and LUT-targeted [Hua96,Con96a] algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…Boolean methods are able to overcome the structural bias [18] of the circuit being mapped, because they do not depend on the DAG structure, but only on the function being mapped. Another important point is that the associative methods to compute series transistor constraints used in [6,7,8,9,10] are monotonically increasing with the association, meaning the association of two functions will always have more transistors in series. The Boolean method is non monotonic, meaning the association of two functions can reduce the number of transistors in series.…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, the use of such approaches was not widely verified in a commercial level, even if other references suggest that the increased number of cells in a library could lead to significant improvements in the quality of the final design [7][8][9][10]. A recent approach presented in [11] suggests that the addition of some custom cells to a library can improve the speed of the final circuit.…”
Section: Introductionmentioning
confidence: 99%
“…A more complete exploration of the available design space can be made possible by the use of a wider range of possible gates, including complex static gates, which necessitates the use of dynamically generated libraries. The maturation of module generation techniques in layout synthesis has made the use of dynamic libraries more feasible, and their use in an industrial setting has been published in [3].…”
Section: Introductionmentioning
confidence: 99%
“…One approach performs technology mapping based on the estimated placement information [1,2,8], possibly even modeling the effects of incremental updates to the placement without actually reperforming the placement [8]; we refer to this kind of method as placement-based mapping. Another trend is to perform logic resynthesis based on the placement information [3,5,10,12]; this kind of method is called remapping. Our work differs from these in that we more completely merge the technology mapping and placement procedures by performing logic optimization considering the placement information.…”
Section: Introductionmentioning
confidence: 99%