Algorithms for Compositions of Arithmetic Transforms and Their Extensions

Author

Pang, Yu ; Radecka, Katarzyna ; Zilic, Zeljko

Author_Institution

Concordia Univ., Montreal

fYear

2006

fDate

10-13 Dec. 2006

Firstpage

379

Lastpage

382

Abstract

This paper addresses the use of Arithmetic Transforms (AT) and its extensions to express word-level quantities and sequential elements. Their applications cover equivalence checking and component matching. Compositional construction of an overall circuit becomes critical. In order to facilitate the compositions, novel algorithms are proposed to get high performance and experiments prove their efficiency.

Keywords

combinational circuits; decision diagrams; digital arithmetic; sequential circuits; arithmetic transforms; combinational circuits; component matching; equivalence checking; sequential circuits; sequential elements; word-level decision diagrams; Application software; Application specific integrated circuits; Boolean functions; Data structures; Delay; Digital arithmetic; Digital signal processing; Formal verification; Microprocessors; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2006. ICECS '06. 13th IEEE International Conference on

Conference_Location

Nice

Print_ISBN

1-4244-0395-2

Electronic_ISBN

1-4244-0395-2

Type

conf

DOI

10.1109/ICECS.2006.379804

Filename

4263382

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2959072