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.

Date of Patent:
Jul. 07, 2015

Filed:

Sep. 30, 2010
Applicants:

Mark J. Hickey, Rochester, MN (US);

Adam J. Muff, Rochester, MN (US);

Matthew R. Tubbs, Rochester, MN (US);

Charles D. Wait, Byron, MN (US);

Inventors:

Mark J. Hickey, Rochester, MN (US);

Adam J. Muff, Rochester, MN (US);

Matthew R. Tubbs, Rochester, MN (US);

Charles D. Wait, Byron, MN (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/345 (2006.01); G06F 9/30 (2006.01); G06F 9/38 (2006.01);
U.S. Cl.
CPC ...
G06F 9/30098 (2013.01); G06F 9/3016 (2013.01); G06F 9/30181 (2013.01); G06F 9/345 (2013.01); G06F 9/3824 (2013.01);
Abstract

Due to the ever expanding number of registers and new instructions in modern microprocessor cores, the address widths present in the instruction encoding continue to widen, and fewer instruction opcodes are available, making it more difficult to add new instructions to existing architectures without resorting to inelegant tricks that have drawbacks such as source destructive operations. The disclosed invention utilizes specialized decode and address calculation hardware that concatenates a fixed number of least significant bits of the instruction address onto the most significant side of each register address portion contained in the instruction, yielding the full register address, instead of providing the full register address widths for every register used in the instruction. This frees up valuable opcode space for other instructions and avoids compiler complexity. This aligns nicely with how most loops are unrolled in assembly language, where independent operations are near each other in memory.


Find Patent Forward Citations

Loading…