US4500962A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer system having an extended directly addressable memory space
Assignee: US Philips Corp
•
Filing: 1983-09-22
•
Granted: 1985-02-19
•
Expires: 2003-09-22
Abstract
Abstract A computer system utilizing an N bit word in which a directly addressable space is limited to 2N-1 words or 2N characters by the system architecture. Extension of this directly addressable space to 2N words is accomplished by a combination of a memory management circuit and a character selection signal instructions which allows both characters and words to be mixed in a first 2N-1 words of directly addressable space and words only to be addressed in a second 2N-1 words of directly addressable space.
Inventors
- 👤 Edmond Lemaire
- 👤 Jacques Lebreton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:52
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/06; G06F12/0615; G06F12/0623
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
345 words
A computer system comprising central processing means (10) random access memory means (12), memory management means (11); and bus means (17) interconnecting said central processor means, said random access memory means and said memory management means, comprising: said random access memory means having a sequence of word locations of equal length, each location accommodating a word, a predetermined fraction of said word locations containing two character locations of equal length, each location accommodating a character being half as long as a word, said random access memory means being connected to said bus means by means of an address input (MAD 00--MAD 15), a bidirectional data line (BIO 00-BIO 15), a character selection signal (CHA) input, and a handshake interconnection (TMRX, TRMN); said central processing means being connected to said bus means by means of an address output (MAD 00--MAD 15), a bidirectional data line (BIO 00-BIO 15), a character selection signal (CHA) output, and a handshake interconnection; said central processing means having address generating means for generating N-bit addresses on said address output, and first signalling means for generating a character detection signal, a first value of said character detection signal signalling that an accompanying address is directed to a word location as one of 2 N different word locations; a second value of said character selection signal signalling that an accompanying address is directed to a character location, in that one predetermined address bit operates as first/second character location selecting bit, the remaining (N-1) bits then operating to select a word location in one predetermined half of said 2 N different word locations; said memory management means being connected to said bus means by means of an address input (MAD 00 . . . MAD 15), a bidirectional data line (BIO 00-BIO 15) and a handshake interconnection, said memory management means being connected to said central processing means by means of a segment table pointer line (13), said memory management means being connected to said random access memory means by means of a physical page number line (16) for forwarding a page selection signal.
Claim 2
Dependent Claim
345 words
A computer system comprising central processing means (10) random access memory means (12), memory management means (11); and bus means (17) interconnecting said central processor means, said random access memory means and said memory management means, comprising: said random access memory means having a sequence of word locations of equal length, each location accommodating a word, a predetermined fraction of said word locations containing two character locations of equal length, each location accommodating a character being half as long as a word, said random access memory means being connected to said bus means by means of an address input (MAD 00--MAD 15), a bidirectional data line (BIO 00-BIO 15), a character selection signal (CHA) input, and a handshake interconnection (TMRX, TRMN); said central processing means being connected to said bus means by means of an address output (MAD 00--MAD 15), a bidirectional data line (BIO 00-BIO 15), a character selection signal (CHA) output, and a handshake interconnection; said central processing means having address generating means for generating N-bit addresses on said address output, and first signalling means for generating a character detection signal, a first value of said character detection signal signalling that an accompanying address is directed to a word location as one of 2 N different word locations; a second value of said character selection signal signalling that an accompanying address is directed to a character location, in that one predetermined address bit operates as first/second character location selecting bit, the remaining (N-1) bits then operating to select a word location in one predetermined half of said 2 N different word locations; said memory management means being connected to said bus means by means of an address input (MAD 00 . . . MAD 15), a bidirectional data line (BIO 00-BIO 15) and a handshake interconnection, said memory management means being connected to said central processing means by means of a segment table pointer line (13), said memory management means being connected to said random access memory means by means of a physical page number line (16) for forwarding a page selection signal.
Claim 3
Dependent Claim
20 words
A system as claimed in claim 1, wherein said predetermined address bit is the least significant among said N bits.
Claim 4
Dependent Claim
78 words
A system as claimed in claim 2, characterized in that said memory management means comprise a first k-register segment table for implementing paged memory operations within said predetermined half of said 2 N different word locations, and a second k-register segment table for in case of said first value of said character selection signal and a predetermined value of said predetermined address bit implementing paged memory operations within the other half of said 2 N different word locations.
References Cited (Backward Citations)
US3500466A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-02-19 | 1988-08-20 | 1989-02-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-02-19 | 1992-08-20 | 1993-02-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-02-19 | 1996-08-20 | 1997-02-19 | $7700.00 | Window Closed / Lapsed |