Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
This project implement a algonthm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module in...
Saved in:
主要作者: | Misnan, Azizi |
---|---|
格式: | Thesis |
语言: | English |
出版: |
1997
|
在线阅读: | https://ir.uitm.edu.my/id/eprint/101322/1/101322.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
由: Misnan, Azizi
出版: (1997) -
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
由: Hanafiah, Sukri
出版: (1997) -
FPGA implementation of bipartite graph matching algorithm
由: Kua , Wee Soo
出版: (2011) -
Chromaticity of Certain Bipartite Graphs
由: Hasni @ Abdullah, Roslan
出版: (2005) -
Bipartite Graph Algorithm With Reference Frame Representation For Protein Tertiary Structure Matching
由: Othman, Fazilah
出版: (2010)