Multi-objective optimisation algorithm for routability and timing driven circuit clustering on FPGAs

Circuit clustering algorithms fit synthesised circuits into field programmable gate array (FPGA) configurable logic blocks (CLBs) efficiently. This fundamental process in FPGA CAD flow directly impacts both effort required and performance achievable in subsequent place-and-route processes. Circuit c...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Chronic diseases and translational medicine Jg. 13; H. 4; S. 273 - 281
Hauptverfasser:	Wang, Yuan, Trefzer, Martin A, Bale, Simon J, Walker, James A, Tyrrell, Andy M
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Beijing The Institution of Engineering and Technology 01.07.2019 John Wiley & Sons, Inc
Schlagworte:	Algorithms Bandwidths Circuits CLB input bandwidth constraints CLB utilisation configurable logic blocks Critical path electronic design automation field programmable gate array Field programmable gate arrays Flexibility flexible EDA flow FPGA CAD flow FPGA‐related literature genetic algorithms Golden 20 MCNC benchmark circuits integrated circuit design interconnect minimisation logic design Methods multiobjective genetic algorithm multiobjective optimisation algorithm network routing place‐and‐route process real‐world circuit design Research Article time optimising circuit performance parameters timing circuits timing driven circuit clustering interconnect minimisation field programmable gate arrays network routing FPGA-related literature genetic algorithms time optimising circuit performance parameters configurable logic blocks Golden 20 MCNC benchmark circuits field programmable gate array real-world circuit design CLB utilisation integrated circuit design flexible EDA flow timing driven circuit clustering multiobjective optimisation algorithm CLB input bandwidth constraints electronic design automation FPGA CAD flow place-and-route process multiobjective genetic algorithm logic design timing circuits
ISSN:	1751-8601, 1751-861X, 2095-882X, 1751-861X, 2589-0514
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!