Non-disjoint decomposition of Boolean functions and its application in FPGA-oriented technology mapping

Mariusz Rawski , L Jóźwiak , Mirosława Nowicka , Tadeusz Łuba


We present a new theory of non-disjoint serial decomposition. We also present our new decomposition tool DEMAIN. The decomposition approach implemented in DEMAIN relies on: a partition-based representation of Boolean functions; and an effective balanced decomposition strategy that switches between the parallel and non-disjoint serial decomposition. In consequence, we applied the non-disjoint serial decomposition and parallel decomposition for efficient synthesis of FPGA-based circuits directed towards area or delay optimisation.
Author Mariusz Rawski (FEIT / IT)
Mariusz Rawski,,
- The Institute of Telecommunications
, L Jóźwiak - [Eindhoven University of Technology (TU/e)]
L Jóźwiak,,
- Technische Universiteit Eindhoven
, Mirosława Nowicka (FEIT / IT)
Mirosława Nowicka,,
- The Institute of Telecommunications
, Tadeusz Łuba (FEIT / IT)
Tadeusz Łuba,,
- The Institute of Telecommunications
Book EUROMICRO 97. New Frontiers of Information Technology., Proceedings of the 23rd EUROMICRO Conference, 1997
Keywords in Englisharea optimisation, balanced decomposition strategy, Boolean functions, circuit optimisation, Circuit synthesis, decomposition tool, Delay, delay optimisation, Demain, field programmable gate arrays, FPGA-oriented technology mapping, high level synthesis, Input variables, logic circuits, logic partitioning, Logic synthesis, nondisjoint serial decomposition, Paper technology, parallel decomposition, partition-based representation, Programmable logic arrays, switches, table lookup
Score (nominal)0
Score sourcejournalList
Publication indicators WoS Citations = 16; Scopus Citations = 20; GS Citations = 32.0
Citation count*32 (2020-05-28)
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?