Reduction in the number of PAL macrocells in the ciruit of a Moore FSM

Barkalov, A. A. ; Titarenko, L. ; Chmielewski, S.

International Journal of Applied Mathematics and Computer Science, Tome 17 (2007) no. 4, pp. 565-575.

Résumé

Optimization methods of logic circuits for Moore finite-state machines are proposed. These methods are based on the existence of pseudoequivalent states of a Moore finite-state machine, a wide fan-in of PAL macrocells and free resources of embedded memory blocks. The methods are oriented to hypothetical VLSI microcircuits based on the CPLD technology and containing PAL macrocells and embedded memory blocks. The conditions of effective application of each proposed method are shown. An algorithm to choose the best model of a finite-state machine for given conditions is proposed. Examples of proposed methods application are given. The effectiveness of the proposed methods is also investigated.

Détail

Keywords: Moore finite-state machine, complex programmable logic devices, design, logic circuit, pseudoequivalent states
Mots-clés : automat Moore'a, złożone programowalne układy logiczne, układ logiczny, stan pseudorównoważny

Bibliographie

[1] Adamski M. and Barkalov A. (2006): Architectural and Sequential Synthesis of Digital Devices. Zielona Góra: University of Zielona Góra Press.

[2] www.altera.com

[3] Baranov S. (1994): Logic Synthesis for Control Automata. Boston: Kluwer.

[4] Barkalov A. (1998): Principles of Optimization of Logical Circuit of Moore FSM. Cybernetics and system analysis, No. 1, pp. 65-72 (in Russian).

[5] Barkalov A. and Barkalov A. (2005): Design of Mealy Finite-State-Machines with Transformation of Object Codes. International Journal of Applied Mathematics and Computer Science, Vol. 15, No. 1, pp. 151-158.

[6] Barkalov A. and Węgrzyn M. (2006): Design of Control Units with Programmable Logic. Zielona Góra: University of Zielona Góra Press.

[7] Chattopadhyay S. (2005): Area Conscious State Assignment with Flip-Flop and Output Polarity Selection for Finite State Machine Synthesis - A Genetic Algorithm Approach, The Computer Journal, Vol. 48, No. 4, pp. 443-450.

[8] De Micheli G. (1994): Synthesis and Optimization of Digital Circuits. New York: McGraw Hill.

[9] Devadas S., Ma H.-K., Newton R., Sangiovanni-Vincentelli A. (1988): State Assignment of Finite State Machines Targeting Multilevel Logic Implementations, IEEE Transactions on Computer-Aided Design, pp. 1290-1300.

[10] Kam T., Villa T., Brayton R., Sangiovanni-Vincentelli A. (1998): Synthesis of Finite State Machines: Functional Optimization, Boston/London/Dordrecht: Kluwer Academic Publishers.

[11] Kania D. (2004): Logic Synthesis Oriented on Programmable Logic Devices of the PAL type. Gliwice: Silesian University of Technology (in Polish).

[12] www.latticesemi.com

[13] Maxfield C. (2004): The Design Warrior's Guide to FPGA. NJ: Elsevier.

[14] Mc Cluskey E. (1986): Logic Design Principles. Englewood Cliffs: Prentice Hall.

[15] Micheli, G. D., Brayton, R. K. and Vincentelli, A. S. (1985): Optimal state assignment for finite state machines. IEEE Transactions on Computer-Aided Design, pp. 269-284.

[16] Villa T., Kam T., Brayton R., Sangiovanni-Vincentelli A. (1998): Synthesis of Finite State Machines: Logic Optimization, Kluwer Academic Publishers, Boston/London/Dordrecht.

[17] Villa T., Sangiovanni-Vincentelli A. (1998): State Assignment of Finite State Machines for Optimal Two-Level Logic Implementation, IEEE Transactions on Computer-Aided Design, pp. 905-924.

[18] Xia, Y. and Almaini, A. (2002): Genetic algorithm based state assignment for power and area optimization, IEEP Comput. Dig. T., Vol. 149, No. 4, pp. 128-133.

[19] www.xilinx.com

[20] Yang S. (1991): Logic Synthesis and Optimization Benchmarks User Guide, Microelectronics Center of North Carolina, Research Triangle Park, North Carolina.