Abstraction of word-level linear arithmetic functions from bit-level component descriptions
Pallab Dasgupta, P.P. Chakrabarti, Arun Kumar Nandi, S. Chenna Krishna, A. Chakrabarti · 2001
RTL descriptions for word-level arithmetic components typically specify the architecture at the bit-level of the reg-the word-level functionality of a component from its bit-level specification. This is particularly useful in simulation since word-level descriptions can be simulated much faster than bit-level descriptions. Word-level abstractions are also useful for reducing the complexity of component matching, since the number of words is significantly smaller than the number of bits. This paper presents an algorithm for ab-straction of word-level linear functions from bit-level com-ponent descriptions. We also present complexity results for component matching which justifies the advantage of per-forming abstraction prior to component matching. 1.