7.7.1 Meal ® of e-4 7/OIGITAL CIRCUIT DESIGN 1. For the designer to effectively use it, the notation must provide a clear descrip- tion of the algorithm, and in terms to which the designer can relate. 2. ‘The notation must support a direct translation into a hardware realization of the control algorithm, ‘Traditional state-diggram methods, such as the Mealy and Moore state machines, satisfy the second condition. In fact, translation from a traditional state diagram to a hhardware realization is practically identical to that for the ASM chart presented in the preceding section, With traditional state diagrams, however, it is difficult to cleariy represent complex control algorithms, especially if there are more than a limited number ‘of input and output signals. Furthermore. traditional state diagrams are often not as flexible as the ASM chars, as we will soon see. Even so, traditional state diagrams are still in common use. Therefore, itis beneficial forthe reader to gain some exposure to them, ly State Machine ‘The Mealy state machine is essentially an Algorithmic State Machine (ASM) in which all outputs are represented as conditional outputs. Shown in Fig. 7.12(b) is a Mealy state diagram (or graph that is equivalent tothe ASM char of Fig. 7.12(a), which is copied from Fig. 7.2). A state is represented ina Mealy state graph by a circle. Therefore the four circles in Fig. 7.12(b) represent the four states: A, B, C. and D. As in the ASM fapute: INIT. BUF.FULL ‘outputs: COUNTEN, REG.LD, OUT-FLAG COUNTER REGLD t Ofrecio]— Figure 7.12 foro (a) ASM tart (©) Coresponding Mealy state gph Mealy state graph illustration. @‘TIITRADITIONAL STATE MACHINES oa ‘chart, a state transition is represented by an arrow from one state to next state. Further, specified for each transition arrow are the present values of every input signal and every ‘conditional output signal, with the input values specified on the top and the output values ‘on the tottom. The correspondences of these values to the actual signals are implicit ‘through the ordering. Here, the ordering is IN.BIT, BUF.FULL on each top, and COUNT.EN, REG.LD, OUT-FLAG on each bottom. Again, note that all outputs for the Mealy state diagram are represented as conditional outputs. Tkerefore, to represent ‘unconditional outputs such as COUNT.EN and REG.LD for state A, we have to specify ‘those ourput values at both transition arrows from stale A, as shown, 7.7.2 Moore State Machine ‘The Moore state machine is essentially an ASM in which all outputs are represented as unconditional outputs. Shown in Fig. 7.13(b) is a Moore state diagram that is equivalent to the ASM chart of Fig. 7.13(a). Just as for a Mealy state diagram, a state in a Moore state diagram is represented by a circle, and a state transition is represented by an arrow. However, the specification for each transition arrow has only the present values of the input signals used to determine the next state; there are no output signal values. Instead, the outputs are associated unconditionally with states, being specified inside each state circle under the state name. Asa result, a Moore state machine cannot be used 0 represent the ASM chart of Fig. 7.2 or 7.12(a), where conditional and unconditional outputs are present. Input: INIT, BUFFULL ® ‘utpts: COUNT.EN. REG.LD. OUTFLAG REGLD gS ne 5 Ti | GF iS mw 7 w) Gur rue Oforrrine > (ASM char (6) Comeoonine More state ap Figure 7.13 Moore state graph illustration.