46 search results - page 6 / 10 » fpga 1999 |
DFT
1999
IEEE
14 years 1 months ago
1999
IEEE
The inherent redundancy and in-the-field reconfiguration capabilities of field programmable gate arrays (FPGAs) provide alternatives to integrated circuit redundancy-based fault r...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
FPL
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. High-performance design flows for FPGAs often rely on module generators to counter coarse logic-block granularity and limited routing resources, However, the very flexi...
FPL
1999
Springer
14 years 1 months ago
1999
Springer
Programmable logic is widely used, for applications ranging from eld-upgradable subsystems to advanced uses such as recon gurable computing platforms which are modi able at run-tim...
VLSID
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...