Results 1 - 10
of
1,192
Interconnection Analysis for Standard Cell Layouts
"... We present an accurate model and procedures for predicting the common physical design characteristics of standard cell layouts (i.e., the interconnection length and the chip area). The predicted results are obtained from analysis of the net list only, that is, no prior knowledge of the functionalit ..."
Abstract
- Add to MetaCart
We present an accurate model and procedures for predicting the common physical design characteristics of standard cell layouts (i.e., the interconnection length and the chip area). The predicted results are obtained from analysis of the net list only, that is, no prior knowledge
Interconnection length estimation for optimized standard cell layouts
- In Proceedings of the IEEE International Conference on Computer Aided Design
, 1989
"... In this paper, we present an accurate model for prediction of interconnection lengths for standard cell layouts. On the designs in our test suite the estimates are within 10 % of the actual layouts. Our model abstracts the important features of placement, global rout ing and channel routing. The pre ..."
Abstract
-
Cited by 30 (7 self)
- Add to MetaCart
In this paper, we present an accurate model for prediction of interconnection lengths for standard cell layouts. On the designs in our test suite the estimates are within 10 % of the actual layouts. Our model abstracts the important features of placement, global rout ing and channel routing
PBERI Wing Plan – A Cell Layout Strategy
"... Abstract — The need of the hour in the field of cellular and mobile communication is to improve the ability of the cell to service more number of subscribers (traffic) at the given bandwidth with least interference and with minimum power levels. We have suggested a cell layout strategy ..."
Abstract
- Add to MetaCart
Abstract — The need of the hour in the field of cellular and mobile communication is to improve the ability of the cell to service more number of subscribers (traffic) at the given bandwidth with least interference and with minimum power levels. We have suggested a cell layout strategy
Parallel Hierarchical Global Routing for General Cell Layout
"... In this paper we present a parallel global routing al-gorithm for general cell layout. The algorithm applies a hierarchical decomposition strategy that recursively di-vides routing problems into simple, independent sub-problems for parallel processing. The solution of each subproblem is based on int ..."
Abstract
- Add to MetaCart
In this paper we present a parallel global routing al-gorithm for general cell layout. The algorithm applies a hierarchical decomposition strategy that recursively di-vides routing problems into simple, independent sub-problems for parallel processing. The solution of each subproblem is based
Scheduling in robotic cells: process flexibility and cell layout
, 2006
"... The focus of this study is the identical parts robotic cell scheduling problem with m machines under the assumption of process and operational flexibility. A direct consequence of this assumption is a new robot move cycle that has been overlooked in the existing literature. We prove that this new cy ..."
Abstract
- Add to MetaCart
cycle dominates all classical robot move cycles considered in the literature for m 2. We also prove that changing the layout from an in-line robotic cell to a robot-centered cell reduces the cycle time of the proposed cycle even further, whereas the cycle times of all other cycles remain the same
LiB: A Cell Layout Generator
, 1990
"... We present an automatic layout generation system, called LiB. for the library cells used in CMOS ASIC design LiB takes a transistor-level circuit schematic in SPICE format and outputs a symbolic layout. Our layout style is similar to that proposed by Uehara and van Cleemput in [17]. We propose sever ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
We present an automatic layout generation system, called LiB. for the library cells used in CMOS ASIC design LiB takes a transistor-level circuit schematic in SPICE format and outputs a symbolic layout. Our layout style is similar to that proposed by Uehara and van Cleemput in [17]. We propose
Timing-Driven Placement for General Cell Layout
, 1990
"... In this paper we present a hierarchical technique for the timing-driven placement of the general cells. We assume that maximum interconnection delays for nets are given. We transform these timing constraints to net length constraints using technology and process de-pendent parameters, circuit specif ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
In this paper we present a hierarchical technique for the timing-driven placement of the general cells. We assume that maximum interconnection delays for nets are given. We transform these timing constraints to net length constraints using technology and process de-pendent parameters, circuit
Topology-Driven Cell Layout Migration with Collinear Constraints
"... Traditional layout migration focuses on area minimization, thus suffered wire distortion, which caused loss of layout topology. A migrated layout inheriting original topology owns original design intention and predictable property, such as wire length which determines the path delay importantly. Thi ..."
Abstract
- Add to MetaCart
Traditional layout migration focuses on area minimization, thus suffered wire distortion, which caused loss of layout topology. A migrated layout inheriting original topology owns original design intention and predictable property, such as wire length which determines the path delay importantly
An Efficient Algorithm To Inter And Intra-Cell Layout Problems
- In Cellular Manufacturing Systems With Stochastic Demands” Springer (Received: January 31, 2005 - Accepted in Revised Form: August 9
"... ch ive of ..."
Results 1 - 10
of
1,192