The Community for Technology Leaders
Green Image
Issue No. 02 - February (1987 vol. 36)
ISSN: 0018-9340
pp: 175-184
L.D. Coraor , Department of Electrical Engineering, Pennsylvania State University
A general model of a memory-based finite-state machine architecture is introduced, the 2<sup>k</sup>- decision machine (2<sup>k</sup>- D). The classical (2<sup>n</sup>- D) and binary decision (2 - D) architectures are shown to be special cases of the 2<sup>k</sup>- D architecture. The equivalence among the 2<sup>k</sup>- D solutions for different values of k follows from the sequentialization prin
sequentialization, Conditional transition, decision diagrams, digital system design, finite-state machines, memory-based implementation, optimization

O. Morean, P. Hulina and L. Coraor, "A General Model for Memory-Based Finite-State Machines," in IEEE Transactions on Computers, vol. 36, no. , pp. 175-184, 1987.
83 ms
(Ver 3.3 (11022016))