DocumentCode :
2154195
Title :
Verification of datapaths based on world level polynomial
Author :
Junhua, Wu ; Donghai, Li ; Guangsheng, Ma
Author_Institution :
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
fYear :
2008
fDate :
20-23 Oct. 2008
Firstpage :
2107
Lastpage :
2110
Abstract :
A reduced, canonical, weighted generalized list (WGL) is presented in this paper. This representation can effective describe world-level polynomial function. The reduction rules of WGL were proposed, and the equivalence verification method of register transfer level (RTL) design based on WGL was implemented. Experimental results show that WGL is more effective than other existent model, when it is used for the equivalent verification of RTL design.
Keywords :
binary decision diagrams; computational complexity; formal verification; polynomials; binary decision diagrams; datapaths verification; equivalence verification method; register transfer level design; weighted generalized list; world-level polynomial function; Algebra; Arithmetic; Boolean functions; Circuits; Computer science; Data structures; Discrete cosine transforms; Fast Fourier transforms; Polynomials; Signal design;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Solid-State and Integrated-Circuit Technology, 2008. ICSICT 2008. 9th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2185-5
Electronic_ISBN :
978-1-4244-2186-2
Type :
conf
DOI :
10.1109/ICSICT.2008.4734983
Filename :
4734983
Link To Document :
بازگشت