Linear decomposition algorithm for VLSI design applications

We propose a unified solution to both linear placement and partitioning. Our approach combines the well-known eigenvector optimization method with the recursive max-flow min-cut method. A linearized eigenvector method is proposed to improve the linear placement. A hypergraph maxflow algorithm is the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design s. 223 - 228
Hlavní autoři:	Li, Jianmin, Lillis, John, Cheng, Chung-Kuan
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Washington, DC, USA IEEE Computer Society 01.12.1995
Edice:	ACM Conferences
Témata:	Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Linear algebra algorithms Hardware > Electronic design automation > Physical design (EDA) > Placement Hardware > Electronic design automation > Physical design (EDA) > Wire routing Mathematics of computing > Mathematical analysis > Mathematical optimization Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on matrices Theory of computation > Design and analysis of algorithms > Mathematical optimization max-flow min-cut linear placement circuit partitioning eigenvector
ISBN:	9780818672132, 0818672137
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!