New ideas for solving covering problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
On the Number of Dependent Variables for Incompletely Specified Multiple-Valued Functions
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Survey and taxonomy of packet classification techniques
ACM Computing Surveys (CSUR)
Design Methods for Multiple-Valued Input Address Generators
ISMVL '06 Proceedings of the 36th International Symposium on Multiple-Valued Logic
An Implementation of an Address Generator Using Hash Memories
DSD '07 Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools
Logic Design of Programmable Logic Arrays
IEEE Transactions on Computers
Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
IEEE Transactions on Computers
An architecture for IPv6 lookup using parallel index generation units
ARC'13 Proceedings of the 9th international conference on Reconfigurable Computing: architectures, tools, and applications
Row-shift decompositions for index generation functions
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
In an incompletely specified function f, don't care values can be chosen to minimize the number of variables to represent f. It is shown that, in incompletely specified functions with k 0's and k 1's, the probability that f can be represented with only p = 2[log2(k + 1)] variables is greater than e-1 = 0.36788. In the case of multiple-output functions, where only the outputs for k input combinations are specified, most functions can be represented with at most p = 2[log2(k+1)] -1 variables. Experimental data is shown to support this. Because of this property, an IP address table can be realized with a small amount of memory.