General models for optimum arbitrary-dimension FPGA switch box designs

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn 2000-January, Issue , 2000, Pages 93-98

  Fan, Hongbing ^a   Liu, Jiping ^b   Wu, Yu Liang ^c  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; DOMAIN DECOMPOSITION METHODS; INTEGRATED CIRCUIT DESIGN; BOOLEAN FUNCTIONS; ELECTRIC NETWORK TOPOLOGY; FIELD PROGRAMMABLE GATE ARRAYS; GRAPHIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; STATIC RANDOM ACCESS STORAGE; SWITCHING CIRCUITS; THEOREM PROVING; TRANSMISSION LINE THEORY; TWO DIMENSIONAL;

ARBITRARY DIMENSION; DECOMPOSITION THEOREMS; DESIGN PROBLEMS; GENERAL MODEL; K-PARTITE GRAPH; NET TOPOLOGY; NUMBER OF SWITCHES; SWITCH MODULES;

COMPUTER AIDED DESIGN; COMPUTER AIDED LOGIC DESIGN;

GLOBAL ROUTINGS; MULTIPIN NET TOPOLOGIES; ROUTING RESOURCE CONSTRAINTS; SWITCH BOX; TWO DIMENSIONAL LOGICAL BLOCKS; UNIVERSAL SWITCH MODULE;

EID: 0034480902     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2000.896456     Document Type: Conference Paper

References (14)

1. M. J. Alexander and G. Robins. "New performance FPGA routing algorithms". Proceedings DAC, pages 562-567, 1995.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Macmillan Press, London, 1976.
3. S. Brown, R. J. Francise, J. Rose, and Z. G. Vranesic. Field- Programmable Gate Arrays. Kluwer-Academic Publisher, Boston MA, 1992.
4. S . Brown, J. Rose, and Z. G. Vranesic. "A detailed router for fieldprogrammable gate arrays". IEEE Trans. on Computer-Aided Design, 11:620-628, May 1992.
5. Y. W. Chang, D. F. Wong, and C. K. Wong. "Universal switch models for FPGA". ACM Trans. on Design Automation of Electronic Systems, 1(1):8O-101, January 1996.
6. A. Corp. The Maximalist Handbook. 1990.
7. H. Fan, P. Haxell, and J. Liu. "The global routing-a combinatorial design problem". (submitted).
8. Y. S . Lee and C. H. Wu. "A performance and routability driven router for FPGAs considering path delays". Proceedings DAC, pages 557-561, 1995.
9. J.E. Pan, Y. L. Wu, G. Yan, and C. K. Wong. "On the optimal four-way switch box routing structures of FPGA greedy routing architectures". Integration, the VUZ Journal, 25:137-159, 1998.
10. J. Rose and S. Brown. 'Flexibility of interconnection structures for field-programmable gate arrays". IEEE J. Solid-Szaze Circuits, 26(3):277-282, 1991.
11. Y. L. Wu and D. Chang. "On NP-completeness of 2-D PGA routing architectures and a novel solution". Proceedings of International Conference on Computer-Aided-Designp, pages 362-366, 1994.
12. Y. L. Wu and M. Marek-Sadowska. "Routing for array type FPGAS". IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 16(5):506-518, May 1997.
13. Y. L. Wu, S. Tsukiyama, and M. Marek-Sadowska. "On computational complexity of a detailed routing problem in two-dimensional FPGAs". Proc. 4th Great Lakes Symp. VLSI, March 1994.
14. Y. L. Wu, S. Tsukiyama, and M. Marek-Sadowska. "Graph based analysis of 2-D FPGA routing". IEEE Trans. on Computer-Aided Design, 15(1):33-44, 1996.