• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

b): State encodings and OBDD-sizes (1996)

by T Theobald
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Reduced Ordered Binary Decision Diagrams (ROBDDs

by Wilsin Gosti, Tiziano Villa, Alex Saldanha, Alberto L. Sangiovanni-vincentelli
"... We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We p ..."
Abstract - Add to MetaCart
We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
(Show Context)

Citation Context

...hat is related to this paper is from Meinel and Theobald. In the effort to find a good reencoding of the state variables to reduce the number of BDD nodes, Meinel and Theobald proposed in (Meinel and =-=Theobald, 1996-=-a) a dynamic re-encoding algorithm based on XOR-transformations. Although a little slower than the sifting algorithm, their technique was able to reduce the number of nodes in BDDs even in cases when ...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University