The complexity of multiple wordlength assignment

G.A. Constantinides, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

50 Citations (Scopus)
29 Downloads (Pure)

Abstract

This note discusses the multiple wordlength assignment problem for the design of custom digital signal processing (DSP) parallel processors. It is demonstrated that this assignment problem is NP-hard.
Original languageEnglish
Pages (from-to)137-140
JournalApplied mathematics letters
Volume15
Issue number2
DOIs
Publication statusPublished - 2002
Externally publishedYes

Keywords

  • METIS-208610

Fingerprint Dive into the research topics of 'The complexity of multiple wordlength assignment'. Together they form a unique fingerprint.

Cite this