Analysis and synthesis of weighted-sum functions

Tsutomu Sasao

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A weighted-sum (WS) function computes the sum of selected integers. This paper considers a design method for WS functions by look-up table (LUT) cascades. In particular, it derives upper bounds on the column multiplicities of decomposition charts for WS functions. From these, the size of LUT cascades that realize WS functions can be estimated. The arithmetic decomposition of a WS function is also shown. With this method, a WS function can be implemented with cascades and adders.

Original languageEnglish
Pages (from-to)789-796
Number of pages8
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume25
Issue number5
DOIs
Publication statusPublished - 1 May 2006

Keywords

  • Binary decision diagram
  • Column multiplicity
  • Complexity of logic functions
  • Digital filter
  • Distributed arithmetic
  • Field programmable gate array (FPGA)
  • Functional decomposition
  • LUT cascades
  • Radix converter
  • Symmetric function
  • Threshold function

Fingerprint Dive into the research topics of 'Analysis and synthesis of weighted-sum functions'. Together they form a unique fingerprint.

  • Cite this