US4956810A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High speed method for data transfer
Assignee: International Business Machines Corp
•
Filing: 1988-09-06
•
Granted: 1990-09-11
•
Expires: 2008-09-06
Abstract
Abstract A method is described for transferring data units from a serially organized memory to a bit planar organized memory. The method first selects a plurality of data units from the serially organized memory. A bit pattern from the selected data units is then captured, which bit pattern includes only bits to be stored in a subset of the storage planes of the bit planar organized memory. The bit pattern is processed to isolate from it, subsidiary bit patterns, one bit pattern for each storage plane in the bit planar memory. Each subsidiary bit pattern is then translated so that its bit sequence is properly oriented and is then stored in a plane of the bit planar organized memory. In a preferred embodiment of the invention, the translations take place as the result of a table look-up step.
Inventors
- 👤 Arthur M. Sherman
- 👤 Peter C. Yanker
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 21:41
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/36; G06; G06T; G06T1/00; G06T1/60
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
108 words
A method for transferring data units a serially organized memory to a bit-planar organized memory, the method comprising: selecting a plurality of data units from said serially organized memory; capturing a bit pattern from said plurality of data units, said bit pattern including only bits to be stored in a subset of storage planes in said bit planar organized memory; isolating from said bit pattern, subsidiary bit patterns, each said subsidiary bit pattern to be stored in one storage plane of said subset of storage planes; and translating each said subsidiary bit pattern into a form suitable for storage in a plane of said bit planar organized memory.
Claim 2
Independent Claim
108 words
A method for transferring data units a serially organized memory to a bit-planar organized memory, the method comprising: selecting a plurality of data units from said serially organized memory; capturing a bit pattern from said plurality of data units, said bit pattern including only bits to be stored in a subset of storage planes in said bit planar organized memory; isolating from said bit pattern, subsidiary bit patterns, each said subsidiary bit pattern to be stored in one storage plane of said subset of storage planes; and translating each said subsidiary bit pattern into a form suitable for storage in a plane of said bit planar organized memory.
Claim 3
Dependent Claim
34 words
The method of claim 1 wherein each said isolated bit pattern includes all of the proper bit positions to be stored in a storage plane, but in an arrangement not suitable for storage therein.
Claim 4
Dependent Claim
38 words
The method of claim 2 wherein said translating step includes the further step of: accessing from a table a corresponding bit pattern to said subsidiary bit pattern, said corresponding pattern exhibiting a sequence of bits suitable for storage.
Claim 5
Dependent Claim
15 words
The method of claim 3 wherein said selecting step provides a pair of data units.
Claim 6
Dependent Claim
42 words
The method of claim 4 wherein said capturing step comprises: applying a mask to said pair of data units to enable capture of all the bits therein to be stored in at least a pair of planes of said bit planar memory.
Claim 7
Dependent Claim
25 words
The method of claim 5 wherein the bits captured from one data unit are shifted and combined with bits captured from the other data unit.
Claim 8
Dependent Claim
38 words
The method of claim 6 wherein said isolating step comprises: applying a mask to said combined bits to further segregate said bits into four groups; and shifting and combining said four groups into two said subsidiary bit patterns.
Claim 9
Dependent Claim
22 words
The method of claim 7 wherein said data units are words and said selecting step accesses two words containing two bytes each.
Claim 10
Independent Claim
200 words
A method for transferring data units from a serial memory to a bit planar memory, each plane of said bit planar memory including only odd or even bit positions, but not both, the method comprising: selecting a pair of words from said serial memory, each said word containing at least one display data unit, and placing said selected words into first and second registers; applying a mask to said selected pair of words to remove therefrom all odd numbered bits so that only bits in even bit positions remain in said registers; shifting the bit in one said register and merging said shifted bits with the bits stored in the other said register so that both said registers contain all even bits of said selected words; applying a second mask to the bits stored in said registers to partially segregate said even bits within said registers; merging said partially segregated bits to assemble the even bits to be stored in each said plane of said bit planar memory, said assembled even bits organized in improper order; translating said assembled even bits to their proper order; and storing said translated even bit positions into said planes of said bit planar memory.
Claim 11
Independent Claim
200 words
A method for transferring data units from a serial memory to a bit planar memory, each plane of said bit planar memory including only odd or even bit positions, but not both, the method comprising: selecting a pair of words from said serial memory, each said word containing at least one display data unit, and placing said selected words into first and second registers; applying a mask to said selected pair of words to remove therefrom all odd numbered bits so that only bits in even bit positions remain in said registers; shifting the bit in one said register and merging said shifted bits with the bits stored in the other said register so that both said registers contain all even bits of said selected words; applying a second mask to the bits stored in said registers to partially segregate said even bits within said registers; merging said partially segregated bits to assemble the even bits to be stored in each said plane of said bit planar memory, said assembled even bits organized in improper order; translating said assembled even bits to their proper order; and storing said translated even bit positions into said planes of said bit planar memory.
Claim 12
Dependent Claim
59 words
The invention as defined in claim 9 wherein after said selection step, the recited steps in claim 9 are repeated with said masks being applied to eliminate said even bit positions from said selected words and said subsequent steps acting to shift, mask, merge, translate and store the remaining odd bits in said planes of said bit planar memory.
Claim 13
Dependent Claim
34 words
The invention as defined in claim 9 wherein said merging step further includes shifting the bits within one register and subsequently combining said shifted bits with the partially segregated bits of the other register.
Claim 14
Dependent Claim
46 words
The invention as defined in claim 11 wherein said translating step comprises accessing from a table, a corresponding bit pattern to said improperly organized bit order, said corresponding bit order exhibiting a sequence of bits suitable for storage in a plane of said bit planar memory.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-09-10 | 1994-03-12 | 1994-09-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-09-10 | 1998-03-12 | 1998-09-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-09-10 | 2002-03-12 | 2002-09-11 | $7700.00 | Window Closed / Lapsed |