US5301263A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High memory bandwidth system for updating z-buffer values
Assignee: HP Inc
•
Filing: 1990-09-18
•
Granted: 1994-04-05
•
Expires: 2010-09-18
Abstract
Abstract A system updates the z-values corresponding to pixels of a computer graphics screen. An integral part of the system comprises a controller/memory module which employs preliminary determinations as to whether or not a z-value has been previously stored for a pixel, multiple comparators, and partial read and write operations to achieve a significantly higher memory bandwidth. The bandwidth can be further increased by configuring a plurality of such modules in a parallel architecture.
Inventors
- 👤 Charles R. Dowdell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 11:05
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/14; G09G5/36; G09G5/39; G09G5/393
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
129 words
A system for updating the z-values corresponding to pixels of a computer graphics screen, comprising: a) memory storing old z-values representing depths at pixel locations; b) access logic for receiving new z-values for pixels of the graphics screen and accessing portions of old z-values for the pixels from memory; c) a portion comparator that compares a portion of a new z-value with a corresponding portion of an old z-value accessed from memory; and d) decision logic that, based on the output of the portion comparator, causes the access logic to perform one of the functions of (1) replacing the old z-value by the new z-value, (2) causing access of and a comparison of another portion of the old z-value from memory, and (3) ending updating of the old z-value.
Claim 2
Independent Claim
129 words
A system for updating the z-values corresponding to pixels of a computer graphics screen, comprising: a) memory storing old z-values representing depths at pixel locations; b) access logic for receiving new z-values for pixels of the graphics screen and accessing portions of old z-values for the pixels from memory; c) a portion comparator that compares a portion of a new z-value with a corresponding portion of an old z-value accessed from memory; and d) decision logic that, based on the output of the portion comparator, causes the access logic to perform one of the functions of (1) replacing the old z-value by the new z-value, (2) causing access of and a comparison of another portion of the old z-value from memory, and (3) ending updating of the old z-value.
Claim 3
Dependent Claim
40 words
A system as claimed in claim 1 wherein a plurality of processors operate in parallel, each comprising the memory, access logic, portion comparator, and decision logic, with each pixel of the graphics screen being preassigned to one of the processors.
Claim 4
Dependent Claim
46 words
A system as claimed in claim 1 wherein the access logic replaces the old z-value by the new z-value by replacing only the portion of the z-value last compared by the portion comparator and all portions of the z-value not yet compared by the portion comparator.
Claim 5
Dependent Claim
55 words
A system as claimed in claim 1 wherein the portion comparator comprises a first comparator that determines whether the binary values of the two portions are equal and a second comparator that determines whether the binary value of one portion is greater than the binary value of the other portion, both comparators operating in parallel.
Claim 6
Dependent Claim
60 words
A system as claimed in claim 1 wherein the access logic further reads from memory for each pixel the value of a validity indication, which indicates whether the old z-value in memory is valid, and writes a new z-value to memory without comparison and switches in memory the value of the validity indication if the old z-value is not valid.
Claim 7
Dependent Claim
33 words
A system as claimed in claim 5 wherein the validity indications for certain pixels may be set to facilitate rapid elimination of pixel data from the graphics screen without writing the new z-values.
Claim 8
Independent Claim
109 words
A method of updating the z-values representing depths at pixel locations of a computer graphics screen, comprising: a) providing a new z-value for a pixel of the graphics screen; b) partitioning the new z-value into portions; c) performing an update of z-values by: i) comparing a most significant portion of the new z-value with a corresponding portion of a previously stored z-value; and ii) based on the result of the step of comparing, performing one of the functions of (1) replacing the previously stored z-value by the new z-value, (2) repeating steps (i) and (ii) for a next most significant portion of the z-value, and (3) ending the comparison.
Claim 9
Independent Claim
109 words
A method of updating the z-values representing depths at pixel locations of a computer graphics screen, comprising: a) providing a new z-value for a pixel of the graphics screen; b) partitioning the new z-value into portions; c) performing an update of z-values by: i) comparing a most significant portion of the new z-value with a corresponding portion of a previously stored z-value; and ii) based on the result of the step of comparing, performing one of the functions of (1) replacing the previously stored z-value by the new z-value, (2) repeating steps (i) and (ii) for a next most significant portion of the z-value, and (3) ending the comparison.
Claim 10
Dependent Claim
40 words
A method as claimed in claim 7 wherein the steps of partitioning and performing an update are performed by a plurality of processors operating in parallel, with each pixel of the graphics screen being preassigned to one of the processors.
Claim 11
Dependent Claim
41 words
A method as claimed in claim 7 wherein the previously stored z-value is replaced by the new z-value by replacing only the portion of the z-value compared in that step of comparing and all portions of the z-value not yet compared.
Claim 12
Dependent Claim
60 words
A method as claimed in claim 7 wherein the step of comparing comprises performing a first comparison to determine whether the binary values of the two portions are equal and a second comparison to determine whether the binary value of a first portion is greater than the binary value of a second portion, both comparison steps being performed in parallel.
Claim 13
Dependent Claim
27 words
A method as claimed in claim 10 wherein the result of the first comparison determines whether another portion of the previously stored z-value is read from memory.
Claim 14
Dependent Claim
34 words
A method as claimed in claim 10 wherein the result of the second comparison determines whether the portion of the new z-value being compared and all portions not yet compared are written to memory.
Claim 15
Dependent Claim
60 words
A method as claimed in claim 7 wherein the step of comparing the two z-values is preceded by reading from memory a validity indication, which indicates whether the old z-value in memory is valid, and writing a new z-value to memory without comparison and switching in memory the value of the validity indication if the old z-value is not valid.
Claim 16
Dependent Claim
33 words
A method as claimed in claim 13 wherein the validity indications for certain pixels may be set to facilitate rapid elimination of pixel data from the graphics screen without writing of new z-values.
References Cited (Backward Citations)
US4914582A
Cited
US4813002A
Cited
US4958302A
Cited
US4961153A
Cited
US4907174A
Cited
US4951232A
Cited
US5038297A
Cited
US5068808A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-04 | 1997-10-04 | 1998-04-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-04 | 2001-10-04 | 2002-04-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-04 | 2005-10-04 | 2006-04-05 | $7700.00 | Window Closed / Lapsed |