US4559611A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Mapping and memory hardware for writing horizontal and vertical lines
Assignee: International Business Machines Corp
•
Filing: 1983-06-30
•
Granted: 1985-12-17
•
Expires: 2003-06-30
Abstract
Abstract Structure for enhancing data processing applications by the ability to write both horizontal and vertical lines into a two-dimensional array. The disclosure describes a mapping for storing an array in 64K memory chips, and the required data transformations, address calculations, and chip hardware. As described, the mapping and hardware provide bit addressability in both horizontal and vertical directions.
Inventors
- 👤 Daniel L. Ostapko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:34
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0207; G11; G11C; G11C8/00
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
91 words
A system for storing a two-dimensional array of data bits on a plurality of memory chip locations comprising: means for storing an array of data bits corresponding to horizontal and vertical lines in a plurality of memory chips wherein said data bits for said horizontal lines are stored in said memory chips in a different sequence than said data bits for said vertical lines, and means connected to each of said memory chips for reading out said data bits into a serialized output bit stream for a two-dimensional raster-scan display application.
Claim 2
Independent Claim
91 words
A system for storing a two-dimensional array of data bits on a plurality of memory chip locations comprising: means for storing an array of data bits corresponding to horizontal and vertical lines in a plurality of memory chips wherein said data bits for said horizontal lines are stored in said memory chips in a different sequence than said data bits for said vertical lines, and means connected to each of said memory chips for reading out said data bits into a serialized output bit stream for a two-dimensional raster-scan display application.
Claim 3
Dependent Claim
131 words
A system according to claim 1 wherein said means for storing said array of data bits includes an address generator means for address translation, said address generator means including at least one incrementer means responsive to first selected bits of a data word address, and responsive to first selected bits of a data bit address, a chip number storage means for providing chip number bits, an adder means responsive to second selected bits of said data word address and said data bit address and to said chip number bits from said chip number storage means to produce an adder output means, wherein said adder output means is combined with the output of said at least one incrementer means to produce a translated data word address and a translated data bit address.
Claim 4
Dependent Claim
140 words
A system according to claim 1 wherein said means for storing said array of data bits includes an address generator means for address translation, said address generator means including a first incrementer means responsive to first selected bits of a data word address, and responsive to first selected bits of a data bit address, a chip number storage means for providing chip number bits, an adder means responsive to second selected bits of said data word address and said data bit address and to said chip number bits from said chip number storage means to produce an adder output means, wherein said adder output means is combined with the output of said first incrementer means to produce a translated data word address and is combined with the output of said second incrementer means to produce a translated data bit address.
Claim 5
Dependent Claim
40 words
A system according to claim 2 wherein said second selected bits of said data word address are low order bits of said address and said second selected bits of said data bit address are high order bits of said address.
Claim 6
Dependent Claim
139 words
A system according to claim 3 wherein said word address consists of eight bits (positions 7,6,5,4,3,2,1,0) and said bit address consists of eight bits (positions 7,6,5,4,3,2,1,0), and wherein said address generator means carries out an address translation function in the horizontal mode specified as Bit-address (5,4,3,2,1,0)=integer of X/16 or X(9,8,7,6,5,4) Bit-address (7,6)=4 modulo Y or Y(1,0) Word-address (1,0)=4 modulo integer of Y/4 or Y(3,2) Word-address (7,6,5,4,3,2)=integer of Y/16 or Y(9,8,7,6,5,4) and wherein said address generator means carries out an address translation function in the vertical mode specified as ______________________________________
Bit-address (5,4,3,2,1,0) =
Integer of
X/16 or X(9,8,7,6,5,4)
Bit-address (7,6) =
4 modulo Y-16 modulo (X+Y)
= 4 modulo -X
Word-address (1,0) =
4 modulo ((4×4| integer
part of Y/4)-
16|(X+Y))/4
= 4 modulo (16|Y-16|(X+Y))/4
= 4 modulo integer of -X/4
Word-address (7,6,5,4,3,2) =
integer of
Y/16 or Y(9,8,7,6,5,4,).
______________________________________
References Cited (Backward Citations)
US3292151A
Cited
US3466611A
Cited
US3588829A
Cited
US3737866A
Cited
US4020470A
Cited
US4024508A
Cited
US4025901A
Cited
US4126897A
Cited
US4128873A
Cited
US4195342A
Cited
US4296467A
Cited
US4309755A
Cited
US4402043A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-12-16 | 1989-06-17 | 1989-12-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-12-16 | 1993-06-17 | 1993-12-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-12-16 | 1997-06-17 | 1997-12-17 | $7700.00 | Window Closed / Lapsed |