DocumentCode
3501214
Title
Linear decomposition of index generation functions
Author
Sasao, Tsutomu
Author_Institution
Kyushu Inst. of Technol., Iizuka, Japan
fYear
2012
fDate
Jan. 30 2012-Feb. 2 2012
Firstpage
781
Lastpage
788
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.
Keywords
binary codes; English words; IP address tables; ambiguity measure; binary converters; imbalance measure; index generation functions; linear decomposition; linear transformations; m-out-of-n code; randomly generated functions; Compounds; Decision trees; Indexes; Multiplexing; Registers; Table lookup; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference (ASP-DAC), 2012 17th Asia and South Pacific
Conference_Location
Sydney, NSW
ISSN
2153-6961
Print_ISBN
978-1-4673-0770-3
Type
conf
DOI
10.1109/ASPDAC.2012.6165060
Filename
6165060
Link To Document