Multi-Context FPGA Using Fine-Grained Interconnection Blocks and Its CAD Environment
暂无分享,去创建一个
[1] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.
[2] Frank Vahid,et al. Dynamic FPGA routing for just-in-time FPGA compilation , 2004, Proceedings. 41st Design Automation Conference, 2004..
[3] Steven Trimberger,et al. A time-multiplexed FPGA , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).
[4] RoseJonathan,et al. The effect of LUT and cluster size on deep-submicron FPGA performance and density , 2004 .
[5] André DeHon,et al. Dynamically Programmable Gate Arrays: A Step Toward Increased Computational Density , 1996 .
[6] Mario Vento,et al. A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Jonathan Rose,et al. The effect of LUT and cluster size on deep-submicron FPGA performance and density , 2004 .
[8] S. Kawashima,et al. Ferroelectric memory based secure dynamically programmable gate array , 2002, 2002 Symposium on VLSI Circuits. Digest of Technical Papers (Cat. No.02CH37302).
[9] Masahiro Iida,et al. A Proposal of Programmable Logic Architecture for Reconfigurable Computing , 2002 .
[10] Mario Vento,et al. An Improved Algorithm for Matching Large Graphs , 2001 .
[11] Scott Hauck,et al. The roles of FPGAs in reprogrammable systems , 1998, Proc. IEEE.
[12] Irwin Kennedy. Exploiting Redundancy to Speedup Reconfiguration of an FPGA , 2003, FPL.