Mathematical framework for representing discrete functions as word-level polynomials

D Pradhan, S Askar, M Ciesielski

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

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.
Translated title of the contributionMathematical framework for representing discrete functions as word-level polynomials
Original languageEnglish
Title of host publicationUnknown
PublisherIEEE Computer Society
Pages135 - 139
Number of pages4
Publication statusPublished - Dec 2003

Bibliographical note

Conference Proceedings/Title of Journal: Eighth IEEE International High-Level Design Validation and Test Workshop, 2003
Other identifier: INSPECAccessionNumber:790724

Fingerprint Dive into the research topics of 'Mathematical framework for representing discrete functions as word-level polynomials'. Together they form a unique fingerprint.

Cite this