Devendra Vidhani

The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout? (2008)

Piotr Berman, Andrewb. Kahng, Devendra Vidhani

Abstract. Given a graph G with weighted edges, and a subset of nodes T,theT-join problem asks for a minimum weight edgesetA such thata node u is incident to an odd number of edges of A i u 2 T.We...

Abstract Noise Model for Multiple Segmented Coupled RC Interconnects (2008)

Andrew B. Kahng, Sudhakar Muddu, Niranjan Pol, Devendra Vidhani

Performance of high-speed VLSI circuits is increasingly limited by interconnect coupling noise. We present simple and improved analytical models for noise phenomena due to coupling capacitance. We...

Noise Model for Multiple Segmented Coupled RC Interconnects (2007)

Andrew B. Kahng, Sudhakar Muddu, Niranjan Pol, Devendra Vidhani

Performance of high-speed VLSI circuits is increasingly limited by interconnect coupling noise. We present simple and improved analytical models for noise phenomena due to coupling capacitance. We...

Optimal Phase Con ict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky X

We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions....

Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky

We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...

Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alex Zelikovsky

We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...

The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout (1999)

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky

. Given a graph G with weighted edges, and a subset of nodes T , the T -join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A iff u 2 T . We...

Noise and Delay Uncertainty Studies for Coupled RC Interconnects (1999)

Andrew B. Kahng, Sudhakar Muddu, Devendra Vidhani

The performance of high-speed VLSI circuits is increasingly limited by interconnect coupling noise. In this paper we present a closed-form crosstalk noise model with accuracy comparable to that of...

Noise and Delay Estimation for Coupled RC Interconnects (1999)

Andrew Kahng, Sudhakar Muddu, Devendra Vidhani

The performance of high-speed VLSI circuits is increasingly limited by interconnect coupling noise. We provide improved, easily computable estimates of crosstalk peak noise, as well as impact of...

Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alex Zelikovsky

We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...