On optimum switch box designs for 2-D FPGAs

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 203-208

  Fan, Hongbing ^a   Liu, Jiping ^b   Wu, Yu Liang ^c   Cheung, Chak Chung ^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

BOOLEAN FUNCTIONS; MATHEMATICAL MODELS; ROUTERS; SWITCHING SYSTEMS;

SWITCH BOX DESIGN;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 0034841555     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2001.156136     Document Type: Article

References (16)

1. New performance FPGA routing algorithms
2. A detailed router for field-programmable gate arrays
3. Universal switch modules for FPGA design
4. General models for optimum arbitrary-dimension FPGA switch box designs
5. A performance and routability driven router for FPGAs considering path delays
6. On the optimal four-way switch box routing structures of FPGA greedy routing architectures
7. On NP-completeness of 2-D FPGA routing architectures and a novel solution
8. Routing for array type FPGAs
9. On computational complexity of a detailed routing problem in two-dimensional FPGA's
10. Graph based analysis of 2-D FPGA routing
11. A new packing, placement and routing tool for FPGA research