A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
A Linear Complexity Algorithm for the Automatic Generation of Convex Multiple Input Multiple Output Instructions
Lecture Notes in Computer Science
The Instruction-Set Extensions problem has been one of the major topic in the last years and it consists of the addition of a set of new complex instructions to a given Instruction-Set. This problem in its general formulation requires an exhaustive search of the design space to identify the candidate instructions. This search turns into an exponential complexity of the solution. In this paper we propose an efficient linear complexity algorithm for the automatic generation of convex Multipledoi:10.1007/978-3-540-71431-6_13 dblp:conf/arc/GaluzziBV07 fatcat:ixexi5262rfupoonh2dzotqdba