Idioma:

A fully implicit algorithm for exact state minimization

Kam, Timothy ; Villa, Tiziano ; Brayton, Robert ; Sangiovanni-Vincentelli, Alberto

31st Design Automation Conference, 1994, p.684-690

Texto completo disponível

Citações Citado por

Título:
A fully implicit algorithm for exact state minimization
Autor: Kam, Timothy ; Villa, Tiziano ; Brayton, Robert ; Sangiovanni-Vincentelli, Alberto
Assuntos: Binary decision diagrams ; Boolean functions ; Contracts ; Data structures ; Hardware -- Integrated circuits -- Logic circuits ; Hardware -- Integrated circuits -- Logic circuits -- Sequential circuits ; Identity-based encryption ; Logic ; Minimization methods ; Theory of computation -- Formal languages and automata theory
É parte de: 31st Design Automation Conference, 1994, p.684-690
Notas: SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
Descrição: State minimization of incompletely specified machines is an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate covering problem. This paper presents an implicit algorithm for exact state minimization of FSM's. We describe how to do implicit prime computation and implicit binate covering. We show that we can handle sets of compatibles and prime compatibles of cardinality up to 2/sup 1500/. We present the first published algorithm for fully implicit exact binate covering. We show that we can reduce and solve binate tables with up to 10 /sup 6/ rows and columns. The entire branch-and-bound procedure is carried on implicitly. We indicate also where such examples arise in practice.
Editor: New York, NY, USA: ACM
Idioma: Inglês

Voltar para lista de resultados