Row-shift decompositions for index generation functions
Tsutomu Sasao · Design, Automation, and Test in Europe · 2012
This paper shows a realization of incompletely specified index generation functions in the form f(X 1 ,X 2 ) = g(h(X 1 )+X 2 ), where + denotes an integer addition. A decomposition algorithm is shown. Experimental results show that most of n = 2q−3 variable functions where k = 2q −1 combinations are specified can be realized by a pair of q-input q-output LUTs. The computation time is O(k). Experimental results using address tables, lists of English words, and randomly generated functions are shown.