The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 10, 2015
Filed:
Sep. 03, 2010
Hendrik Tjeerd Joannes Zwartenkot, Eindhoven, NL;
Alexander Augusteijn, Eindhoven, NL;
Yuanging Guo, Eindhoven, NL;
Jürgen Von Oerthel, Eindhoven, NL;
Jeroen Anton Johan Leijten, Hulsel, NL;
Erwan Yann Maurice Le Thenaff, Eindhoven, NL;
Hendrik Tjeerd Joannes Zwartenkot, Eindhoven, NL;
Alexander Augusteijn, Eindhoven, NL;
Yuanging Guo, Eindhoven, NL;
Jürgen Von Oerthel, Eindhoven, NL;
Jeroen Anton Johan Leijten, Hulsel, NL;
Erwan Yann Maurice Le Thenaff, Eindhoven, NL;
Intel Corporation, Santa Clara, CA (US);
Abstract
Method of generating respective instruction compaction schemes for subsets of instructions to be processed by a programmable processor, comprising the steps of a) receiving at least one input code sample representative for software to be executed on the programmable processor, the input code comprising a plurality of instructions defining a first set of instructions (S), b) initializing a set of removed instructions as empty (S), c) determining the most compact representation of the first set of instructions (S) d) comparing the size of said most compact representation with a threshold value (S), e) carrying out steps e1 to e3 if the size is larger than said threshold value, e1) determining which instruction of the first set of instructions has a highest coding cost (S), e2) removing said instruction having the highest coding cost from the first set of instructions and (S), e3) adding said instruction to the set of removed instructions (S), f) repeating steps b-f, wherein the first set of instructions is formed by the set of removed instructions (S, S).