Conference Paper

Representation of Incompletely Specified Index Generation Functions Using Minimal Number of Compound Variables

Kyushu Inst. of Technol., Iizuka, Japan
DOI: 10.1109/DSD.2009.214 Conference: Digital System Design, Architectures, Methods and Tools, 2009. DSD '09. 12th Euromicro Conference on
Source: IEEE Xplore

ABSTRACT This paper shows a method to reduce the number of input variables to represent incompletely specified index generation functions. A compound variable is generated by EXORing the original input variables. By using both original and compound variables, incompletely specified index generation functions can be represented by fewer variables. As a means to select variables, a heuristic method using information gains is presented. We compare representing random functions using 1. only original variables, and 2. both original and compound variables. Experimental results show that the use of compound variables effectively reduces the number of input variables.

0 Followers
 · 
83 Views
  • Source
    • "Thus, Fig. 2 can be a reconfigurable circuit. This scheme is useful for communication applications where frequent changes are necessary [14] [15] [16], but cannot be treated by a conventional functional decomposition . Given an incompletely specified function, the problem of the linear decomposition is to obtain a linear transformation that minimizes the number of variables p for the general part. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper shows a heuristic method to reduce the number of variables to represent incompletely specified index generation functions using linear decompositions. To find good linear transformations, two measures are introduced: the imbalance measure and the ambiguity measure. Experimental results using m-out-of-n code to binary converters, randomly generated functions, IP address tables, and lists of English words show the usefulness of the approach.
    01/2012; DOI:10.1109/ASPDAC.2012.6165060
  • Source
    • ", [16], [18]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This survey first introduces index generation func- tions, which are useful for pattern matching in communication circuits. Then, it shows various methods to realize index gener- ation functions using memories. A linear transformation is used to reduce the number of variables and thus memory size. An extension to the multiple-valued case is also presented. I. INDEX GENERATION FUNCTION This paper surveys recent results on index generation func- tions. Applications of index generation functions include: IP address table lookup, packet filtering, terminal access con- trollers, memory patch circuits, virus scan circuits, fault maps for memory, and pattern matching. In addition, this paper introduces an index generation unit that efficiently realizes an index generation function by a linear circuit and a pair of smaller memories. Due to space limitations, definitions of standard terminology used in switching circuit theory (11) are omitted.
    Proceedings of The International Symposium on Multiple-Valued Logic 01/2011; DOI:10.1109/ISMVL.2011.17
  • Source
    • "This paper surveys new methods to design memory-based pattern matching circuits [1], [3], [4], [5], [6]. Due to the page limitation, all the proofs are omitted. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This survey first introduces index generation functions, which are useful for pattern matching in the communication circuit. Then, it shows various methods to realize index generation functions by using LUTs and memories. These methods are useful to design FPGAs with embedded memories.
    Communications and Information Technologies (ISCIT), 2010 International Symposium on; 11/2010
Show more

Preview

Download
0 Downloads
Available from