US5760780A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer graphics system using caching of pixel Z values to improve rendering performance
Assignee: Hewlett Packard Development Co LP
•
Filing: 1996-01-31
•
Granted: 1998-06-02
•
Expires: 2016-01-31
Abstract
Abstract A computer graphics system utilizes caching of pixel Z values to improve rendering performance. Apparatus for updating the Z values corresponding to pixels of a computer graphics display includes a memory for storing current Z values representing depths at corresponding pixel locations, a Z cache for storing a subset of the current Z values which are stored in the memory, and a comparator for comparing a new Z value with a corresponding current Z value and indicating a pass when the new Z value satisfies a predetermined criteria. The current Z value is read from the Z cache when the current Z value is stored in the Z cache and is read from the memory when the current Z value is not stored in the Z cache. The new Z value is written into the Z cache when the comparator indicates a pass. Each cache entry preferably includes a tile of current Z values corresponding to pixels having a predefined relationship. Different tile configurations may be selected for optimum rendering performance.
Inventors
- 👤 Ronald D. Larson
- 👤 Charles R. Dowdell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 17:33
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/10; G06T15/40; G06T15/405
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
355 words
Apparatus for updating Z values corresponding to pixels of a computer graphics display, comprising: a memory for storing current Z values representing depths at corresponding pixel locations; a Z cache for storing a subset of said current Z values which are stored in said memory said Z cache including a predetermined number of cache entries and an ID representative of a memory address corresponding to each detried each of said cache entries and cache entries having locations for storing a tile of said current Z values, said tile comprising Z values corresponding to pixels having a predefined relationship; a comparator for comparing a new Z value with a corresponding current Z value and for indicating a pass when said new Z value satisfies a predetermined criteria, wherein said new Z value and said current Z value each comprise an H byte an M byte and an L byte and wherein said Z cache comprises an H byte cache, an M byte cache and an L byte cache, each of said data entries in said Z cache comprising one entry in each of said H byte. M byte and L byte caches, and wherein said comparator comprises an H byte comparator, an M byte comparator and an L byte comparator; and control logic responsive to a new Z address corresponding to said new Z value for reading said current Z value from said Z cache when said current Z value is stored in said Z cache, for reading said current Z value from said memory when said current Z value is not stored in said Z cache, for supplying said new and current Z values to said comparator and for writing said new Z value to said Z cache in response to said comparator indicating a pass, said control logic including means for reading H bytes of said tile from said memory when said current Z value is not stored in said Z cache, and for reading M bytes and L bytes of said tile from said memory only when necessary for completion of the comparison between said new Z value and said current Z value.
Claim 2
Dependent Claim
355 words
Apparatus for updating Z values corresponding to pixels of a computer graphics display, comprising: a memory for storing current Z values representing depths at corresponding pixel locations; a Z cache for storing a subset of said current Z values which are stored in said memory said Z cache including a predetermined number of cache entries and an ID representative of a memory address corresponding to each detried each of said cache entries and cache entries having locations for storing a tile of said current Z values, said tile comprising Z values corresponding to pixels having a predefined relationship; a comparator for comparing a new Z value with a corresponding current Z value and for indicating a pass when said new Z value satisfies a predetermined criteria, wherein said new Z value and said current Z value each comprise an H byte an M byte and an L byte and wherein said Z cache comprises an H byte cache, an M byte cache and an L byte cache, each of said data entries in said Z cache comprising one entry in each of said H byte. M byte and L byte caches, and wherein said comparator comprises an H byte comparator, an M byte comparator and an L byte comparator; and control logic responsive to a new Z address corresponding to said new Z value for reading said current Z value from said Z cache when said current Z value is stored in said Z cache, for reading said current Z value from said memory when said current Z value is not stored in said Z cache, for supplying said new and current Z values to said comparator and for writing said new Z value to said Z cache in response to said comparator indicating a pass, said control logic including means for reading H bytes of said tile from said memory when said current Z value is not stored in said Z cache, and for reading M bytes and L bytes of said tile from said memory only when necessary for completion of the comparison between said new Z value and said current Z value.
Claim 3
Dependent Claim
26 words
Apparatus as defined in claim 1, wherein said control logic includes logic for selecting a tile configuration from a group of two or more tile configurations.
Claim 4
Dependent Claim
61 words
Apparatus as defined in claim 2, wherein said means for selecting a tile configuration includes means for selecting a 4×1 tile configuration, wherein four pixels of the tile are located along a single scan line of the computer graphics display, or a 2×2 tile configuration, wherein two consecutive pixels are located along two consecutive scan lines of the computer graphics display.
Claim 5
Dependent Claim
21 words
Apparatus as defined in claim 1, wherein said tile contains Z values corresponding to four pixels of the computer graphics display.
Claim 6
Dependent Claim
16 words
Apparatus as defined in claim 1, wherein said Z cache comprises eight of said cache entries.
Claim 7
Dependent Claim
83 words
Apparatus as defined in claim 1, wherein said Z cache further includes a status field associated with each of said cache entries, said status field comprising a read valid subfield that indicates when Z values have been loaded from said memory, a write valid subfield that indicates when new Z values have been loaded into the Z cache, and an update subfield that indicates when one or more of the Z values in the tile of the corresponding cache entry have been updated.
Claim 8
Dependent Claim
65 words
Apparatus as defined in claim 1, wherein said control logic includes means for controlling comparison of said new Z value with said current Z value by said comparator, such that comparison of the M bytes is required only when the H bytes are equal and comparison of the L bytes is required only when the H bytes are equal and the M bytes are equal.
Claim 9
Dependent Claim
63 words
Apparatus as defined in claim 1, wherein said memory is divided into pages, and wherein said control logic includes means for flushing said Z cache when said new Z value corresponds to a different memory page from a previous new Z value, said means for flushing comprising means for writing Z values stored in said Z cache to corresponding locations in said memory.
Claim 10
Dependent Claim
41 words
Apparatus as defined in claim 1, wherein said control logic includes means for writing a selected cache entry from said Z cache to said memory before writing said new Z value into said Z cache when said Z cache is full.
Claim 11
Dependent Claim
55 words
Apparatus as defined in claim 1, wherein said control logic includes means for writing said new Z value and other bytes of said tile read from said memory but not selected for comparison into said Z cache when said current Z value is not stored in said Z cache and said comparator indicates a pass.
Claim 12
Dependent Claim
47 words
Apparatus as defined in claim 1, wherein said control logic includes means for writing the bytes of said tile read from said memory into said Z cache when said current Z value is not stored in said Z cache and said comparator does not indicate a pass.
Claim 13
Dependent Claim
352 words
In a computer graphics system comprising a memory for storing current Z values representing depths at corresponding pixel locations and a comparator for comparing a new Z value with a corresponding current Z value, a method for updating Z values, comprising the steps of: providing a Z cache for storing a subset of said current Z values which are stored in said memory, said Z cache including a predetermined number of cache entries, each of said cache entries having locations for storing a tile of said current values, said tile comprising Z values corresponding to pixels having a predefined relationship; reading said current Z value from said Z cache when said current Z value is stored in said Z cache; reading said current Z value from said memory when said current Z value is not stored in said Z cache; supplying said new Z value and said current Z value to said comparator; said comparator comparing said new Z value with said current Z value and indicating a pass when said new Z value satisfies a predetermined criteria, wherein said new Z value and said current Z value each comprise an H byte, an M byte and an L byte and wherein the step of comparing said new value with said current Z value includes comparing the H byte of said new Z value with the H byte of said current Z value such that comparison of the M bytes is required only when the H bytes are equal and comparison of the L bytes is required only when the H bytes are equal and the M bytes are equal; and writing said new Z value to said Z cache in response to said comparator indicating a passe wherein the step of reading said current Z value from said memory includes reading H bytes of said tile from said memory when said current Z value is not stored in said cache, and reading M bytes and L bytes of said tile from said memory only when necessary for completion of the comparison between said new Z value and said current Z value.
Claim 14
Dependent Claim
352 words
In a computer graphics system comprising a memory for storing current Z values representing depths at corresponding pixel locations and a comparator for comparing a new Z value with a corresponding current Z value, a method for updating Z values, comprising the steps of: providing a Z cache for storing a subset of said current Z values which are stored in said memory, said Z cache including a predetermined number of cache entries, each of said cache entries having locations for storing a tile of said current values, said tile comprising Z values corresponding to pixels having a predefined relationship; reading said current Z value from said Z cache when said current Z value is stored in said Z cache; reading said current Z value from said memory when said current Z value is not stored in said Z cache; supplying said new Z value and said current Z value to said comparator; said comparator comparing said new Z value with said current Z value and indicating a pass when said new Z value satisfies a predetermined criteria, wherein said new Z value and said current Z value each comprise an H byte, an M byte and an L byte and wherein the step of comparing said new value with said current Z value includes comparing the H byte of said new Z value with the H byte of said current Z value such that comparison of the M bytes is required only when the H bytes are equal and comparison of the L bytes is required only when the H bytes are equal and the M bytes are equal; and writing said new Z value to said Z cache in response to said comparator indicating a passe wherein the step of reading said current Z value from said memory includes reading H bytes of said tile from said memory when said current Z value is not stored in said cache, and reading M bytes and L bytes of said tile from said memory only when necessary for completion of the comparison between said new Z value and said current Z value.
Claim 15
Dependent Claim
25 words
A method as defined in claim 12 further including the step of selecting a tile configuration from a group of two or more tile configurations.
Claim 16
Dependent Claim
63 words
A method as defined in claim 12 wherein the step of writing said new Z value to said Z cache includes writing said new Z value and other bytes of said tile read from said memory but not selected for comparison into said Z cache when said current Z value is not stored in said Z cache and said comparator indicates a pass.
Claim 17
Dependent Claim
46 words
A method as defined in claim 12 further including the step of writing the bytes of said tile read from said memory into said Z cache when said current Z value is not stored in said Z cache and said comparator does not indicate a pass.
References Cited (Backward Citations)
US4965751A
Cited
US5301263A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-01 | 2001-12-01 | 2002-06-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-01 | 2005-12-01 | 2006-06-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-01 | 2009-12-01 | 2010-06-02 | $7700.00 | Window Closed / Lapsed |