Implementation Approaches for Reconfigurable Logic Applications

Reconfigurable FPGAs provide designers with new implementation approaches for designing high-performance applications. This paper discusses two basic implementation approaches with FPGAs: compiletime reconfiguration and run-time reconfiguration. Compile-time reconfiguration is a static implementation strategy where each application consists of one configuration. Run-time reconfiguration is a dynamic implementation strategy where each application consists of multiple cooperating configurations. This paper introduces these strategies and discusses the implementation approaches for each strategy. Existing applications for each strategy are also discussed.

[1]  Dzung T. Hoang,et al.  Searching genetic databases on Splash 2 , 1993, [1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines.

[2]  Brad L. Hutchings,et al.  Design methodologies for partially reconfigured systems , 1995, Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[3]  S. Trimberger,et al.  A reprogrammable gate array and applications , 1993 .

[4]  Jean Vuillemin,et al.  Programmable Active Memories: A Performance Assessment , 1992, Heinz Nixdorf Symposium.

[5]  Mark Shand,et al.  Hardware speedups in long integer multiplication , 1991, SIGARCH Comput. Archit. News.

[6]  Martin Turner,et al.  An FPGA-based hardware accelerator for image processing , 1994 .

[7]  Brad L. Hutchings,et al.  A dynamic instruction set computer , 1995, Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[8]  Daniel P. Lopresti.  Rapid implementation of a genetic sequence comparator using field-programmable logic arrays , 1991 .

[9]  Brad Hutchings,et al.  Density enhancement of a neural network using FPGAs and run-time reconfiguration , 1994, Proceedings of IEEE Workshop on FPGA's for Custom Computing Machines.

[10]  Duncan A. Buell,et al.  Splash 2 , 1992, SPAA.

[11]  John Dunlop,et al.  Dynamic reconfiguration of FPGAs , 1994 .