Title :
Notes on "Complexity of the lookup-table minimization problem for FPGA technology mapping"
Author :
Shujian Zhang ; Miller, D.M. ; Muzio, J.C.
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Abstract :
For the original article see IEEE Trans. Computer-Aided Design, vol. 13, no. 11, p. 1319-32 (1994). In this paper, we prove that 3-RLMP and 4-RLMP, proposed by Farrahi and Sarrafzadeh in the aforementioned paper, are NP-complete.
Keywords :
computational complexity; field programmable gate arrays; logic CAD; minimisation of switching nets; table lookup; 3-RLMP; 4-RLMP; FPGA technology mapping; NP-completeness; complexity; lookup-table minimization problem; Boolean functions; Computer science; Councils; Field programmable gate arrays; Logic gates; Microelectronics; Minimization; Paper technology; Scholarships; Table lookup;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
