Horizontal partitioning of PLA-based finite state machines

  • Authors:
  • P. G. Paulin

  • Affiliations:
  • BNR, P.O. Box 3511, Station "C", Ottawa, Canada, K1Y 4H7 and INPG/CSI, 46, Ave. Félix Viallet, 3803 1 Grenoble Cedex, France

  • Venue:
  • DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new form of partitioning of PLA-based FSMs that combines the advantages of traditional vertical PLA partitioning (i.e. via inputs and/or outputs) and counter embedding which consists of replacing the FSM state memories by a counter. Like the former, horizontal partitioning allows the reduction of the number of input and/or output columns in the PLAs resulting from the partition. Furthermore, the technique also reduces the total number of product terms, as in counter embedding techniques. This reduction is due to a decomposition of state transitions into two classes that are realized by two sets of logic. In this case however, a second PLA-based FSM is used in place of the counter. This results in area reductions of 30% to 60% (with respect to regular two-level logic minimization) for the benchmark examples presented.