US5410672A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for the handling of banded frame buffer overflows
Assignee: Texas Instruments Inc
•
Filing: 1994-02-08
•
Granted: 1995-04-25
•
Expires: 2014-02-08
Abstract
Abstract A method is provided for handling overflows of data blocks in a system using a banded buffer. A block of data is transferred from a memory to a first band in the banded buffer. A determination is made that a portion of the block of data being transferred exceeds a boundary of the first band, and in response a description block for the portion of the block of data which exceeds the boundary of the first band is created. The description block is written into a memory queue and when a second band in the banded buffer becomes available, that portion of the data block which exceeds the boundary of the first buffer band is transferred into the second buffer band.
Inventors
- 👤 Franklin L. Sodek, Jr.
- 👤 John R. Howell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 19:31
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06K15/18; G06K15/1848; G06K15/1856; G06K15/1861; G06K15/1863
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
127 words
Apparatus for handling overflows of data blocks in a system using a partial page or banded buffer, comprising: circuitry for transferring a block of data from a memory to a first buffer or band in the partial page or banded buffer; circuitry for determining that a portion of said block exceeds a boundary of said first buffer or band; circuitry for creating a description block for said portion of said block; circuitry for writing said description block into a memory queue; and circuitry for transferring said portion of said block into a second buffer or band in the partial page or banded buffer, when a second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 2
Dependent Claim
127 words
Apparatus for handling overflows of data blocks in a system using a partial page or banded buffer, comprising: circuitry for transferring a block of data from a memory to a first buffer or band in the partial page or banded buffer; circuitry for determining that a portion of said block exceeds a boundary of said first buffer or band; circuitry for creating a description block for said portion of said block; circuitry for writing said description block into a memory queue; and circuitry for transferring said portion of said block into a second buffer or band in the partial page or banded buffer, when a second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 3
Dependent Claim
22 words
The apparatus of claim 1, wherein said partial page or banded buffer comprises a memory including first and second buffers or bands.
Claim 4
Dependent Claim
15 words
The apparatus of claim 1, wherein said memory queue comprises a portion of said memory.
Claim 5
Dependent Claim
15 words
The apparatus of claim 1, wherein said memory is defined by addresses in X-Y coordinates.
Claim 6
Dependent Claim
20 words
The apparatus of claim 4, wherein said portion of said block which exceeds said boundary exceeds a predetermined Y address.
Claim 7
Dependent Claim
16 words
The apparatus of claim 1, wherein said block of data is a block of image data.
Claim 8
Dependent Claim
34 words
The apparatus of claim 6, wherein each image data block to be transferred to one of said first and second buffer or bands is defined by its image height and image width in bytes.
Claim 9
Dependent Claim
27 words
The apparatus of claim 1, wherein an interrupt of a central processing unit is avoided when an overflow of a partial page or banded buffer memory occurs.
Claim 10
Independent Claim
150 words
A method of handling overflow of data blocks in a system using a partial page or banded buffer, comprising the steps of: transferring blocks of data from a memory to a first buffer or band in the partial page or banded buffer; determining whether any of the blocks of data being transferred exceeds a boundary of the first buffer or band; creating a description block for each block of data which exceeds the boundary of the first buffer or band; writing the description blocks into a memory queue; and transferring the portion of each data block which exceeds the boundary of the first buffer or band into a second buffer or band in the partial page or banded buffer in accordance with the corresponding description block when the second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 11
Independent Claim
150 words
A method of handling overflow of data blocks in a system using a partial page or banded buffer, comprising the steps of: transferring blocks of data from a memory to a first buffer or band in the partial page or banded buffer; determining whether any of the blocks of data being transferred exceeds a boundary of the first buffer or band; creating a description block for each block of data which exceeds the boundary of the first buffer or band; writing the description blocks into a memory queue; and transferring the portion of each data block which exceeds the boundary of the first buffer or band into a second buffer or band in the partial page or banded buffer in accordance with the corresponding description block when the second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 12
Dependent Claim
21 words
The method of claim 9, wherein the memory queue is located in a section of the partial page or banded buffer.
Claim 13
Dependent Claim
17 words
The method of claim 9, wherein the block of data being transferred comprises an image data block.
Claim 14
Dependent Claim
15 words
The method of claim 9, wherein the partial page or banded buffer comprises a memory.
Claim 15
Dependent Claim
62 words
The method of claim 9, wherein the description block contains parameters defining the location in system memory from where the portion of the data block which overflows the first buffer or band is retrieved and parameters defining the location in the second buffer or band to where the portion of the data block which overflows the first buffer or band is sent.
Claim 16
Dependent Claim
13 words
The method of claim 9, wherein said data blocks are image data blocks.
Claim 17
Independent Claim
131 words
A device, comprising: circuitry for handling overflows of data blocks in a system using a partial page or banded buffer, said circuitry comprising; means for transferring a block of data from a memory to a first buffer or band in the partial page or banded buffer; means for determining that a portion of said block exceeds a boundary of said first buffer or band; means for creating a description block for said portion of said block; means for writing said description block into a memory queue; and means for transferring said portion of said block into a second buffer or band in the partial page or banded buffer, when second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 18
Independent Claim
131 words
A device, comprising: circuitry for handling overflows of data blocks in a system using a partial page or banded buffer, said circuitry comprising; means for transferring a block of data from a memory to a first buffer or band in the partial page or banded buffer; means for determining that a portion of said block exceeds a boundary of said first buffer or band; means for creating a description block for said portion of said block; means for writing said description block into a memory queue; and means for transferring said portion of said block into a second buffer or band in the partial page or banded buffer, when second buffer or band becomes available to receive said portion of said block exceeding a boundary of said first buffer or band.
Claim 19
Dependent Claim
13 words
The device of claim 15, wherein said data blocks are image data blocks.
Claim 20
Dependent Claim
34 words
The apparatus of claim 16, wherein each image data block to be transferred to one of said first and second buffer or bands is defined by its image height and image width in bytes.
Claim 21
Dependent Claim
27 words
The apparatus of claim 15, wherein an interrupt of a central processing unit is avoided when an overflow of a partial page or banded buffer memory occurs.
References Cited (Backward Citations)
US4791564A
Cited
US4920483A
Cited
US4933877A
Cited
US4953103A
Cited
US5032981A
Cited
US5276781A
Cited
US5218670A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-04-24 | 1998-10-24 | 1999-04-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-24 | 2002-10-24 | 2003-04-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-24 | 2006-10-24 | 2007-04-25 | $7700.00 | Window Closed / Lapsed |