A fast algorithm for minimizing FPGA combinational and sequential modules

Authors:
Dimitrios Kagaris;Spyros Tragoudas
Affiliations:
Southern Illinois Univ., Carbondale;Southern Illinois Univ., Carbondale
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
1996

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Introduction to algorithms

Introduction to algorithms
On Retiming for FPGA Logic Module Minimization

ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a quadratic-time algorithm for minimizing the number of modules in an FPGA with combinational and sequential modules (like the C-modules and S-modules of the ACT2 and ACT3 architectures). The constraint is that a combinational module can be combined with one flip-flop in a single sequential module, only if the combinational module drives no other combinational modules. Our algorithm uses a minimum-cost flow formulation to solve the problem with a significant time improvement over a previous approach that used a general linear program.