Title of article
The complexity of multiple wordlength assignment Original Research Article
Author/Authors
G.A. Constantinides، نويسنده , , G.J. Woeginger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
4
From page
137
To page
140
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.
Keywords
Computational complexity , multiple wordlength , Precision , Digital signal processing
Journal title
Applied Mathematics Letters
Serial Year
2002
Journal title
Applied Mathematics Letters
Record number
897316
Link To Document