Row-shift decompositions for index generation functions

Authors:
Tsutomu Sasao
Affiliations:
Kyushu Institute of Technology, Iizuka, Japan
Venue:
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2012

Citing 7
Cited 0

Storing a sparse table

Communications of the ACM
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
On the numbers of variables to represent sparse logic functions

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Handbook of Data Compression

Handbook of Data Compression
Index Generation Functions: Recent Developments

ISMVL '11 Proceedings of the 2011 41st IEEE International Symposium on Multiple-Valued Logic
Memory-Based Logic Synthesis

Memory-Based Logic Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows a realization of incompletely specified index generation functions in the form f(X1, X2) = g(h(X1)+X2), 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.