| D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery. |
....that can be exponentially large on the dimension of the circuit, thereby making the complexity of these methods effectively exponential on the size of the circuit. To avoid this exponential blowup without incurring in a significant loss of precision, approximate methods like sequence compaction [8] and sequence synthesis [7] have been proposed. The alternative to this approach are probabilistic power estimation methods. They do not explicitly require the existence of a trace and, in principle, can be used to compute the power dissipation of circuits without the need for an exponentially ....
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
....trace is very long. Methods have been proposed to speed up this computation, without incurring in a significant loss of precision. One such possibility is random sampling where only a subset of the transitions present in the trace is used. More sophisticated methods include sequence compaction [1] and sequence synthesis. These approaches aim at reproducing accurately the input correlations with traces that are much smaller than the initial trace. Another possibility is to model the temporal and spatial correlations at the primary inputs by generalizing the concept of a trace and creating ....
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
....phase. Marculescu et al. 5] used a Markov model to # Supported in part by the National Science Foundation (NSF) under grant 1 531333 NSF MIP 96 12184. generate a compact sequence, and subsequently they proposed a hierarchical model with macro and micro states to model the original sequence [6]. This paper proposes a novel method to transform a sequence to a shorter one preserving the transition frequencies. We will call this problem the Sequence Compaction problem. In this paper, we propose a graph model to transform the sequence compaction problem to the problem of finding a heaviest ....
R. Marculescu, D. Marculescu, M. Pedram, Hierarchical sequence compaction for power estimation, Proc. 34th DAC., pp. 570--575, 1997.
No context found.
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
No context found.
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
No context found.
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
No context found.
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
No context found.
D. Marculescu, R. Marculescu, and M. Pedram. Hierarchical sequence compaction for power estimation. In 33rd Design Automation Conference (DAC'97), pages 570--575, New York, June 1997. Association for Computing Machinery.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC