SYMBOLIC COVER MINIMIZATION OF FULLY I/O SPECIFIED FINITE STATE MACHINES

被引：1
|
作者：
DRUSINSKYYORESH, D
机构：
[1] CAD Department, Sony Corporation, Atsugi-shi, Kanagawa-ken
来源：
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1990年 / 9卷 / 07期
关键词：
D O I：
10.1109/43.55214
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Symbolic cover minimization is an important step within a well-known state-assignment technique for finite state machines (FSM's) [2]. Currently, multiple-valued-input logic minimization techniques are used to find a minimum symbolic cover. The former problem, however, is computationally intractable, so heuristics are used. We show a simplified technique, based on an extension of the FSM minimization technique, which enables an efficient deterministic solution for fully I/O specified FSM's. © 1990 IEEE
引用
收藏
页码：779 / 781
页数：3
相关论文
共 50 条
12345