Decomposition time effectiveness for various synthesis strategies dedicated to FPGA structures
Marcin Kubica, Dariusz Kania, Adam Opara · AIP conference proceedings · 2016
The main goal of the paper is to compare the analyzed synthesis methods taking time effectiveness of the decomposition process into account. The basic difference between the compared methods is the function representation. Two of three analyzed synthesis algorithms (DekBDD and MultiDec) use function description in the form of BDD. In Decomp algorithm, which was the basis of developing DekBDD and MultiDec systems, the function was described in a table form. Thus, the paper includes the results of the experiments conducted for a set of benchmarks that indicate considerable advantage of decomposition algorithms in which the functions are represented in the form of BDD.