DocumentCode
3583569
Title
Boolean matching for generic FPGAs
Author
Chang, Chip-Hong ; Falkowski, Bogdari J.
Author_Institution
Nanyang Polytech., French Singapore Inst., Singapore
Volume
3
fYear
1997
Firstpage
1700
Abstract
A signature based approach to Boolean matching of generic FPGAs under input negation, input permutation, output negation and personalization has been developed. Different characteristic signatures are used for LUT- and MUX-based FPGAs. The time required to match the subcircuits to the library elements is sped up by redirecting the computational effort to preprocessing the library once using two canonical transformations: phase assignment and variable reordering
Keywords
Boolean functions; Hamming codes; field programmable gate arrays; logic testing; redundancy; Boolean matching; LUT-based FPGAs; MUX-based FPGAs; canonical transformations; characteristic signatures; computational effort; generic FPGAs; input negation; input permutation; output negation; personalization; phase assignment; signature based approach; subcircuits; variable reordering; Acceleration; Arithmetic; Boolean functions; Clustering algorithms; Data preprocessing; Field programmable gate arrays; Hamming distance; Input variables; Libraries; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on
Print_ISBN
0-7803-3583-X
Type
conf
DOI
10.1109/ISCAS.1997.621462
Filename
621462
Link To Document