Optimization and resynthesis of complex data-paths

The problem of the optimization of complex data-paths relative to a repertoire of specified operations is discussed. Data-paths can be simplified if interconnections are functionally redundant. Redundancy is detected by means of the universal quantification of ROBDD representations of the data-path...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Eveking, Hans, Höreth, Stefan
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Automatic control Boolean functions Data structures Design automation Distributed computing Hardware > Electronic design automation > Hardware description languages and compilation Hardware > Electronic design automation > High-level and register-transfer level synthesis > Datapath optimization Hardware > Electronic design automation > Logic synthesis > Circuit optimization High level synthesis Integer linear programming Logic Machinery Simulated annealing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The problem of the optimization of complex data-paths relative to a repertoire of specified operations is discussed. Data-paths can be simplified if interconnections are functionally redundant. Redundancy is detected by means of the universal quantification of ROBDD representations of the data-path and of the specified operations. The full logical complexity of ALU's described at the gate-level is considered. A 0-1 ILP formulation of the minimization problem is given and solved by means of ROBDD's. A solution of the prelogic rectification problem for control-signals is presented.
ISSN:	0738-100X
DOI:	10.1145/157485.165075