The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
VLSI module placement based on rectangle-packing by the sequence-pair
Abstract
The earliest and the most critical stage in VLSI layout design is the placement. The background is the rectangle packing problem: given a set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing is uncountably infinite, the key issue for successful optimization is the introduction of a finite solution space which includes an optimal solution. This paper proposes such a solution space where each packing is represented by a pair of module name sequences, called a sequence-pair. Searching this space by simulated annealing, hundreds of modules have been packed efficiently as demonstrated. For applications to VLSI layout, we attack the biggest MCNC benchmark ami49 with a conventional wiring area estimation method, and obtain a highly promising placement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Orthogonal Packings in Two Dimensions
Baker, B. S., Coffman, Jr., & Rivest, R. L. (1980) · SIAM Journal on Computing · doi:10.1137/0209064 · Cited by 700
A New Algorithm for Floorplan Design
Wong, M. D. F., & Liu, C. L. (1986) · doi:10.5555/318013.318030 · Cited by 474
Cited by
Operations research at container terminals: a literature update
Stahlbock, R., & Voß, S. (2007) · OR Spectrum · doi:10.1007/s00291-007-0100-9 · Cited by 1,070
Fixed-outline floorplanning: enabling hierarchical design
Adya, S. N., & Markov, I. L. (2003) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2003.817546 · Cited by 410
Xavier-de-Souza, S., Suykens, J. A. K., Vandewalle, J., & Bolle, D. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2020435 · Cited by 321
Mobile traffic forecasting for maximizing 5G network slicing resource utilization
Sciancalepore, V., Samdanis, K., Costa-Perez, X., Bega, D., Gramaglia, M., & Banchs, A. (2017) · IEEE INFOCOM 2017 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2017.8057230 · Cited by 280
AutoDMP: Automated DREAMPlace-based Macro Placement
Agnesina, A., Rajvanshi, P., Yang, T., Pradipta, G., Jiao, A., Keller, B., Khailany, B., & Ren, H. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578923 · Cited by 52
Metadata
- Authors
- Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1996
- Volume
- 15
- Issue
- 12
- Pages
- 1518-1524
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2154462472
- Cited by
- 751
- References
- 2
- FWCI
- 5.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.