Inderkal said:
Does anybody have any ideas about implementing a gate level model of a
finite state machine? Any kind of info will do. I just want to get
started.
While working with one-hot encoded state machines, I realized that the
input function for each state register was a simple two level sum of
products.
Your state diagram will have arrows representing the transitions between
states. A condition is associated with each transition. If you express
each transition as a product (AND) of the state and the condition you
can then sum (OR) the resulting products to form the input function to
the state register.
This can be generalized to different encoding schemes by using a full
decode for the state input. The resulting sum will be used to form the
next state value. All of these values may be further summed (ORed) to
form the complete state=>next-state function for the machine. This
generalize method also works for the one-hot encoding, but since all
state values assert a single bit in the state variable, it can be done
with the simpler method above.
--
Rick "rickman" Collins
(e-mail address removed)
Ignore the reply address. To email me use the above address with the XY
removed.
Arius - A Signal Processing Solutions Company
Specializing in DSP and FPGA design URL
http://www.arius.com
4 King Ave 301-682-7772 Voice
Frederick, MD 21701-3110 301-682-7666 FAX