TU Bergakademie Freiberg | Fakultät für Mathematik und Informatik

1. Workshop Boolesche Probleme

Dr.-Ing. Lê Trung Quôc, TU Chemnitz-Zwickau, Fakultät für Elektrotechnik und Informationstechnik, Postfach 964, D-09009 Chemnitz

Abstract
In this paper we introduce for the first time a parameterized representation of Boolean functions, which is non sensitive for variable permutations and at same time uniquely characterizes the class of Pi - equivalent Boolean functions. Further more, we show how to use these representations to solve the matching problems on the synthesis process of FPGas efficiently. Based on the Q-Transformation, ervery cell could (theoretically) be mapped one-to-one into a natural number and therefore quickly registered and retrieved in the library.