New approach of exploiting symmetry in SAT-based Boolean matching for FPGA technology mapping

Boolean matching is a key procedure in FPGA technology mapping. SAT-based Boolean matching provides a flexible solution for exploring various FPGA architectures. However, the computational complexity prohibits its application practically, inputs permutation is the bottleneck of SAT-based approach. I...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 IEEE International Conference on Vehicular Electronics and Safety (ICVES) s. 282 - 285
Hlavní autoři: Xiu-qin, Wang, Yang, Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2013
Témata:
Boolean functions
Design automation
Educational institutions
Field programmable gate arrays
FPGA
Multiplexing
Pins
SAT-based
symmetry
Table lookup
technology mapping
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Boolean matching is a key procedure in FPGA technology mapping. SAT-based Boolean matching provides a flexible solution for exploring various FPGA architectures. However, the computational complexity prohibits its application practically, inputs permutation is the bottleneck of SAT-based approach. In this paper, a new approach of exploiting symmetry in PLBs architecture and Boolean function is proposed. The problem of input permutation is transformed to the problem of combination assignment according to our three strategies, which directly generate necessary permutations and only check the satisfiability of these necessary permutations. The instances analysis shows that our approach can greatly reduce the problem scale and improve the performance of SAT-based Boolean matching. More experiments will be done, and more factors will be considered in future work.
DOI:10.1109/ICVES.2013.6619648