This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1977 (vol. 26 no. 8)
pp. 811-818
E.W. Page, Department of Electrical and Computer Engineering, Clemson University
Cellular-array realizations of switching functions have been studied in order to take advantage of the many design possibilities offered by large-scale integration technology. This paper introduces a class of programmable cellular arrays that can be employed to realize arbitrary synchronous sequential machines. State assignments based upon k-out-of-m codes are employed to give rise to machine excitation and output equations in a consistent functional form suitable for implementation via a cellular structure. The proposed arrays are programmable, which makes possible the capability of re-configuring an array to realize different machines by electronically altering the function implemented by each cell of the array. A synthesis algorithm is presented that will allow the designer to program the array without explicitly deriving excitation and output functions. The synthesis technique is applicable to both Mealy and Moore machines with any number of inputs, outputs, and internal states, and utilizing either delay or trigger flip-flops.
Index Terms:
Index Terms-Programmable cellular array, secondary-state assignment, sequential machine structure, sequential machine synthesis.
Citation:
E.W. Page, P.N. Marinos, "Programmable Array Realizations of Synchronous Sequential Machines," IEEE Transactions on Computers, vol. 26, no. 8, pp. 811-818, Aug. 1977, doi:10.1109/TC.1977.1674920
Usage of this product signifies your acceptance of the Terms of Use.