A Sequential Circuit Partitioning Algorithm for Dynamically Reconfigurable FPGAs

In this paper, we present a sequential circuit partitioning algorithm to minimize the number of registers for dynamically reconfigurable FPGAs. The algorithm is performed on our specific graph model and divided into two phases: 1) the labeling phase and 2) the minimizing cost phase. We first use as soon as possible and as late as possible algorithms to assign nodes so that the precedence constraints are satisfied. Then, some nodes are adjusted or replicated according to several proposed methods to minimize the number of registers. Experimental results demonstrate the effectives of our algorithms.

[1]  D. Jones,et al.  A time-multiplexed FPGA architecture for logic emulation , 1995, Proceedings of the IEEE 1995 Custom Integrated Circuits Conference.

[2]  Huiqun Liu,et al.  Network flow based circuit partitioning for time-multiplexed FPGAs , 1998, ICCAD 1998.

[3]  Evangeline F. Y. Young,et al.  Temporal logic replication for dynamically reconfigurable FPGA partitioning , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Steven Trimberger,et al.  A time-multiplexed FPGA , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[5]  André DeHon,et al.  DPGA-coupled microprocessors: commodity ICs for the early 21st Century , 1994, Proceedings of IEEE Workshop on FPGA's for Custom Computing Machines.

[6]  Steven Trimberger,et al.  Scheduling designs into a time-multiplexed FPGA , 1998, FPGA '98.