Circuit partitioning by quadratic Boolean programming for reconfigurable circuit boards
We propose a new quadratic Boolean programming problem formulation to partition a circuit for FPGA based reconfigurable circuit boards in which the routing topology among IC chips are predetermined. Nets passing through IC chips in their interconnections are considered in the formulation to complete...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!