Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ivan Nausieda

dblp:66/1230 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 67% Hardware reliability and fault tolerance · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design
analog and mixed-signal circuits
0.112005
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design · DAC 2005
Integrated circuit design › analog and mixed-signal circuits
analog circuit design
0.112005
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design · DAC 2005
Hardware reliability and fault tolerance
process variation
0.112005
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design · DAC 2005
Mathematical optimization › continuous optimization › convex optimization
geometric programming
0.012005
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design · DAC 2005
Mathematical optimization › optimization under uncertainty
robust optimization
0.012005
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design · DAC 2005

Methods — techniques the papers use, named apart from their topics

robust geometric programming · 0.1ellipsoidal uncertainty · 0.1
YearPublicationVenuePosition
2006 Molecular organic electronic circuits
abstract
Electronic energy disorder associated within amorphous and polycrystaline molecular organic thin film structures strongly affects the macroscopic observable behavior of organic field effect transistors (OFET) and poses practical challenges to implementing OFET circuits. It has been convenient to ignore the detailed physical processes associated with this disorder and model OFET behavior as equivalent to silicon FETs, but such simplifications limit our ability to develop integrated circuit technology as they fail to predict the true integrated OFET behavior. This talk will highlight the evolution of the organic electronic circuit technology and the challenges that lay ahead, emphasizing the need for physically accurate models of device behavior as the cornerstone of any future circuit advancements.
Vladimir Bulovic, Kyungbum Kevin Ryu, Charles G. Sodini, Ioannis Kymissis, Annie Wang, Ivan Nausieda, Akintunde Ibitayo Akinwande
ICCAD6
2005 OPERA: optimization with ellipsoidal uncertainty for robust analog IC design
abstract
As the design-manufacturing interface becomes increasingly complicated with IC technology scaling, the corresponding process variability poses great challenges for nanoscale analog/RF design. Design optimization based on the enumeration of process corners has been widely used , but can suffer from inefficiency and overdesign. In this paper we propose to formulate the analog and RF design with variability problem as a special type of robust optimization problem, namely robust geometric programming. The statistical variations in both the process parameters and design variables are captured by a pre-specified confidence ellipsoid. Using such optimization with ellipsoidal uncertainy approach, robust design can be obtained with guaranteed yield bound and lower design cost, and most importantly, the problem size grows linearly with number of uncertain parameters. Numerical examples demonstrate the efficiency and reveal the trade-off between the design cost versus the yield requirement. We will also demonstrate significant improvement in the design cost using this approach compared with corner-enumeration optimization.
Yang Xu 0017, Kan-Lin Hsiung, Xin Li 0001, Ivan Nausieda, Stephen P. Boyd, Lawrence T. Pileggi
DAC4