scholarly journals An ILP Formulation for Minimizing the Number of Feedthrough Cells in a Standard Cell Placement

VLSI Design ◽  
1999 ◽  
Vol 10 (2) ◽  
pp. 169-176
Author(s):  
Jin-Tai Yan
Keyword(s):  
Linear Programming ◽  
Vlsi Circuits ◽  
Total Cell ◽  
Cell Area ◽  
Standard Cell ◽  
Standard Cells ◽  
A Cell ◽  
Cell Placement ◽  
Layout Area ◽  
Search Approach

It is well known that standard cells have been widely used to implement VLSI circuits in the automation of physical design. Since one major aim of a cell-based design is to minimize total layout area in a standard cell placement, the number of feedthrough cells will be minimized to reduce total cell area in a standard cell placement. In this paper, first, we model a partitioning-based row assignment (PRA) problem to minimize the number of feedthrough cells in a standard cell placement. Furthermore, an integer linear programming (ILP) approach is proposed to solve the PRA problem in a standard cell placement. Finally, the ILP approach has been implemented and two standard-cell netlists, Primary 1 and Primary 2, have been tested by the proposed approach, Bose's approach [4] and an exhaustive search approach, respectively. The experimental results show that the ILP approach obtains fewer feedthrough cells than Bose's approach in a partitioning-based standard cell placement.

Modern Standard-cell Placement Techniques

2001 ◽  
pp. 45-87
Author(s):  
Xiaojian Yang ◽  
Elaheh Bozorgzadeh ◽  
Majid Sarrafzadeh ◽  
Maogang Wang
Keyword(s):  
Standard Cell ◽  
Cell Placement ◽  
Modern Standard

Gastric inhibitory polypeptide release from a tumor-derived cell line

1995 ◽  
Vol 269 (2) ◽  
pp. E316-E322 ◽  
Author(s):  
T. J. Kieffer ◽  
Z. Huang ◽  
C. H. McIntosh ◽  
A. M. Buchan ◽  
J. C. Brown ◽  
...  
Keyword(s):  
Cell Line ◽  
High Performance ◽  
Neutralizing Antibody ◽  
Gastric Inhibitory Polypeptide ◽  
Total Cell ◽  
Controlled Environment ◽  
Intestinal Tumors ◽  
Cell Content ◽  
Basal Release ◽  
A Cell

A cell line derived from intestinal tumors of transgenic mice (STC-1) was subcloned to produce a stable line with approximately 30% immunoreactive gastric inhibitory polypeptide (irGIP)-containing cells (STC 6-14). High-performance liquid chromatography (HPLC) of STC 6-14 extracts indicated that the tumor cell-derived irGIP had the same retention time as synthetic porcine GIP-(1-42) (pGIP). Approximately 30% of the cells also contained immunoreactive somatostatin (irSS), which eluted as a single peak on HPLC, corresponding with SS-(1-14). On average, each well of extracted cells (5.0 x 10(5) cultured 4 days) contained 33.3 +/- 1.4 ng irGIP and 18.4 +/- 1.5 ng irSS. Basal release of irGIP in the presence of 5 mM glucose was 733 +/- 58 pg.ml cells-1.2h-1 (2.20 +/- 0.17% of total cell content; TCC) and doubled at 20 mM glucose (4.20 +/- 0.42% TCC). The response to glucose was augmented by addition of a SS neutralizing antibody (SOMA-10) and suppressed by 10 nM SS. Basal release of irSS in 5 mM glucose was 377 +/- 35 pg.ml cells-1.2h-1 (2.05 +/- 0.19% TCC) and was increased by glucose (> or = 15 mM) and the addition of pGIP (> or = 1 nM). The STC 6-14 cell line represents a model to study the synthesis, storage, and release of GIP and SS in a controlled environment.

Miniature Spatial Heterodyne Raman Spectrometer with a Cell Phone Camera Detector

2016 ◽  
Vol 71 (5) ◽  
pp. 988-995 ◽  
Author(s):  
Patrick D. Barnett ◽  
S. Michael Angel
Keyword(s):  
Cell Phone ◽  
Diffraction Gratings ◽  
Standard Cell ◽  
High Quality ◽  
Charge Coupled Device ◽  
Raman Spectrometer ◽  
A Cell ◽  
Cooled Ccd ◽  
Ccd Detectors ◽  
Quality Imaging

A spatial heterodyne Raman spectrometer (SHRS) with millimeter-sized optics has been coupled with a standard cell phone camera as a detector for Raman measurements. The SHRS is a dispersive-based interferometer with no moving parts and the design is amenable to miniaturization while maintaining high resolution and large spectral range. In this paper, a SHRS with 2.5 mm diffraction gratings has been developed with 17.5 cm−1 theoretical spectral resolution. The footprint of the SHRS is orders of magnitude smaller than the footprint of charge-coupled device (CCD) detectors typically employed in Raman spectrometers, thus smaller detectors are being explored to shrink the entire spectrometer package. This paper describes the performance of a SHRS with 2.5 mm wide diffraction gratings and a cell phone camera detector, using only the cell phone’s built-in optics to couple the output of the SHRS to the sensor. Raman spectra of a variety of samples measured with the cell phone are compared to measurements made using the same miniature SHRS with high-quality imaging optics and a high-quality, scientific-grade, thermoelectrically cooled CCD.

scholarly journals Improved Parallel Legalization Schemes for Standard Cell Placement with Obstacles

Technologies ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 3
Author(s):  
Panagiotis Oikonomou ◽  
Antonios Dadaliaris ◽  
Kostas Kolomvatsos ◽  
Thanasis Loukopoulos ◽  
Athanasios Kakarountas ◽  
...  
Keyword(s):  
Target Function ◽  
Problem Formulation ◽  
Search Space ◽  
Standard Cell ◽  
Chip Area ◽  
Time Performance ◽  
Trade Offs ◽  
Cell Placement ◽  
Placement Algorithm ◽  
Algorithmic Approaches

In standard cell placement, a circuit is given consisting of cells with a standard height, (different widths) and the problem is to place the cells in the standard rows of a chip area so that no overlaps occur and some target function is optimized. The process is usually split into at least two phases. In a first pass, a global placement algorithm distributes the cells across the circuit area, while in the second step, a legalization algorithm aligns the cells to the standard rows of the power grid and alleviates any overlaps. While a few legalization schemes have been proposed in the past for the basic problem formulation, few obstacle-aware extensions exist. Furthermore, they usually provide extreme trade-offs between time performance and optimization efficiency. In this paper, we focus on the legalization step, in the presence of pre-allocated modules acting as obstacles. We extend two known algorithmic approaches, namely Tetris and Abacus, so that they become obstacle-aware. Furthermore, we propose a parallelization scheme to tackle the computational complexity. The experiments illustrate that the proposed parallelization method achieves a good scalability, while it also efficiently prunes the search space resulting in a superlinear speedup. Furthermore, this time performance comes at only a small cost (sometimes even improvement) concerning the typical optimization metrics.

Sign in / Sign up

Export Citation Format

Share Document