628 search results - page 74 / 126 » The minimum shift design problem |
ICCAD
2008
IEEE
15 years 8 months ago
2008
IEEE
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
105
click to vote
FGCN
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
105
click to vote
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
101
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...