Mathematical framework for representing discrete functions as word-level polynomials

Author

Pradhan, Dhiraj K. ; Askar, Serkan ; Ciesielski, Maciej

Author_Institution

Dept. of Comput. Sci., Bristol Univ., UK

fYear

2003

fDate

12-14 Nov. 2003

Firstpage

135

Lastpage

139

Abstract

This paper presents a mathematical framework for modeling arithmetic operators and other RTL design modules as discrete word-level functions and proposes a polynomial representation of those functions. The proposed representation attempts to bridge the gap between bit-level BDD representations and word-level representations, such as *BMDs and TEDs.

Keywords

Boolean functions; binary decision diagrams; high level synthesis; polynomial approximation; RTL design modules; arithmetic operators; automated verification tools; bit-level BDD representations; discrete function; discrete word-level functions; high level synthesis; mathematical framework; multivariate polynomial; polynomial representation; Binary decision diagrams; Boolean functions; Bridges; Computer science; Data structures; Design engineering; Digital arithmetic; Logic functions; Polynomials; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

High-Level Design Validation and Test Workshop, 2003. Eighth IEEE International

Conference_Location

San Francisco, CA, USA

Print_ISBN

0-7803-8236-6

Type

conf

DOI

10.1109/HLDVT.2003.1252487

Filename

1252487

Link To Document

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