Lower and upper bounds an the switching activity in scheduled data flow graphs
暂无分享,去创建一个
[1] J. Cortadella,et al. Scheduling and resource binding for low power , 1995 .
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] Niraj K. Jha,et al. An ILP formulation for low power based on minimizing switched capacitance during data path allocation , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.
[4] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .
[5] Nikil D. Dutt,et al. A unified lower bound estimation technique for high-level synthesis , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Eike Schmidt,et al. A new parameterizable power macro-model for datapath components , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).
[7] T. Kailath,et al. VLSI and Modern Signal Processing , 1984 .
[8] Massoud Pedram,et al. Register Allocation and Binding for Low Power , 1995, 32nd Design Automation Conference.
[9] Massoud Pedram,et al. Module assignment for low power , 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.
[10] Miodrag Potkonjak,et al. HYPER-LP: a system for power minimization using architectural transformations , 1992, ICCAD.
[11] P. Yip,et al. Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .