IEEE Transactions on Computers
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Graph algorithms for clock schedule optimization
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Computing optimal clock schedules
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A buffer distribution algorithm for high-performance clock net optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On general zero-skew clock net construction
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Power-profiler: optimizing ASICs power consumption at the behavioral level
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Buffer insertion and sizing under process variations for low power clock distribution
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Useful-skew clock routing with gate sizing for low power design
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Power estimation of cell-based CMOS circuits
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Gate-level current waveform simulation of CMOS integrated circuits
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
Min-max linear programming and the timing analysis of digital circuits
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Anatomy of a Silicon Compiler
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
Glitch power minimization by gate freezing
DATE '99 Proceedings of the conference on Design, automation and test in Europe
A practical CAD technique for reducing power/ground noise in DSM circuits
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Minimizing peak current via opposite-phase clock tree
Proceedings of the 42nd annual Design Automation Conference
Fast multi-domain clock skew scheduling for peak current reduction
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Opposite-Phase Clock Tree for Peak Current Reduction
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Simultaneous clock buffer sizing and polarity assignment for power/ground noise minimization
Proceedings of the 46th Annual Design Automation Conference
Clock-tree synthesis for low-EMI design
Journal of Embedded Computing - PATMOS 2007 selected papers on low power electronics
Clock buffer polarity assignment for power noise reduction
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Clock distribution techniques for Low-EMI design
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
A reconfigurable clock polarity assignment flow for clock gated designs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.00 |
The presence of large current peaks on the power and ground lines isa serious concern for designers of synchronous digitalcircuits. Current peaks are caused by the simultaneous switching ofhighly loaded clock lines and by the signal propagation through thesequential logic elements. In this work we propose a methodology forreducing the amplitude of the current peaks. This result is obtainedby clock skew optimization. We propose an algorithm that, for a givenclock cycle time, determines the clock arrival time at each flip-flopin order to minimize the current peaks while respecting timingconstraint. Our results on benchmark circuits show that currentpeaks can be reduced without penalty on cycle time and average powerdissipation. Our methodology is therefore well-suited for low-powersystems with reduced supply voltage, where low noise margins are aprimary concern.