By Topic

Instruction identification algorithm of instruction-set extensions based on relationship matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dai, L. ; State-Key Lab. of ASIC & Syst., Fudan Univ., Shanghai, China

A novel instruction identification algorithm of instruction-set extensions based on a relationship matrix is proposed. Through using a relationship matrix the infeasible regions in the complete search space are pruned and the search speed for subgraphs of the application data flow graph is accelerated greatly. Compared with Atasu's algorithm, the experiments prove that the search number of valid nodes is the same but the search number of invalid nodes is decreased by about 40-82%.

Published in:

Electronics Letters  (Volume:47 ,  Issue: 12 )