IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 31 Issue: 7
- Vol: 31 Issue: 8
- Vol: 31 Issue: 9
- Vol: 31 Issue: 10
- Vol: 31 Issue: 11
- Vol: 31 Issue: 12
- Vol: 30 Issue: 1
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5
- Vol: 30 Issue: 6
- Vol: 30 Issue: 7
- Vol: 30 Issue: 8
- Vol: 30 Issue: 9
- Vol: 30 Issue: 10
- Vol: 30 Issue: 11
- Vol: 30 Issue: 12
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 29 Issue: 7
- Vol: 29 Issue: 8
- Vol: 29 Issue: 9
- Vol: 29 Issue: 10
- Vol: 29 Issue: 11
- Vol: 29 Issue: 12
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8
- Vol: 28 Issue: 9
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 23 Issue: 7
- Vol: 23 Issue: 8
- Vol: 23 Issue: 9
- Vol: 23 Issue: 10
- Vol: 23 Issue: 11
- Vol: 23 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 36 Issue: 1
- Vol: 36 Issue: 2
- Vol: 36 Issue: 3
- Vol: 36 Issue: 4
- Vol: 36 Issue: 5
- Vol: 36 Issue: 6
- Vol: 36 Issue: 7
- Vol: 36 Issue: 8
- Vol: 36 Issue: 9
- Vol: 36 Issue: 10
- Vol: 36 Issue: 11
- Vol: 36 Issue: 12
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 35 Issue: 7
- Vol: 35 Issue: 8
- Vol: 35 Issue: 9
- Vol: 35 Issue: 10
- Vol: 35 Issue: 11
- Vol: 35 Issue: 12
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5
- Vol: 34 Issue: 6
- Vol: 34 Issue: 7
- Vol: 34 Issue: 8
- Vol: 34 Issue: 9
- Vol: 34 Issue: 10
- Vol: 34 Issue: 11
- Vol: 34 Issue: 12
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 33 Issue: 7
- Vol: 33 Issue: 8
- Vol: 33 Issue: 9
- Vol: 33 Issue: 10
- Vol: 33 Issue: 11
- Vol: 33 Issue: 12
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 32 Issue: 7
- Vol: 32 Issue: 8
- Vol: 32 Issue: 9
- Vol: 32 Issue: 10
- Vol: 32 Issue: 11
- Vol: 32 Issue: 12
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 31 Issue: 7
- Vol: 31 Issue: 8
- Vol: 31 Issue: 9
- Vol: 31 Issue: 10
- Vol: 31 Issue: 11
- Vol: 31 Issue: 12
- Vol: 30 Issue: 1
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5
- Vol: 30 Issue: 6
- Vol: 30 Issue: 7
- Vol: 30 Issue: 8
- Vol: 30 Issue: 9
- Vol: 30 Issue: 10
- Vol: 30 Issue: 11
- Vol: 30 Issue: 12
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 29 Issue: 7
- Vol: 29 Issue: 8
- Vol: 29 Issue: 9
- Vol: 29 Issue: 10
- Vol: 29 Issue: 11
- Vol: 29 Issue: 12
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8
- Vol: 28 Issue: 9
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 24 Issue: 7
- Vol: 24 Issue: 8
- Vol: 24 Issue: 9
- Vol: 24 Issue: 10
- Vol: 24 Issue: 11
- Vol: 24 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 23 Issue: 7
- Vol: 23 Issue: 8
- Vol: 23 Issue: 9
- Vol: 23 Issue: 10
- Vol: 23 Issue: 11
- Vol: 23 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 36 Issue: 1
- Vol: 36 Issue: 2
- Vol: 36 Issue: 3
- Vol: 36 Issue: 4
- Vol: 36 Issue: 5
- Vol: 36 Issue: 6
- Vol: 36 Issue: 7
- Vol: 36 Issue: 8
- Vol: 36 Issue: 9
- Vol: 36 Issue: 10
- Vol: 36 Issue: 11
- Vol: 36 Issue: 12
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 35 Issue: 7
- Vol: 35 Issue: 8
- Vol: 35 Issue: 9
- Vol: 35 Issue: 10
- Vol: 35 Issue: 11
- Vol: 35 Issue: 12
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5
- Vol: 34 Issue: 6
- Vol: 34 Issue: 7
- Vol: 34 Issue: 8
- Vol: 34 Issue: 9
- Vol: 34 Issue: 10
- Vol: 34 Issue: 11
- Vol: 34 Issue: 12
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 33 Issue: 7
- Vol: 33 Issue: 8
- Vol: 33 Issue: 9
- Vol: 33 Issue: 10
- Vol: 33 Issue: 11
- Vol: 33 Issue: 12
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 32 Issue: 7
- Vol: 32 Issue: 8
- Vol: 32 Issue: 9
- Vol: 32 Issue: 10
- Vol: 32 Issue: 11
- Vol: 32 Issue: 12
Volume 25 Issue 12 • Dec. 2006
Sponsor
Filter Results
-
-
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems publication information
|
PDF (39 KB)
-
Variability-Aware Multilevel Integrated Spiral Inductor Synthesis
Publication Year: 2006, Page(s):2613 - 2625
Cited by: Papers (58)To successfully design spiral inductors in increasingly complex and integrated mixed-signal systems, effective design automation techniques must be created. In this paper, the authors develop an automated synthesis methodology for integrated spiral inductors to efficiently generate Pareto-optimal designs based on application requirements. At its core, the synthesis approach employs a scalable mult... View full abstract»
-
Reducing Conflict Misses by Application-Specific Reconfigurable Indexing
Publication Year: 2006, Page(s):2626 - 2637
Cited by: Papers (5)The predictability of memory access patterns in embedded systems can be successfully exploited to devise effective application-specific cache optimizations. In this paper, an improved indexing scheme for direct-mapped caches, which drastically reduces the number of conflict misses by using application-specific information, is proposed. The indexing scheme is based on the selection of a subset of t... View full abstract»
-
Circuit Reliability Analysis Using Symbolic Techniques
Publication Year: 2006, Page(s):2638 - 2649
Cited by: Papers (62)Due to the shrinking of feature size and the significant reduction in noise margins, nanoscale circuits have become more susceptible to manufacturing defects, noise-related transient faults, and interference from radiation. Traditionally, soft errors have been a much greater concern in memories than in logic circuits. However, as technology continues to scale, logic circuits are becoming more susc... View full abstract»
-
Design Exploration With Imprecise Latency and Register Constraints
Publication Year: 2006, Page(s):2650 - 2662This paper proposes a design exploration framework that considers impreciseness in design specification. In high-level synthesis, imprecise information is often encountered. Two types of impreciseness are considered, namely: 1) impreciseness underlying on functional unit specifications and 2) impreciseness due to system constraints, i.e., latency and register constraints. The framework is iterativ... View full abstract»
-
Latency-Guided On-Chip Bus-Network Design
Publication Year: 2006, Page(s):2663 - 2673
Cited by: Papers (4)Deep submicrometer technology scaling has two major ramifications on the design process. First, reduced feature size significantly increases wire delay, thus resulting in critical paths being dominated by global interconnect rather than gate delays. Second, an ultrahigh level of integration mandates design of systems-on-chip that encompass numerous design blocks of decreased functional granularity... View full abstract»
-
Retiming and Resynthesis: A Complexity Perspective
Publication Year: 2006, Page(s):2674 - 2686
Cited by: Papers (16)Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Although these transformations have been studied extensively for over a decade, questions about their optimization capability and verification complexity are not answered fully. Resolving these questions may be crucial in devel... View full abstract»
-
Protecting Combinational Logic Synthesis Solutions
Publication Year: 2006, Page(s):2687 - 2696
Cited by: Papers (18)Recently, design reuse has emerged as a dominant design and system-integration paradigm for modern systems on silicon. However, the intellectual-property-business model is vulnerable to many dangerous obstructions, such as misappropriation and copyright fraud. The authors propose a new method for intellectual-property protection that relies upon design watermarking at the combinational-logic-synth... View full abstract»
-
Joint Power Management of Memory and Disk Under Performance Constraints
Publication Year: 2006, Page(s):2697 - 2711
Cited by: Papers (8) | Patents (1)This paper presents a method to combine memory resizing and disk shutdown to achieve better energy savings than can be achieved individually. The method periodically adjusts the size of physical memory and the timeout value to shut down a hard disk to reduce the average energy consumption. Pareto distributions are used to model the disk idle time. The parameters of the distributions are estimated ... View full abstract»
-
Cycle-Based Decomposition of Markov Chains With Applications to Low-Power Synthesis and Sequence Compaction for Finite State Machines
Publication Year: 2006, Page(s):2712 - 2725
Cited by: Papers (1)This paper advances the state of the art by presenting a well-founded mathematical framework for modeling and manipulating Markov processes. The key idea is based on the fact that a Markov process can be decomposed into a collection of directed cycles with positive weights, which are proportional to the probability of the cycle traversals in a random walk. Two applications of this new formalism in... View full abstract»
-
An Efficient Low-Power Repeater-Insertion Scheme
Publication Year: 2006, Page(s):2726 - 2736Previous repeater-insertion algorithms for power minimization of realistic interconnect trees under given timing budgets are often time consuming. In this paper, the problem of runtime reduction for low-power repeater insertion is investigated. Specifically, a power-sensitivity analysis that links the algorithm runtime and the power dissipation result to the selection of repeater library and candi... View full abstract»
-
Energy-Optimal Speed Control of a Generic Device
Publication Year: 2006, Page(s):2737 - 2746The dynamic voltage and frequency scaling technique in CPUs is an example of adjusting a device's control variable to trade off power consumption and performance. This idea of energy optimization through speed control has been subsequently applied to other components of electronic systems such as disk drives and wireless transceivers. In this paper, the energy-optimal speed profile (a function of ... View full abstract»
-
Wafer Topography-Aware Optical Proximity Correction
Publication Year: 2006, Page(s):2747 - 2756
Cited by: Papers (11) | Patents (1)Depth of focus is the major contributor to lithographic process margin. One of the major causes of focus variation is imperfect planarization of fabrication layers. Presently, optical proximity correction (OPC) methods are oblivious to the predictable nature of focus variation arising from wafer topography. As a result, designers suffer from manufacturing yield loss as well as loss of design quali... View full abstract»
-
Timeless Discretization of Magnetization Slope in the Modeling of Ferromagnetic Hysteresis
Publication Year: 2006, Page(s):2757 - 2764
Cited by: Papers (10)A new methodology is presented to assure numerically reliable integration of the magnetization slope in the Jiles-Atherton model of ferromagnetic core hysteresis. Two hardware description language (HDL) implementations of the technique are presented: one in SystemC and the other in very-high-speed integrated circuit (VHSIC) HDL (VHDL) analog and mixed signal (AMS). The new model uses timeless disc... View full abstract»
-
An Analytical Fringe Capacitance Model for Interconnects Using Conformal Mapping
Publication Year: 2006, Page(s):2765 - 2774
Cited by: Papers (65) | Patents (2)An analytical model is proposed to compute the fringe capacitance between two nonoverlapping interconnects in different layers using a conformal mapping technique. With this technique, electric field lines are geometrically approximated to separately model the different capacitive components. These components are finally combined to obtain the equivalent fringe capacitance. Using the aforementione... View full abstract»
-
Resampling Plans for Sample Point Selection in Multipoint Model-Order Reduction
Publication Year: 2006, Page(s):2775 - 2783
Cited by: Papers (15)Multipoint projection methods have gained much notoriety in model-order reduction of linear, nonlinear, and parameter-varying systems. A well-known difficulty with such methods lies in the need for clever point selection to attain model compactness and accuracy. In this paper, the authors present a method for sample point selection in multipoint projection-based model-order reduction. The proposed... View full abstract»
-
A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards
Publication Year: 2006, Page(s):2784 - 2794
Cited by: Papers (33)As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. Therefore, it becomes important to route the nets within tight minimum and maximum length bounds. Although the problem of routing nets to satisfy maximum length constraints is a well-studied problem, there exists no sophisticated algorithm in literature that ensure... View full abstract»
-
Floorplan Design for Multimillion Gate FPGAs
Publication Year: 2006, Page(s):2795 - 2805
Cited by: Papers (16)Modern field-programmable gate arrays (FPGAs) have multimillions of gates and future generations of FPGAs will be even more complex. This means that floorplanning tools will soon be extremely important for the physical design of FPGAs. Due to the heterogeneous logic and routing resources of an FPGA, FPGA floorplanning is very different from the traditional floorplanning for application-specific in... View full abstract»
-
Zero-Change Netlist Transformations: A New Technique for Placement Benchmarking
Publication Year: 2006, Page(s):2806 - 2819In this paper, the authors introduce the concept of zero-change netlist transformations (ZCNTs) to: 1) quantify the suboptimality of existing placers on artificially constructed instances and 2) "partially" quantify the suboptimality of placers on synthesized netlists from arbitrary netlists by giving lower bounds to the suboptimality gap. Given a netlist and its placement from a placer, a class o... View full abstract»
-
Efficient Symbolic Algorithms for Computing the Minimum and Bounded Leakage States
Publication Year: 2006, Page(s):2820 - 2832Static power consumption due to subthreshold, gate, and junction leakages has become a significant component of the total power consumption. For nanoscale circuits, leakage poses one of the most important challenges to the continuation of Moore's law. The leakage of a logic gate varies by an order of magnitude over its Boolean input space. Thus, one way to minimize leakage in a circuit during stan... View full abstract»
-
Frequency-Domain Simulation of Ring Oscillators With a Multiple-Probe Method
Publication Year: 2006, Page(s):2833 - 2842
Cited by: Papers (5)A new multiple-probe method is presented for the simulation of highly nonlinear ring oscillators using the harmonic-balance method. This method is robust compared to the conventional single-probe method and readily converges for a wide range of single-ended and differential ring oscillators. Furthermore, it is computationally more efficient for ring oscillators in which the conventional single-pro... View full abstract»
-
Robust Simulation of High-Q Oscillators Using a Homotopy-Based Harmonic Balance Method
Publication Year: 2006, Page(s):2843 - 2851
Cited by: Papers (4)The simulation of high-Q oscillators in the frequency domain is difficult due to a very small region of convergence. In this paper, globally convergent homotopy methods are combined with the harmonic balance method for simulation of high-Q oscillators. Various homotopy options have been evaluated, and an algorithm has been developed that is robust in simulating a wide range of oscillator circuits View full abstract»
-
Statistical Sampling-Based Parametric Analysis of Power Grids
Publication Year: 2006, Page(s):2852 - 2867
Cited by: Papers (2)A statistical sampling-based parametric analysis is presented for analyzing large power grids in a "localized" fashion. By combining random walks with the notion of "importance sampling," the proposed technique is capable of efficiently computing the impacts of multiple circuit parameters on selected network nodes. A "new localized" sensitivity analysis is first proposed to solve not only the nomi... View full abstract»
-
A Quasi-Newton Preconditioned Newton–Krylov Method for Robust and Efficient Time-Domain Simulation of Integrated Circuits With Strong Parasitic Couplings
Publication Year: 2006, Page(s):2868 - 2881
Cited by: Papers (6)In this paper, the Newton-Krylov method is explored for robust and efficient time-domain simulation of integrated circuits with large amount of parasitic elements. Different from LU-factorization-based direct methods used in SPICE-like circuit simulators, the Newton-Krylov method uses a preconditioned Krylov-subspace iterative method for solving linearized-circuit equations. A key contribution of ... View full abstract»
Aims & Scope
The purpose of this Transactions is to publish papers of interest to individuals in the area of computer-aided design of integrated circuits and systems composed of analog, digital, mixed-signal, optical, or microwave components.
Meet Our Editors
Editor-in-Chief