Browse

COP:A Crosstalk OPtimizer for Gridded Channel Routing

DC Field Value Language
dc.contributor.authorJhang, Kyoung-Son-
dc.contributor.authorHa, Soonhoi-
dc.contributor.authorJhon, Chu Shik-
dc.date.accessioned2009-08-28T05:31:11Z-
dc.date.available2009-08-28T05:31:11Z-
dc.date.issued1996-04-
dc.identifier.citationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 15, No. 4, pp. 424-429, 1996en
dc.identifier.issn0278-0070-
dc.identifier.urihttp://hdl.handle.net/10371/7996-
dc.description.abstractThe interwire spacing in a VLSI chip becomes closer as
the VLSI fabrication technology rapidly evolves. Accordingly, it becomes
important to consider crosstalk caused by the coupling capacitance
between adjacent wires in the layout design for the fast and safe VLSI
circuits. The upper bounds of the allowable crosstalk for nets, called
crosstalk constraints, are usually given in the design specification. This
paper proposes a crosstalk minimization technique based on segment
rearrangement for gridded channel routing. The technique repeatedly
rearranges horizontal wire segments and/or increase the number of tracks
to satisfy the crosstalk constraints. With experiments, we ohserved that
the presented technique is more effective than the track permutation
technique.
en
dc.language.isoen-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectTheoretical studyen
dc.subjectComputer aided designen
dc.subjectIntegrated circuiten
dc.subjectRoutingen
dc.subjectMinimizationen
dc.subjectCrosstalken
dc.titleCOP:A Crosstalk OPtimizer for Gridded Channel Routingen
dc.typeArticleen
dc.contributor.AlternativeAuthor장경선-
dc.contributor.AlternativeAuthor하순회-
dc.contributor.AlternativeAuthor전주식-
dc.identifier.doi10.1109/43.494705-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Computer Science and Engineering (컴퓨터공학부)Journal Papers (저널논문_컴퓨터공학부)
Files in This Item:
There are no files associated with this item.
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse