| dc.creator | Dadaliaris A.N., Nerantzaki E., Oikonomou P., Hatzaras Y., Troumpoulou A.-O., Arvanitakis I., Stamoulis G.I. | en |
| dc.date.accessioned | 2023-01-31T07:48:43Z | |
| dc.date.available | 2023-01-31T07:48:43Z | |
| dc.date.issued | 2016 | |
| dc.identifier | 10.1145/2984393.2984410 | |
| dc.identifier.isbn | 9781450348102 | |
| dc.identifier.uri | http://hdl.handle.net/11615/72982 | |
| dc.description.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. | en |
| dc.language.iso | en | en |
| dc.source | ACM International Conference Proceeding Series | en |
| dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994111847&doi=10.1145%2f2984393.2984410&partnerID=40&md5=ca4dcb8e7169fb13296fa15ee592a63a | |
| dc.subject | Authentication | en |
| dc.subject | Computer aided design | en |
| dc.subject | Contracts | en |
| dc.subject | Social networking (online) | en |
| dc.subject | Combined solution | en |
| dc.subject | Delay overheads | en |
| dc.subject | Detailed placement | en |
| dc.subject | Legalization | en |
| dc.subject | Overall design | en |
| dc.subject | Placement methods | en |
| dc.subject | Standard cell design | en |
| dc.subject | Standard-cell placement | en |
| dc.subject | Computer networks | en |
| dc.subject | Association for Computing Machinery | en |
| dc.title | Enhanced tetris legalization | en |
| dc.type | conferenceItem | en |