← Back to Patent Explorer
EP0485776A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

A method for executing graphics pixel packing instructions in a data processor

Assignee: Motorola Solutions Inc
•
Filing: 1991-10-24
•
Granted: —
•
Expires: 2011-10-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for executing a graphics pixel packing instruction in a data processing system (20). An instruction sequencer (22) transfers graphics instruction to a graphics execution unit (29). In response to receiving a pixel packing instruction, the graphics execution unit (29) transfers a selected number of data operands from the communications bus (36). One of the selected data operands comprises a plurality of bits representative of one or more fixed point values, each fixed point value represents the intensity of one of the color channels within a pixel. The graphics execution unit (29) truncates each of the fixed point values to a predetermined number of bits to generate a corresponding number of truncated bit fields, and packs the truncated bits fields into a predetermined position in a second data operand. The second data operand accumulates the truncated color channel values into pixel format, to provide an intermediate value, which is rotated to provide a result data operand.

Inventors

  • 👤 Keith Everett Diefendorff
  • 👤 Janet H. Sooch

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-09 19:18
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/005; G06F; G06F5/00; G06F7/00; G06F7/38; G06F7/48; G06F7/499; G06F7/49942; G06F7/49947; G06F7/49973

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 296 words
In a data processing system (20), comprising: storage means (50) for storing a plurality of data elements and a plurality of instructions, said plurality of data elements comprising data operands for use with said plurality of instructions; an arithmetic logic execution unit (26,27) for executing a selected type of instructions; a graphics execution unit (29) for executing a selected type of graphic instructions received from said sequencer means; communications means (36,38,44) coupled to each of said execution units (26,27,29), for providing said instructions of said selected type to each of said execution units, said communications means transferring said plurality of data elements between said storage means (50) and said execution units (26,27,29); and sequencer means (22) for providing a sequence of instruction addresses to said storage means (50), for receiving a sequence of instructions for execution by said execution units (26,27,29) in response thereto, and for delivering said sequence of instructions to said communications means (36,38,44), said sequencer means (22) also retrieving a required number of data elements from said storage means (50) for each instruction in said sequence of instructions; a method for executing a packing instruction of a selected type using said graphics execution unit, said method comprising the steps of: transferring a selected number of data operands to said graphics execution unit (29), one of said selected data operands comprising a plurality of bits representative of one or more fixed point values; truncating each of the one or more fixed point values to a predetermined number of bits, said predetermined number of bits comprising a plurality of bit fields; packing said plurality of bit fields into a single packed bit-field; inserting said single packed bit-field into a predetermined position in a second one of said selected data operands to provide an insert value.
Claim 2
Dependent Claim 38 words
The method of claim 1 wherein said insert value is an intermediate value, and rotating said intermediate value by a predetermined number of bit positions to provide a result data operand for storage in said storage means. (50)
Claim 3
Independent Claim 68 words
The method of claims 1 or 2, further comprising shifting a second one of said selected data operands by a number of bit positions equal in length to a number of bits comprising the single packed bit-field; and inserting said single packed bit-field into a predetermined position in said second one of said selected data operands to provide a result data operand for storage in said storage means.
Claim 4
Independent Claim 76 words
The method of claims 1, 2 or 3, further comprising shifting a second one of said selected data operands by a number of bit positions equal in length to a number of bits comprising each one of said plurality of truncated bit fields; and inserting said plurality of truncated bit fields into a predetermined position in said second one of said selected data operands to provide a result data operand for storage in said storage means.
Claim 5
Independent Claim 54 words
The method of any preceding claim further comprising the step of using information encoded in an opcode corresponding to said packing instruction to determine a first value corresponding to a bit length of said truncated bit fields and a second value corresponding to a number of bit position for rotation of said intermediate value.
Claim 6
Independent Claim 51 words
The method of any preceding claim further comprising the step of using information encoded in a third data operand to determine a first value corresponding to a bit length of said truncated bit fields and a second value corresponding to a number of bit position for rotation of said intermediate value.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag