Stochastic sequential machine synthesis with application to constrained sequence generation

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In power estimation, one is faced with two problems: (1) generating input vector sequences that satisfy a given statistical behavior (in terms of signal probabilities and correlations among bits); (2) making these sequences as short as possible so as to improve the efficiency of power simulators. Stochastic sequential machines (SSMs) can be used to solve both problems. In particular, this paper presents a general procedure for SSM synthesis and describes a new framework for sequence characterization to match designers' needs for sequence generation or compaction. Experimental results demonstrate that compaction ratios of 1-3 orders of magnitude can be obtained without much loss in accuracy of total power estimates. © 2000 ACM.

Author supplied keywords

Cite

CITATION STYLE

APA

Marculescu, D., Marculescu, R., & Pedram, M. (2000). Stochastic sequential machine synthesis with application to constrained sequence generation. ACM Transactions on Design Automation of Electronic Systems, 5(3), 658–681. https://doi.org/10.1145/348019.348566

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free