NOVA - STATE ASSIGNMENT OF FINITE STATE MACHINES FOR OPTIMAL 2-LEVEL LOGIC IMPLEMENTATION

被引：140

作者：

VILLA, T

SANGIOVANNIVINCENTELLI, A

机构：

[1] Department of Electrical Engineering and Computer Science, University of California, Berkeley

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1990年 / 9卷 / 09期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/43.59068

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The problem of encoding the states of a synchronous finite state machine (FSM), so that the area of a two-level implementation of the combinational logic is minimized, is addressed. As in previous approaches, the problem is reduced to the solution of the combinatorial optimization problems defined by the translation of the cover obtained by a multiple-valued logic minimization or by a symbolic minimization into a compatible Boolean representation. In this paper we present algorithms for their solution, based on a new theoretical framework that offers advantages over previous approaches to develop effective heuristics. The algorithms are part of NOVA, a program for optimal encoding of control logic. Final areas averaging 20% less than other state assignment programs and 30% less than the best random solutions have been obtained. Literal counts averaging 30% less than the best random solutions have been obtained. © 1990 IEEE

引用

页码：905 / 924

页数：20

共 50 条

[1] NOVA - STATE ASSIGNMENT OF FINITE STATE MACHINES FOR OPTIMAL 2-LEVEL LOGIC IMPLEMENTATIONS
VILLA, T
SANGIOVANNIVINCENTELLI, A
26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 327 - 332
[2] Optimist: State minimization for optimal 2-level logic implementation
Fuhrer, RM
Nowick, SM
1997 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN - DIGEST OF TECHNICAL PAPERS, 1997, : 308 - 315
[3] OPTIMAL STATE ASSIGNMENT FOR FINITE STATE MACHINES
DEMICHELI, G
BRAYTON, RK
SANGIOVANNIVINCENTELLI, A
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (03) : 269 - 285
[4] State assignment and logic optimization for finite state machines
Czerwinski, Robert
Kania, Dariusz
IFAC WORKSHOP ON PROGRAMMABLE DEVICES AND EMBEDDED SYSTEMS (PDES 2009), PROCEEDINGS, 2009, : 39 - 44
[5] MUSTANG - STATE ASSIGNMENT OF FINITE STATE MACHINES TARGETING MULTILEVEL LOGIC IMPLEMENTATIONS
DEVADAS, S
MA, HK
NEWTON, AR
SANGIOVANNIVINCENTELLI, A
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1988, 7 (12) : 1290 - 1300
[6] STATE ASSIGNMENT SCHEME FOR 2-LEVEL LOGIC IMPLEMENTATION BASED ON A SIMULATED ANNEALING ALGORITHM WITH A FAST COST ESTIMATION METHOD
LEE, SS
HWANG, SH
ELECTRONICS LETTERS, 1993, 29 (18) : 1625 - 1626
[7] State assignment of finite-state machines
Ahmad, I
Dhodhi, MK
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (01): : 15 - 22
[8] A state assignment algorithm for finite state machines
Skias, D
Haniotakis, T
Tsiatouhas, Y
Arapoyanni, A
ICECS 2000: 7TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS & SYSTEMS, VOLS I AND II, 2000, : 823 - 826
[9] ESTIMATORS FOR LOGIC MINIMIZATION AND IMPLEMENTATION SELECTION OF FINITE STATE MACHINES
TENBERG, AJWM
MICROPROCESSING AND MICROPROGRAMMING, 1992, 35 (1-5): : 151 - 158
[10] Twofold State Assignment for the Moore Finite State Machines
Barkalov, A. A.
Titarenko, L. A.
Baev, A. V.
Matviienko, A. V.
CYBERNETICS AND SYSTEMS ANALYSIS, 2023, 59 (01) : 27 - 38

← 1 2 3 4 5 →