Graph matching-based algorithms for FPGA segmentation design
暂无分享,去创建一个
[1] Zvonko G. Vranesic,et al. Minimizing interconnection delays in array-based FPGAs , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.
[2] A. El Gamal,et al. An architecture for electrically configurable gate arrays , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.
[3] D. F. Wong,et al. On channel segmentation design for row-based FPGAs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.
[4] Martin D. F. Wong,et al. Channel segmentation design for symmetrical FPGAs , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.
[5] Abbas El Gamal,et al. Segmented channel routing in nearly as efficient as channel routing (and just as hard) , 1991 .
[6] Massoud Pedram,et al. Design and analysis of segmented routing channels for row-based FPGA's , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] A. El Gamal,et al. An architecture for electrically configurable gate arrays , 1989 .
[8] M. Mehendale,et al. Optimization Of Channel Segmentation For Channelled Architecture FPGAs , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.
[9] Yao-Wen Chang,et al. Switch module design with application to two-dimensional segmentation design , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[10] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[11] Dwight D. Hill,et al. Architectural and physical design challenges for one-million gate FPGAs and beyond , 1997, FPGA '97.