No Detail Found!

Finite state machines: Techniques to obtain minimal equations for combinational part.

Author(s)
Altaf Mukati Faculty of Engineering, Science and Technology, Hamdard Institute of Information Technology, Hamdard University, Karachi, Pakistan
Abdul Rehman Memon Faculty of Engineering, Science and Technology, Hamdard Institute of Information Technology, Hamdard University, Karachi, Pakistan
Jameel Ahmed Faculty of Engineering, Science and Technology, Hamdard Institute of Information Technology, Hamdard University, Karachi, Pakistan
Abstract
While designing any Hardwired Logic Circuit, whether a simple combinational one or a complete FSM (Finite State Machines), we apply various methods of circuit minimization. This is necessary to obtain an efficient, low-cost compact circuit. Designing a finite state machine through Classical Method, involves a two step process of minimizations :(1) To minimize the number of flip flops used in the feed-back loop and (2) To minimize the combinational part of the whole circuit. The first step is carried out through a generally known ‘Implication Matrix’ to get the reduced-state table, hence minimizing the number of flip-flops used. This is also known as State Reduction. For the second step, no proper or definite method exists to guarantee the minimum circuit. This paper presents some useful techniques to obtain the possible minimum circuit. The technique primarily focus on the proper allocation/assignment of codes to the states in the reduced state table. An improper assignment of codes can considerably increase the size of the circuit. This is explained through examples.
Publication Details
Page(s) 79-86
DOI DOI not available
Published Journal: Mehran University Research Journal of Engineering and Technology, Volume: 23, Issue: 2, Year: 2004

Request the full text from PASTIC

0

Citations

0

Downloads

71

Views