CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Enhanced tetris legalization
Authors
Nerantzaki E., Oikonomou P., Hatzaras Y., Troumpoulou A.-O., Arvanitakis I., Stamoulis G.I. Dadaliaris A.N.
Publication date
1 January 2016
Publisher
'Association for Computing Machinery (ACM)'
Doi
Cite
Abstract
Legalization and detailed placement methods for standard cell designs, are two of the most notable topics in current VLSI research. Being the final steps in a classic placement procedure they must be efficient in terms of the delay overhead they introduce to the overall design flow and the quality of the final solution. In this paper we present a combined solution of the aforementioned steps, based on Tetris a particular simple and fast legalization algorithm, that produces considerable results taking into account the tradeoff between total wirelength, total cell displacement and runtime. © 2016 ACM
Similar works
Full text
Available Versions
University of Thessaly Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.lib.uth.gr:11615/72982
Last time updated on 13/02/2023