KGPMAP:library-based technology-mapping technique for antifuse based FPGAs

Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix

“…In Ref. [4], the figure of merit, u ¼ number of distinct signatures in the library, h/total number of basis functions in the library is used for measuring the effectiveness of a signature scheme. As the number of Boolean functions belonging to each equivalent signature classes varies, it would be interesting to examine the probability of aliasing from experimental results based on the cardinality of the colliding classes.…”

“…Classification of switching functions is an important problem in logic design used for the development of Universal Logic Modules [9 -11] and for cell library binding [4,6]. Cell library binding, also frequently called technology mapping, is the process of transforming arbitrary free logic circuits into bound logic circuits where the interconnection of components are the instances of basic elements from a given library.…”

“…After performing cell library binding, a new complete structural representation of an original free logic circuit is available and serves as an interface to physical design tools in the next step of the computer-aided design process. Frequently, cell library binding uses some type of classification of switching functions as a tool to match efficiently the library instances with free logic circuits [3,4,6,7,18].…”

Family of Fast Linearly Independent Ternary Arithmetic Transforms

“…Arithmetic expansion was also used in testing [6], [17], [19], [32], [33], in Manuscript probabilistic analysis of logical circuits [23], [28] in reliability analysis [9], [17], [26], and in the analysis of logic circuits and systems with the help of the arithmetic transform [2], [3], [8], [20]- [22], [24], [25], [27], [45]. The adding transform has been recently proposed as a signature-based library search mapper which is able to distinguish the nonequivalent functions with very low aliasing [5].…”

An Efficient Algorithm for the Calculationof Generalized Adding and Arithmetic TransformsFrom Disjoint Cubes of Boolean Functions

“…Another counterpart of Generalized Reed-Muller transform based only on addition of real numbers is a Generalized Adding transform introduced in [18]. The Adding transform has been found useful in a recently proposed signature-based library search mapper that is able to distinguish the nonequivalent functions with very low aliasing [19].…”