Resubstitution method for big size Boolean logic design targeting look‐up‐table implementation

A scalable design method to perform multilevel network minimization targeting k‐input look‐up‐tables (k‐LUT) is proposed. It contributes toward the big size logic design theory and application. The method is based on the resubstitution which is formulated and solved as a covering task: A node functi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of circuit theory and applications 2021-08, Vol.49 (8), p.2411-2424
Hauptverfasser:	Lemberski, Igor, Suponenkovs, Artjoms
Format:	Artikel
Sprache:	eng
Schlagworte:	Boolean algebra Boolean function decomposition Dichotomies Logic design look‐up‐table‐LUT Programmable logic arrays reconfigurable hardware resubstitution
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!