Implementasi Reduksi Keadaan Rangkaian Digital Sekuensial Metode Bagan Implikasi
The implementation of state reduction in sequential digital circuits is made for learning the topic of state reduction. The method used for state reduction is an implication chart. This method starts with reading the transition table state and transfered into the array structure. Based on this array structure a table or chart of initial implications is arranged. The next process is to change the contents of the table if there are cells that meet the requirements to be declared as identical or not identical. This process is repeated continuously until there is no change in cell contents. The state of reduction implementation is made using the Python programming language and PHP. The results of the implementation are successful for the state transition table with 1 input and 1 output.
 M. Murdoca, dan V. Heuring, 2002, Principles of Computer Architecture, Prentice Hall.
 Huffman, D. A., 1954, The synthesis of sequential switching circuits, Journal of Franklin Inst., part I, vol. 257, no. 3, pp. 161–190.
 E. F. Moore, 1956, Gedanken experiments on sequential machines, in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton, NJ: Princeton Univ. Press.
 J.E. Hopcroft, 1971, n log n algorithm for minimizing states in finite automata, Stanford Univ., Satnford, CA, Tech. Rep. CS 71/190.
 J.K. Rho, G. Hachtel, F. Somenzi, and R. Jacoby, 1994, Exact and heuristic algorithms for the minimization of incom pletely specified state machines, IEEE Trans. Computer-Aided Design, vol. 13, pp. 167–177.
 T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli, , A fully implicit algorithm for exact state minimization, in Proc. ACM/IEEE Design Automation Conf., 1994, pp. 684–690.
 S.G. Shiva, 1998, Introduction to Logic Design, CRC Press
 A. B. Marcovitz, 2010, Introduction to logic design 3rd ed., McGraw-Hill Higher Education, Boston, USA.
Download PDF : 88 times
Jurnal Tekno by journal.binadarma.ac.id/index.php/jurnaltekno is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.