High-quality sub-function construction in functional decomposition based on information relationship measures

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2001, Pages 383-390

  Jozwiak, Lech ^a   Chojnacki, Artur ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT SYNTHESIS; COMPLEX GATES; FUNCTIONAL DECOMPOSITION; HIGH QUALITY; ITS APPLICATIONS; LOGIC BLOCKS; LOOK UP TABLE;

EXHIBITIONS; INTELLIGENT NETWORKS; TABLE LOOKUP;

DECOMPOSITION;

EID: 0141873662     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2001.915053     Document Type: Conference Paper

References (18)

1. Ashenhurst, R. L.: The decomposition of switching functions, Proceedings of International Symposium on the Theory of Switching Functions, p. 74-116, April 1959.
2. Chang S.-C. and Marek-Sadowska M.: Technology Mapping via Transformations of Function Graphs, IEEE ICCD'92, Cambridge, MA, October 92.
3. Chojnacki, A., Jóźwiak, L.: High-quality FPGA Designs through Functional Decomposition with Sub-function Input Support Selection Based on Information Relationship Measures, IEEE International Symposium on Quality Electronic Design, ISQED'2001, San Jose, California, USA, March 26-28, 2001.
4. Curtis, H. A.: A Generalized Tree Circuits, Journal of the Association for Computing Machinery, 8:484-496, 1961.
5. Hartmanis, J., Stearns, R. E.: Algebraic Structure Theory of Sequential Machines, Englewood Cliffs, N. J.: Prentice-Hall, 1966.
6. Jóźwiak, L.: General Decomposition and Its Use in Digital Circuit Synthesis, VLSI Design, vol. 3, No 3, pp. 225-248, 1995.
7. Jóźwiak, L.: Information Relationships and Measures - An Analysis Apparatus for Efficient Information System Synthesis, Proceedings of the 23rd EUROMICRO Conference, Budapest, Hungary, September 1-4, 1997, pp. 13-23, IEEE Computer Society Press.
8. Jóźwiak, L.: Information Relationship Measures in Application to Logic Design, IEEE International Symposium on Multiple-Valued Logic, Freiburg Im Breisgan, Germany, May 20-22, 1998.
9. Povarov G. N.: On Functional Separability of Boolean Functions, Lectures of the USSR Academy of Sciencies, Vol. 44, No 5, 1954.
10. th EUROMICRO Conference, Milan, Italy, September 8-10, 1999.
11. Roth, J. P. - Karp, R. M.: Minimization over Boolean Graphs, IBM Journal of Research and Development, April 1962.
12. Sawada, H., Suyama, T., Nagoya A.: Logic Synthesis for Look-Up Table Based FPGAs using Functional Decomposition and Support Minimization, ICCAD'95.
13. Sentovich, E. M., Singth, K., J., Lavagno, L., Moon, C, Murgai, R., Saldanha, A., Savoj, H., Stephan, P. R., Brayton, R. K., Sangiovanni- Vincentelli, A.: SIS: A System for Sequential Circuit Synthesis, Electronic Research Laboratory, University of California, Berkeley, Memorandum No. UCB/ERL M92/41, May 1992.
14. Shannon, C. E.: The Synthesis of Two-Terminal Switching Circuits, The Bell Syst. Techn. Journal, Vol. 28, No 1, p. 59, 1949.
15. nd ACM/IEEE Design Automation Conference, 1995.
16. Wan, W., Perkowski, M.: A New Approach to the Decomposition of Incompletely Specified Multi-Output Functions Based on Graph Coloring and Local Transformations and Its Application to FPGA Mapping, European Design Automation Conference, EURO-DAC'92. pp. 2305.
17. Wurth, B., Schlichtmann, U., Eckl, K., Antreich, K. J.: Functional Multiple-Output Decomposition with Application to Technology Mapping for Look-up Table Based, FPGAs, ACM Transactions on Design Automation of Electronic Systems, Vol. 4, No. 3, July, 1999.
18. Collaborative Benchmarking Laboratory, Department of Computer Science at North Carolina State University, http://www.cbl.ncsu.edu