Abstract | ||
---|---|---|
In a previous paper, the balls-in-bins model was shown to efficiently enumerate random functions as a means to estimate the size of programmable architecture for the circuit needed to realize an index generation function. Because there are so many balls-in-bins instances, it is typically not possible to enumerate all. So, a Monte Carlo simulation is performed instead. In this paper, we show how to improve the balls-in-bins estimates by using a weighted approach. An exact enumeration approach is also proposed that allows for the exhaustive enumeration of decomposition charts for the same analysis as in a previous paper. It is based on the enumeration of integer partitions. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/ISMVL.2018.00032 | 2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL) |
Keywords | Field | DocType |
Index generation functions,decomposition charts,exact enumeration,integer partitions,balls in bins model,programmable architecture,logic design | Discrete mathematics,Monte Carlo method,Computer science,Enumeration,Algorithm,Partition (number theory) | Conference |
ISSN | ISBN | Citations |
0195-623X | 978-1-5386-4465-2 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jon T. Butler | 1 | 321 | 42.77 |
Tsutomu Sasao | 2 | 1083 | 141.62 |