Advertisement

Formal Methods in System Design

, Volume 10, Issue 2–3, pp 149–169 | Cite as

Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation

  • M. Fujita
  • P.C. McGeer
  • J.C.-Y. Yang
Article

Abstract

In this paper, we discuss the use of binary decision diagrams to represent general matrices. We demonstrate that binary decision diagrams are an efficient representation for every special-case matrix in common use, notably sparse matrices. In particular, we demonstrate that for any matrix, the BDD representation can be no larger than the corresponding sparse-matrix representation. Further, the BDD representation is often smaller than any other conventional special-case representation: for the n×n Walsh matrix, for example, the BDD representation is of size O(log n). No other special-case representation in common use represents this matrix in space less than O(n2). We describe termwise, row, column, block, and diagonal selection over these matrices, standard an Strassen matrix multiplication, and LU factorization. We demonstrate that the complexity of each of these operations over the BDD representation is no greater than that over any standard representation. Further, we demonstrate that complete pivoting is no more difficult over these matrices than partial pivoting. Finally, we consider an example, the Walsh Spectrum of a Boolean function.

Binary Decision Diagrams Matrix Algorithms Multi-Terminal BDD's Walsh Transform Spectral 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addision-Wesley, 1974.Google Scholar
  2. 2.
    S.B. Akers, "On a theory of boolean functions," J. SIAM, 1959.Google Scholar
  3. 3.
    R.E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, 1986.Google Scholar
  4. 4.
    E.M. Clarke, M. Fujita, K. McMillan, J. Yang, and X. Zhao, "Spectral transforms for large boolean functions with applications to technology mapping," in Design Automation Conference, 1993.Google Scholar
  5. 5.
    E.M. Clarke, M. Fujita, K. McMillan, J. Yang, and X. Zhao, "Spectral transforms for large boolean functions with applications to technology mapping," This Issue, 1996.Google Scholar
  6. 6.
    O. Coudert and J.C. Madre, "A unified framework for the formal verification of sequential circuits," in IEEE International Conference on Computer-Aided Design, 1990.Google Scholar
  7. 7.
    O. Coudert and J.-C. Madre, "A new implicit graph-based prime and essential prime computation technique," in New Trends in Logic Synthesis and Optimization, T. Sasao (Ed.), Kluwer Academic Publishers, 1992.Google Scholar
  8. 8.
    O. Coudert, J.C. Madre, and H. Fraisse, "A new viewpoint on two-level minimization," in Design Automation Conference, 1993.Google Scholar
  9. 9.
    S. Malik, A. Wang, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, "Logic verification using binary decision diagrams in a logic synthesis environment," in IEEE International Conference on Computer-Aided Design, 1988.Google Scholar
  10. 10.
    Y. Matsunaga, P.C. McGeer, and R.K. Brayton, "On computing the transitive closure of a state transition relation," in Design Automation Conference, 1993.Google Scholar
  11. 11.
    Tsutomu Sasao, "Ternary decision diagrams and their applications," in International Workshop on Logic Synthesis, 1993.Google Scholar
  12. 12.
    V. Strassen, "Gaussian elimination is not optimal," Numer. Math, 13, 1969.Google Scholar
  13. 13.
    G.M. Swamy, R.K. Brayton, and P.C. McGeer, "A fully implicit quine-mccluskey procedure using bdds," Technical Report UCB/ERL M92/127, Electronics Research Lab, University of California at Berkeley, 1992.Google Scholar
  14. 14.
    H. Touati, H. Savoj, B. Lin, R.K. Brayton, and A. Sangiovanni-Vincentelli, "Implicit state enumeration of finite state machines using bdd's," in IEEE International Conference on Computer-Aided Design, 1990.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • M. Fujita
    • 1
  • P.C. McGeer
    • 2
  • J.C.-Y. Yang
    • 3
    • 4
  1. 1.Fujitsu Laboratories of AmericaSanta Clara
  2. 2.Cadence Berkeley LaboratoriesBerkeley
  3. 3.Center for Integrated SystemsStanford UniversityUSA
  4. 4.YAHOO! IncUSA

Personalised recommendations