论文信息 - The complexity of multiple wordlength assignment

The complexity of multiple wordlength assignment

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.

Gerhard J. Woeginger | George A. Constantinides

[1] Mark Stephenson,et al. Bidwidth analysis with application to silicon compilation , 2000, PLDI '00.

[2] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .

[3] Leland B. Jackson,et al. On the interaction of roundoff noise and dynamic range in digital filters , 1970, Bell Syst. Tech. J..

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Wayne Luk,et al. The Multiple Wordlength Paradigm , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).

[6] B. Liu,et al. Effect of finite word length on the accuracy of digital filters--a review , 1971 .