DocumentCode :
3015672
Title :
Abstraction of word-level linear arithmetic functions from bit-level component descriptions
Author :
Dasgupta, Pallab ; Chakrabarti, P.P. ; Nandi, Amit ; Krishna, Sekar ; Chakrabarti, Arindam
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
fYear :
2001
fDate :
2001
Firstpage :
4
Lastpage :
8
Abstract :
RTL descriptions for word-level arithmetic components typically specify the architecture at the bit-level of the registers. The problem studied in this paper is to abstract 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 abstraction of word-level linear functions from bit-level component descriptions. We also present complexity results for component matching which justifies the advantage of performing abstraction prior to component matching
Keywords :
computational complexity; digital arithmetic; RTL descriptions; bit-level component; bit-level component descriptions; bit-level specification; complexity; component matching; word-level abstractions; word-level descriptions; word-level functionality; word-level linear arithmetic functions; word-level linear functions; Boolean functions; Computer architecture; Computer science; Data structures; Digital arithmetic; Logic; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design, Automation and Test in Europe, 2001. Conference and Exhibition 2001. Proceedings
Conference_Location :
Munich
ISSN :
1530-1591
Print_ISBN :
0-7695-0993-2
Type :
conf
DOI :
10.1109/DATE.2001.914992
Filename :
914992
Link To Document :
بازگشت