Incompletely specified index generation functions can often be represented with fewer
variables than original functions by appropriately assigning values to don't cares. The …

Minimization of index generation functions attracts increasing interest lately. Methods
proposed in the literature focus mainly on linear decomposition using XOR gates. In this …

Various approaches have been proposed to minimize specific Boolean functions called
index generation functions. However, these techniques do not guarantee optimum …

This paper shows study results on linear decomposition of symmetric index generation
functions. We analyze properties of symmetric index generation functions, and derive a …

Various methods for reducing hardware implementation cost of incompletely specified index
generating functions have been proposed lately. Considering the methods based on linear …

Functional decomposition is a crucial task in logic synthesis. In this paper we present a
theory for finding such decomposition using the notion of r-admissibility and graph coloring …

References on Classification Functions Page 1 11 References on Classification Functions This
chapter lists papers on classification functions and index generation functions. Some …

This paper presents a method to improve a heuristic linear decomposer for index generation
functions. Besides being fast and scalable, it also improves the solutions. This is done …

Applications of pattern recognition, design of fault tolerant systems and communications
have key problems that are naturally described by partially defined (incompletely defined) …

Memory minimization seems to be the main problem of effective index generation functions
hardware implementation. A linear decomposition can be used to reduce memory size. In …