DocumentCode :
3541407
Title :
Binary Taylor diagrams: an efficient implementation of Taylor expansion diagrams
Author :
Hooshmand, A. ; Shamshiri, S. ; Alisafaee, M. ; Lotfi-Kamran, P. ; Naderi, M. ; Navabi, Z. ; Alizadeh, B.
Author_Institution :
Electr. & Comput. Eng. Dept., Tehran Univ., Iran
fYear :
2005
fDate :
23-26 May 2005
Firstpage :
424
Abstract :
This paper presents an efficient method of implementing Taylor expansion diagrams (TED) which is called binary Taylor diagrams (BTD). BTD is based on Taylor series like TED, but uses a binary data structure. So BTD functions are simpler than those of TED.
Keywords :
Boolean functions; arithmetic; equivalence classes; formal verification; series (mathematics); trees (mathematics); BTD; TED; Taylor expansion diagrams; Taylor series; arithmetic function representation; binary Taylor diagrams; binary data structure; boolean function representation; equivalence checking; formal verification methods; simple binary tree structure; Arithmetic; Binary trees; Boolean functions; Circuit simulation; Data structures; Equations; Formal verification; Packaging; Paper technology; Taylor series;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN :
0-7803-8834-8
Type :
conf
DOI :
10.1109/ISCAS.2005.1464615
Filename :
1464615
Link To Document :
بازگشت