# Technology Mapping of FSM Oriented to LUT-Based FPGA
## 7 Discussion  
The results, shown in the paper, indicate that carrying out FSM using the method, which gives the chance to share logic blocks, leads to a substantial reduction of the number of logic blocks in FPGAs in comparison with a classic approach i.e., method based on separate implementation of a transition and output block of FSM. The essence of this reduction lies in the skillful conducting of the process of technology mapping directed at LUT-based FPGA. In the process of technology mapping, the process of decomposition plays an incredibly vital role. While decomposing the whole combinational logic, it is simultaneously possible to search for more effective solutions than those gained using a classic method.  
The presented method is universal as it makes it possible to search for an efficient solution for any coding of states. The presented results were obtained for the most basic coding method based on ascribing next words of a natural binary code to the states. It seems that the next stage of the research will prove the efficiency of the presented optimization of FSM for other coding methods directed at minimization of the area, power consumption, etc.  
\begin{table}
\begin{tabular}{c c c c c c c c c c c c c} \hline \hline  & & & & & & & & & & & & \\ \hline \multicolumn{1}{c}{\multirow{2}{*}{**Name**}} & \multirow{2}{*}{**Benchmarks**} & \multicolumn{4}{c}{**Vivado (Artix 7)**} & \multicolumn{4}{c}{**QuartusCyclone 10)**} \\ \cline{3-11}  & & & & & **Separate** & **Shared** & **super-sha.** & **Separate** & **Shared** & **super-sha.** & **Sep-sha.** \\ \hline \multicolumn{1}{c}{\multirow{2}{*}{**Name**}} & \multirow{2}{*}{**In**} & \multirow{2}{*}{**Out**} & \multirow{2}{*}{**P**} & **States** & \multirow{2}{*}{**6**} & \multirow{2}{*}{**A**} & \multirow{2}{*}{**A**} & \multirow{2}{*}{**A**} & \multirow{2}{*}{**A**} & \multirow{2}{*}{**8**} & \multirow{2}{*}{**A**} & \multirow{2}{*}{**8**} + \(\lambda\) & \\ \hline bbara & 4 & 2 & 60 & 10 & 9 & 3 & 13 & \(-\)1 & 11 & 2 & 15 & \(-\)2 \\ bbsse & 7 & 7 & 56 & 16 & 14 & 14 & 25 & 3 & 17 & 11 & 24 & 3 \\ dk512 & 1 & 3 & 30 & 15 & 2 & 2 & 4 & 0 & 2 & 2 & 4 & 0 \\ domfile & 2 & 1 & 96 & 24 & 5 & 1 & 6 & 0 & 6 & 1 & 6 & 1 \\ ex2 & 2 & 2 & 72 & 19 & 10 & 2 & 12 & 0 & 12 & 3 & 14 & 1 \\ ex3 & 2 & 2 & 36 & 10 & 4 & 2 & 6 & 0 & 4 & 2 & 6 & 0 \\ ex4 & 6 & 9 & 21 & 14 & 6 & 8 & 17 & \(-\)3 & 7 & 8 & 13 & 2 \\ ex7 & 2 & 2 & 36 & 10 & 4 & 1 & 5 & 0 & 4 & 1 & 5 & 0 \\ keyb & 7 & 2 & 170 & 19 & 38 & 7 & 43 & 2 & 41 & 5 & 42 & 4 \\ opus & 5 & 6 & 22 & 10 & 10 & 10 & 17 & 3 & 9 & 9 & 15 & 3 \\ see & 7 & 7 & 56 & 16 & 16 & 13 & 27 & 1 & 16 & 11 & 26 & 1 \\ tkb & 6 & 3 & 1569 & 32 & 36 & 9 & 43 & 2 & 27 & 7 & 49 & \(-\)15 \\ tma & 7 & 6 & 42 & 20 & 23 & 17 & 44 & 2 & 25 & 16 & 40 & 1 \\ train11 & 2 & 1 & 25 & 11 & 4 & 1 & 5 & 0 & 4 & 1 & 5 & 0 \\  & & & & & & 181 & 90 & 267 & & 185 & 79 & 264 \\  & & & & & & 271 & 267 & & & 264 & 264 & \\ \hline \hline \end{tabular}
\end{table}
Table 6: Results of experiments (Vivado and Quartus II, number of states \(\geq\)10).  
**Author Contributions:** Conceptualization, M.K. and D.K.; methodology, M.K. and D.K.; software, M.K. and D.K.; validation, M.K. and D.K.; formal analysis, M.K. and D.K.; investigation, M.K. and D.K.; resources, M.K. and D.K.; data curation, M.K. and D.K.; writing--original draft preparation, M.K. and D.K.; writing--review and editing, M.K. and D.K.; visualization, M.K. and D.K.; supervision, M.K. and D.K.; project administration, M.K. and D.K.; funding acquisition, M.K. and D.K. All authors have read and agreed to the published version of the manuscript.  
**Funding:** The study was partially supported by the Polish Ministry of Science and Higher Education.  
**Conflicts of Interest:** The authors declare no conflict of interest.