Patent US3197073A successfully refreshed from Google Patents.
Patent US4958302A successfully refreshed from Google Patents.
US4958302A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Graphics frame buffer with pixel serializing group rotator
Assignee: HP Inc
•
Filing: 1987-08-18
•
Granted: 1990-09-18
•
Expires: 2007-08-18
Abstract
Abstract A graphics system uses a programmable tile size and shape supported by a frame buffer memory organization wherein (X, Y) pixel addresses map into regularly offset permutations on groups of RAM address and data line assignments. This allows one RAM in each group to be accessed with a memory cycle in unison with one RAM in each other group, up to the number of groups. During such a memory cycle each RAM can receive a different address. A tile is the collection of pixel locations associated with a collection of addresses sent to the RAM's. Because of the regular nature of the permutations these locations may be regions bounded by a single boundary that may be rectangular and of varying size and shape. Changing the mapping of (X, Y) pixel addresses to RAM addresses for the groups changes the size and shape of the tiles. Tiles are cached. Tiles for RGB pixel values are cached in an RGB cache, while Z values are cached in a separated cache. Caching allows the principle of locality to substitute shorter bit-cycles to the cache for memory cycles to the frame buffer, resulting in improved memory throughput. A group rotator and associated group-sized shift register per bit-plane cooperate during refresh to reorder and serialize the pixels of sixteen by one tiles.
Inventors
- 👤 Robert W. Fredrickson
- 👤 Monish S. Shah
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 16:29
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/36; G09G5/39; G09G5/395; G09G2360/00; G09G2360/12; G09G2360/121; G09G2360/122; G09G5/363
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
250 words
A method of serializing the content of a graphics system frame buffer having a bit-plane per bit of pixel value, for each bit-plane the method comprising the steps of: a. partitioning the frame buffer RAM's into groups containing equal numbers of RAM's; b. applying separate addresses to each group; c. storing n-many bits at each address in each group, n an integer greater than one determining the number of pixel values in each group; d. partitioning the groups into first and second banks of equal numbers of groups; e. simultaneously enabling all groups in the first bank, disabling the groups in the second bank, while applying selected addresses to each group and reading the data from those groups; f. capturing the n-many bits from each group into associated n-bit latches; g. for a selected ordering of the various n-bit latches, parallel loading a shift register with the outputs of each n-bit latch in the selected ordering, one n-bit latch at a time; while subsequently h. shifting the shift register n-many times after each parallel load in step g to produce a serial bit stream representing n pixels; i. simultaneously disabling all groups in the first bank, enabling all groups in the second bank, while applying the same addresses as in step e to all groups and reading the data from those groups; j. repeating steps f, g and h subsequent to step i; and k. combining the serial bit streams from each bit-plane into a sequence of multi-bit pixel values.
Claim 2
Independent Claim
250 words
A method of serializing the content of a graphics system frame buffer having a bit-plane per bit of pixel value, for each bit-plane the method comprising the steps of: a. partitioning the frame buffer RAM's into groups containing equal numbers of RAM's; b. applying separate addresses to each group; c. storing n-many bits at each address in each group, n an integer greater than one determining the number of pixel values in each group; d. partitioning the groups into first and second banks of equal numbers of groups; e. simultaneously enabling all groups in the first bank, disabling the groups in the second bank, while applying selected addresses to each group and reading the data from those groups; f. capturing the n-many bits from each group into associated n-bit latches; g. for a selected ordering of the various n-bit latches, parallel loading a shift register with the outputs of each n-bit latch in the selected ordering, one n-bit latch at a time; while subsequently h. shifting the shift register n-many times after each parallel load in step g to produce a serial bit stream representing n pixels; i. simultaneously disabling all groups in the first bank, enabling all groups in the second bank, while applying the same addresses as in step e to all groups and reading the data from those groups; j. repeating steps f, g and h subsequent to step i; and k. combining the serial bit streams from each bit-plane into a sequence of multi-bit pixel values.
Claim 3
Independent Claim
197 words
A method of serializing the content of a graphics system frame buffer having a bit-plane per bit of pixel value, for each bit-plane the method comprising the steps of: a. forming, from k-many separately addressable sections of RAM, each for reading and writing n-bit words, a bit-plane having a data path of (k.n)-many bits arranged as k-many n-bit groups, n an integer greater than one determining the number of pixel values in each group and k an integer greater than one determining the number of groups; b. taking as a reference order for the (k.n)-many bits in the data path a selected ordering of the groups from most significant to least significant, in conjunction with selected orderings of bits from most to least significant within each group; c. applying separate addresses to each group; d. storing into each group an associated n-bit word; e. simultaneously applying selected addresses to each group in the k-many thereof and reading, according to the reference order, the k-many n-bit words; f. permuting the order of the groups read in step e, to produce a reordering of the k-many n-bit groups; and g. capturing the (k.n)-many bits of the reordered k-many groups.
Claim 4
Independent Claim
197 words
A method of serializing the content of a graphics system frame buffer having a bit-plane per bit of pixel value, for each bit-plane the method comprising the steps of: a. forming, from k-many separately addressable sections of RAM, each for reading and writing n-bit words, a bit-plane having a data path of (k.n)-many bits arranged as k-many n-bit groups, n an integer greater than one determining the number of pixel values in each group and k an integer greater than one determining the number of groups; b. taking as a reference order for the (k.n)-many bits in the data path a selected ordering of the groups from most significant to least significant, in conjunction with selected orderings of bits from most to least significant within each group; c. applying separate addresses to each group; d. storing into each group an associated n-bit word; e. simultaneously applying selected addresses to each group in the k-many thereof and reading, according to the reference order, the k-many n-bit words; f. permuting the order of the groups read in step e, to produce a reordering of the k-many n-bit groups; and g. capturing the (k.n)-many bits of the reordered k-many groups.
Claim 5
Dependent Claim
47 words
A method as in claim 2 wherein the frame buffer stores an image for a raster scan graphics output device, and further wherein the reordering produced in step f is a function of which scan line in the raster contains the (k.n)-many bits read in step e.
Claim 6
Dependent Claim
56 words
A method as in claim 2 wherein the frame buffer stores an image for a raster scan graphics output device, wherein a scan line corresponds to at least (k+1) groups of n-many bits, and further wherein the permutation used in step f is a function of where along a raster scan line are located the (k.n)-many
Claim 7
Dependent Claim
57 words
A method as in claim 2 wherein the k-many n-bit words read in step e comprise a tile selected in response to a read operation for a pixel within that tile, and further wherein the permutation used in step f is a function of a pixel address identifying the location of that pixel within the frame buffer.
Claim 8
Dependent Claim
36 words
A method as in claim 2 further comprising the step of shifting out to a graphics display device, one bit at a time and in a linear sequence, the reordered (k.n)-many bits captured in step g.
Claim 9
Dependent Claim
311 words
Apparatus for producing a serial sequence of parallel-presentation multi-bit pixel values from a frame buffer, the serial sequence corresponding to at least a portion of a scan line for a raster scan graphics output device, the apparatus comprising: means for generating a pixel address; a frame buffer with a plurality of bit-planes each having k-many separately addressable n-bit groups; addressing means, coupled to the means for generating a pixel address and to the frame buffer, for generating from the pixel address separate addresses for each of the k-many groups; control means, coupled to the frame buffer, for simultaneously performing read memory cycles for each of the k-many n-bit groups in each bit-plane; and further comprising for each bit-plane: k-many n-bit latches, each n-bit latch having inputs coupled to the n-many bits of one of the k-many groups in this bit-plane of the frame buffer and receiving bits according to read memory cycles performed by the control means; an n-bit shift register having n-many parallel load inputs, each one of which is coupled to a corresponding output of each of the k-many n-bit latches; sequencing means coupled to the means for generating a pixel address, to each bit-plane's k-many latches, and to each bit-plane's n-bit shift register, for loading, one n-bit latch per bit-plane at a time and in a sequence that is a function of the pixel address, the contents of the next n-bit latch in the sequence into the n-bit shift register; and means, coupled to each n-bit shift register, for serially shifting to an output port on each shift register, the contents of each n-bit shift register in n-many shifts inbetween each loading performed by the sequencing means; whereby the bits appearing at the output port of each of each n-bit shift register may be combined to form a parallel presentation of a serial sequence of multi-bit pixel values.
Claim 10
Dependent Claim
311 words
Apparatus for producing a serial sequence of parallel-presentation multi-bit pixel values from a frame buffer, the serial sequence corresponding to at least a portion of a scan line for a raster scan graphics output device, the apparatus comprising: means for generating a pixel address; a frame buffer with a plurality of bit-planes each having k-many separately addressable n-bit groups; addressing means, coupled to the means for generating a pixel address and to the frame buffer, for generating from the pixel address separate addresses for each of the k-many groups; control means, coupled to the frame buffer, for simultaneously performing read memory cycles for each of the k-many n-bit groups in each bit-plane; and further comprising for each bit-plane: k-many n-bit latches, each n-bit latch having inputs coupled to the n-many bits of one of the k-many groups in this bit-plane of the frame buffer and receiving bits according to read memory cycles performed by the control means; an n-bit shift register having n-many parallel load inputs, each one of which is coupled to a corresponding output of each of the k-many n-bit latches; sequencing means coupled to the means for generating a pixel address, to each bit-plane's k-many latches, and to each bit-plane's n-bit shift register, for loading, one n-bit latch per bit-plane at a time and in a sequence that is a function of the pixel address, the contents of the next n-bit latch in the sequence into the n-bit shift register; and means, coupled to each n-bit shift register, for serially shifting to an output port on each shift register, the contents of each n-bit shift register in n-many shifts inbetween each loading performed by the sequencing means; whereby the bits appearing at the output port of each of each n-bit shift register may be combined to form a parallel presentation of a serial sequence of multi-bit pixel values.
References Cited (Backward Citations)
US4303986A
Cited
US4388621A
Cited
US4434503A
Cited
US4667190A
Cited
US4562435A
Cited
US4595996A
Cited
US4595917A
Cited
US4703322A
Cited
US4620186A
Cited
US4683466A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-09-17 | 1994-03-19 | 1994-09-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-09-17 | 1998-03-19 | 1998-09-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-09-17 | 2002-03-19 | 2002-09-18 | $7700.00 | Window Closed / Lapsed |