An application of functional decomposition in ROM-based FSM implementation in FPGA devices

Modern FPLD devices have very complex structure. They combine PLA like structures as well as FPGA and even memory-based structures. However lack of appropriate synthesis methods do not allow fully exploiting the possibilities the modern FPLDs offer. The paper presents a general method for the synthesis targeted to implementation of sequential circuits using embedded memory blocks. The method is based on the serial decomposition concept and relies on decomposing the memory block into two blocks: a combinational address modifier and a smaller memory block. An appropriately chosen decomposition strategy may allow reducing the required memory size at the cost of additional logic cells for address modifier implementation. This makes possible implementation of FSMs that exceed available memory by using embedded memory blocks and additional programmable logic.

[1]  Дяньмо Ши,et al.  Численные методы в задачах теплообмена , 1988 .

[2]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[3]  Tokyo,et al.  Proceedings. Euromicro Symposium on Digital System Design , 2003, Euromicro Symposium on Digital System Design, 2003. Proceedings..

[4]  Makoto Ikeda,et al.  Optimum Functional Decomposition for LUT-Based FPGA Synthesis , 2000, FPL.

[5]  Tadeusz Luba,et al.  ROM-based finite state machines with PLA address modifiers , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[6]  Blaz Zupan,et al.  Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition , 1998, Informatica.

[7]  Lech Józwiak,et al.  An efficient approach to decomposition of multi-output Boolean functions with large sets of bound variables , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[8]  Tadeusz Luba Multi-level logic synthesis based on decomposition , 1994, Microprocess. Microsystems.

[9]  Vladimir Logvinovich Rvachev,et al.  Алгебра логики и интегральные преобразования в краевых задачах , 1976 .

[10]  Claudio Moraga,et al.  Evolutionary multi-level network synthesis in given design style , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[11]  Mariusz Rawski,et al.  Non-disjoint decomposition of Boolean functions and its application in FPGA-oriented technology mapping , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[12]  Lech Jozwiak,et al.  Functional Decomposition based on Information Relationship Measures Extremely Effective and Efficient for Symmetric Functions. , 1999 .

[13]  Tadeusz Luba,et al.  A General Approach to Boolean Function Decomposition and its Application in FPGABased Synthesis , 1995, VLSI Design.

[14]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[15]  Tadeusz Luba,et al.  Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..

[16]  Shih-Chieh Chang,et al.  Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Karem A. Sakallah,et al.  Constructive library-aware synthesis using symmetries , 2000, DATE '00.

[18]  Tadeusz Łuba,et al.  Multi-level logic synthesis based on decomposition , 1994 .

[19]  Timothy D. Ross,et al.  Pattern Theory: An Engineering Paradigm for Algorithm Design , 1991 .

[20]  Ireneusz Brzozowski,et al.  Minimisation of power consumption in digital integrated circuits by reduction of switching activity , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[21]  П.Н. Вабищевич,et al.  Вычислительные методы в математической физике , 1986 .

[22]  Henry Selvaraj,et al.  Balanced multilevel decomposition and its applications in FPGA-based synthesis , 1995 .