Show simple item record

dc.contributor.advisorHu, Jiang
dc.creatorZhao, Qiong
dc.date.accessioned2012-07-16T15:58:20Z
dc.date.accessioned2012-07-16T20:24:17Z
dc.date.available2012-07-16T15:58:20Z
dc.date.available2012-07-16T20:24:17Z
dc.date.created2012-05
dc.date.issued2012-07-16
dc.date.submittedMay 2012
dc.identifier.urihttps://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11018
dc.description.abstractTrack assignment is a critical step between global routing and detailed routing in modern VLSI chip designs. It greatly affects some very important design characteristics, such as routability, via usage and timing performance. Crosstalk, which is largely decided by wire adjacency, has significant impact on interconnect delay and circuit performance. Therefore, the amount of crosstalk should be restrained in order to satisfy timing constraints. In this work, a track assignment approach is proposed to control crosstalk-induced performance degradation. The problem is formulated as a Traveling Salesman Problem (TSP) and solved by a graph-based heuristic. The proposed approach is implemented and tested on benchmark circuits from the ISPD2011 contest and the experimental results are quite promising.en
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectVLSIen
dc.subjectGlobal Routingen
dc.subjectTrack Assignmenten
dc.subjectCrosstalken
dc.titleTrack Assignment Considering Crosstalk-Induced Performance Degradationen
dc.typeThesisen
thesis.degree.departmentElectrical and Computer Engineeringen
thesis.degree.disciplineComputer Engineeringen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameMaster of Scienceen
thesis.degree.levelMastersen
dc.contributor.committeeMemberLi, Peng
dc.contributor.committeeMemberMahapatra, Rabi N.
dc.type.genrethesisen
dc.type.materialtexten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record