DocumentCode
2561176
Title
An automata-theoretic approach to local microcode generation
Author
Langevin, M. ; Cerny, E.
Author_Institution
Dep. d´´IRO, Univ. de Montreal, Que., Canada
fYear
1993
fDate
22-25 Feb 1993
Firstpage
94
Lastpage
98
Abstract
The authors propose a method for minimal length local microcode generation based on the state-space exploration of the underlying generic state machine model of the datapath described using restricted predicate calculus formulae. An efficient inverse image computation of a given state, and a mixed breadth-depth first heuristic strategy for exploring the state space are the determining factors of the method
Keywords
data flow graphs; finite state machines; formal verification; logic design; state-space methods; automata-theoretic approach; datapath; generic state machine model; inverse image computation; local microcode generation; minimal length; mixed breadth-depth first heuristic strategy; restricted predicate calculus formulae; state-space exploration; Application specific processors; Automatic generation control; Calculus; Computer architecture; Data flow computing; Data mining; Registers; Routing; Space exploration; State-space methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on
Conference_Location
Paris
Print_ISBN
0-8186-3410-3
Type
conf
DOI
10.1109/EDAC.1993.386494
Filename
386494
Link To Document