2007 |
12 | EE | Saif Ali Butt,
Stefan Schmermbeck,
Jurij Rosenthal,
Alexander Pratsch,
Eike Schmidt:
System level clock tree synthesis for power optimization.
DATE 2007: 1677-1682 |
2004 |
11 | EE | Domenik Helms,
Eike Schmidt,
Wolfgang Nebel:
Leakage in CMOS Circuits - An Introduction.
PATMOS 2004: 17-35 |
2002 |
10 | EE | Domenik Helms,
Eike Schmidt,
Arne Schulz,
Ansgar Stammermann,
Wolfgang Nebel:
An Improved Power Macro-Model for Arithmetic Datapath Components.
PATMOS 2002: 16-24 |
9 | EE | Eike Schmidt,
Gerd von Cölln,
Lars Kruse,
Frans Theeuwen,
Wolfgang Nebel:
Memory power models for multilevel power estimation and optimization.
IEEE Trans. VLSI Syst. 10(2): 106-109 (2002) |
2001 |
8 | EE | Eike Schmidt,
Gerd Jochens,
Lars Kruse,
Frans Theeuwen,
Wolfgang Nebel:
Automatic nonlinear memory power modelling.
DATE 2001: 808 |
7 | | Ansgar Stammermann,
Lars Kruse,
Wolfgang Nebel,
Alexander Pratsch,
Eike Schmidt,
Milan Schulte,
Arne Schulz:
System level optimization and design space exploration for low power.
ISSS 2001: 142-146 |
6 | EE | Lars Kruse,
Eike Schmidt,
Gerd Jochens,
Ansgar Stammermann,
Arne Schulz,
Enrico Macii,
Wolfgang Nebel:
Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs.
IEEE Trans. VLSI Syst. 9(1): 3-14 (2001) |
2000 |
5 | EE | Lars Kruse,
Eike Schmidt,
Gerd Jochens,
Ansgar Stammermann,
Wolfgang Nebel:
Lower Bounds on the Power Consumption in Scheduled Data Flow Graphs with Resource Constraints.
DATE 2000: 737 |
4 | EE | Lars Kruse,
Eike Schmidt,
Gerd Jochens,
Ansgar Stammermann,
Wolfgang Nebel:
Lower Bound Estimation for Low Power High-Level Synthesis.
ISSS 2000: 180-186 |
3 | EE | Gerd Jochens,
Lars Kruse,
Eike Schmidt,
Ansgar Stammermann,
Wolfgang Nebel:
Power Macro-Modelling for Firm-Macro.
PATMOS 2000: 24-35 |
1999 |
2 | EE | Gerd Jochens,
Lars Kruse,
Eike Schmidt,
Wolfgang Nebel:
A New Parameterizable Power Macro-Model for Datapath Components.
DATE 1999: 29- |
1 | EE | Lars Kruse,
Eike Schmidt,
Gerd Jochens,
Wolfgang Nebel:
Lower and upper bounds on the switching activity in scheduled data flow graphs.
ISLPED 1999: 115-120 |