US4090237A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Processor circuit
Assignee: AT&T Inc
•
Filing: 1976-09-03
•
Granted: 1978-05-16
•
Expires: 1996-09-03
Abstract
Abstract A processor is disclosed having improved circuitry for (1) generating m+n-bit address words from n-bit data words and (2) converting m+n-bit address words back into data words having an n-bit format. The processor includes a first arithmetic unit (AMU) that is n bits wide and which receives n-bit words from a data bus. The processor further includes a second AMU that is m bits wide and which is connected to receive the m least significant bits of an n-bit word stored in the first AMU. An m+n-bit address word is formed by (1) applying a first n-bit word from a system data bus to the first AMU with the m most significant bits of the address word to be formed being contained in the m least significant bit positions of the first word, (2) transferring the m least significant bits from the first AMU to the second AMU and concurrently applying from the data bus to the first AMU a second n-bit word representing the n least significant bits of the address word, and (3) concurrently reading out both AMUs to apply an m+n-bit address word to a system address bus. This procedure is reversed to convert an m+n-bit address word into n-bit data words.
Inventors
- 👤 James Owen Dimmick
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 16:39
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/34; G06F9/342; G06F15/00; G06F15/76; G06F15/80; G06F15/8007; H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0407
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
92 words
In a processor, a first arithmetic unit (AMU) for receiving m-bit words, a second AMU for receiving n-bit data, means for entering a first m-bit word into said first AMU, means for transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, means for entering a second m-bit word into said first AMU, and means for subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to form an m+n bit word.
Claim 2
Dependent Claim
92 words
In a processor, a first arithmetic unit (AMU) for receiving m-bit words, a second AMU for receiving n-bit data, means for entering a first m-bit word into said first AMU, means for transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, means for entering a second m-bit word into said first AMU, and means for subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to form an m+n bit word.
Claim 3
Dependent Claim
35 words
The processor of claim 1 in which said means for transferring comprises conductor means connected between an input of said second AMU and an output for said n predetermined bit positions of said first AMU.
Claim 4
Dependent Claim
32 words
The processor of claim 2 in which said n bits are transferred from said first to said second AMU concurrently with the entering of said second m-bit word into said first AMU.
Claim 5
Dependent Claim
94 words
The processor of claim 1 in which said processor further comprises; a first input on said first AMU for receiving m-bit words, a first output on said first AMU from which said n bits are transferred over a direct conductor path to a first input on said second AMU concurrently with the reception of said second m-bit word by said first input of said first AMU, and a utilization output on each of said AMUs for applying said bits concurrently read out of said AMUs as an m+n bit word to a utilization circuit.
Claim 6
Dependent Claim
119 words
In a processor connected to an m-bit data bus and to an m+n bit address bus, a first arithmetic unit (AMU) for receiving m-bit words, a second AMU for receiving n-bit data, means for entering a first m-bit word received from said data bus into said first AMU, means for transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU and for concurrently entering a second m-bit word from said data bus into said first AMU, and means for subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to apply an m+n bit word to said address bus.
Claim 7
Dependent Claim
119 words
In a processor connected to an m-bit data bus and to an m+n bit address bus, a first arithmetic unit (AMU) for receiving m-bit words, a second AMU for receiving n-bit data, means for entering a first m-bit word received from said data bus into said first AMU, means for transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU and for concurrently entering a second m-bit word from said data bus into said first AMU, and means for subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to apply an m+n bit word to said address bus.
Claim 8
Dependent Claim
36 words
The processor of claim 5 in which said means for transferring comprises n-bit conductor means connected between an input of said second AMU and an output for said n predetermined bit positions of said first AMU.
Claim 9
Dependent Claim
94 words
The processor of claim 5 in which said processor further comprises a first input on said first AMU for receiving m-bit words, a first output on said first AMU from which said n bits are transferred over a direct conductor path to a first input on said second AMU concurrently with the reception of said second m-bit word by said first input of said first AMU, and an address output on each of said AMUs for applying said bits concurrently read out of said AMUs as an m+n bit word to said address bus.
Claim 10
Dependent Claim
111 words
The processor of claim 7 in which said processor further comprises, a random access memory (RAM) connected to said first output of said first AMU and to a first output of said second AMU, means for writing into any selected location of said RAM the m+n bits of information currently in said AMUs, a second input on said AMUs connected to an output of said RAM, means for entering m+n bit information from any selected location of said RAM into AMUs via said second inputs, and means for applying the m+n bit information received by said AMUs from said RAM to said address bus from said address output of said AMUs.
Claim 11
Dependent Claim
52 words
The processor of claim 8 in which said processor further comprises, means for executing selected arithmetic-logic operations on the m+n bit information in said AMUs to form a new m+n bit word, and means for applying said new m+n bit word from said address outputs of said AMUs to said address bus.
Claim 12
Dependent Claim
148 words
The processor of claim 8 in which said processor further comprises, means for executing selected arithmetic-logic operations on the m+n bit information in said AMUs to form a new m+n bit word, and means for converting said new m+n bit word into two words having an m-bit format, said converting means comprising, means for transferring said n bits of said new word from said second AMU to said first AMU, means in said first AMU for combining said transferred n bits of said new word with m-n bits of information to form a first m-bit data word, means for applying said first formed data word from said first output of said first AMU to said data bus, and means for subsequently applying said m-bits of said new m+n bit word from said first output of said first AMU as a second m-bit data word to said data bus.
Claim 13
Dependent Claim
211 words
In combination, a processor, an m-bit data bus, means connecting said processor to said data bus for the exchange of data words between said data bus and said processor, an m+n bit address bus, means connecting said processor to said address bus for the application of address words by said processor to said address bus, said processor further comprising; a first m-bit arithmetic unit (AMU) for exchanging m-bit words with said data bus, a second n-bit AMU for receiving n-bit data, means for applying a first m-bit word received from said data bus to a first input of said first AMU, means in said first AMU for registering said m-bit word, means for transferring n bits from n predetermined bit positions of said first word from a first output of said first AMU to a first input of said second AMU, means for concurrently entering a second m-bit word received from said data bus into said first AMU at its first input, and means for subsequently reading out concurrently said n bits from an address output of said second AMU and said second m-bit word from an address output of said first AMU to form an m+n bit word, and means for applying said m+n bit word to said address bus.
Claim 14
Dependent Claim
211 words
In combination, a processor, an m-bit data bus, means connecting said processor to said data bus for the exchange of data words between said data bus and said processor, an m+n bit address bus, means connecting said processor to said address bus for the application of address words by said processor to said address bus, said processor further comprising; a first m-bit arithmetic unit (AMU) for exchanging m-bit words with said data bus, a second n-bit AMU for receiving n-bit data, means for applying a first m-bit word received from said data bus to a first input of said first AMU, means in said first AMU for registering said m-bit word, means for transferring n bits from n predetermined bit positions of said first word from a first output of said first AMU to a first input of said second AMU, means for concurrently entering a second m-bit word received from said data bus into said first AMU at its first input, and means for subsequently reading out concurrently said n bits from an address output of said second AMU and said second m-bit word from an address output of said first AMU to form an m+n bit word, and means for applying said m+n bit word to said address bus.
Claim 15
Dependent Claim
39 words
The processor of claim 11 in which said means for transferring consists of an n-bit conductor path connected between said first input of said second AMU and n predetermined bit positions of said first output for said first AMU.
Claim 16
Dependent Claim
112 words
The processor of claim 11 in which said processor further comprises, a random access memory (RAM) connected to said first output of said first AMU and to a first output of said second AMU, means for writing into any selected location of said RAM the m+n bits of information currently in said AMUs, a second input on said AMUs connected to an output of said RAM, means for entering m+n bit information from any selected location of said RAM into said AMUs via said second inputs, and means for applying the m+n bit information received by said AMUs from said RAM to said address bus from said address output of said AMUs.
Claim 17
Dependent Claim
132 words
The processor of claim 13 in which said processor further comprises, means for converting said m+n bit information in said AMUs into two words having an m-bit format, said converting means comprising, means for transferring n bits of said information from said first output of said second AMU to said second input of said first AMU, means for combining said n bit information transferred to said first AMU with m-n bits of information to form a first m-bit data word, means for applying said first formed data word from said first output of said first AMU to said data bus, and means for subsequently applying said m bits of said m+n bit information from said first output of said first AMU as a second formed m-bit data word to said data bus.
Claim 18
Dependent Claim
100 words
In a processor having a first m-bit wide arithmetic unit (AMU) and a second n-bit wide AMU, the method of generating m+n bit words comprising the steps of: 1. entering a first m-bit word into said first AMU, 2. transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, 3. entering a second m-bit word into said first AMU, and 4. reading out concurrently said n bits from said second AMU and said m bits of said second data word from said first AMU to form an m+n bit word.
Claim 19
Dependent Claim
100 words
In a processor having a first m-bit wide arithmetic unit (AMU) and a second n-bit wide AMU, the method of generating m+n bit words comprising the steps of: 1. entering a first m-bit word into said first AMU, 2. transferring n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, 3. entering a second m-bit word into said first AMU, and 4. reading out concurrently said n bits from said second AMU and said m bits of said second data word from said first AMU to form an m+n bit word.
Claim 20
Dependent Claim
40 words
The method of claim 15 in which said n bits are transferred to said second AMU over conductor means connected between an input of said second AMU and an output for said n predetermined bit positions of said first AMU.
Claim 21
Dependent Claim
32 words
The method of claim 16 in which said n bits are transferred from said first to said second AMU concurrently with the entering of said second m-bit word into said first AMU.
Claim 22
Dependent Claim
153 words
In a processor connected to an m-bit data bus and to an m+n bit address bus, a first m-bit wide arithmetic unit (AMU), a second n-bit wide AMU, the method of generating m+n bit words comprising the steps of: 1. applying a first m-bit word from said data bus to said first AMU, 2. registering said first word in said first AMU, 3. applying n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, 4. applying a second m-bit word from said data bus to said first AMU, 5. registering said n bits in said second AMU, 6. registering said second word in said first AMU, 7. subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to form an m+n bit address word, and 8. applying said address word to said address bus.
Claim 23
Dependent Claim
153 words
In a processor connected to an m-bit data bus and to an m+n bit address bus, a first m-bit wide arithmetic unit (AMU), a second n-bit wide AMU, the method of generating m+n bit words comprising the steps of: 1. applying a first m-bit word from said data bus to said first AMU, 2. registering said first word in said first AMU, 3. applying n bits from n predetermined bit positions of said first word from said first AMU to said second AMU, 4. applying a second m-bit word from said data bus to said first AMU, 5. registering said n bits in said second AMU, 6. registering said second word in said first AMU, 7. subsequently reading out concurrently said n bits from said second AMU and said second m-bit word from said first AMU to form an m+n bit address word, and 8. applying said address word to said address bus.
Claim 24
Dependent Claim
40 words
The method of claim 18 in which said n bits are transferred to said second AMU over conductor means connected between an input of said second AMU and an output for said n predetermined bit positions of said first AMU.
Claim 25
Dependent Claim
33 words
The method of claim 19 in which said n bits are applied by said first AMU to said second AMU concurrently with the application of said second m-bit word to said first AMU.
Claim 26
Dependent Claim
75 words
The method of claim 20 in which said method further comprises the steps of: 1. writing into any selected location of an m+n bit wide RAM the m+n bits of information currently in said AMUs, 2. entering m+n bit information from any selected location of said RAM into said AMUs, and 3. applying the m+n bit information received by said AMUs from said RAM to said address bus from an address output of said AMUs.
Claim 27
Dependent Claim
47 words
The method of claim 20 further comprising the steps of: 1. executing selected arithmetic-logic operations on the m+n information in said AMUs to form a new m+n bit word, and 2. applying said new m+n bit word from address outputs of said AMUs to said address bus.
Claim 28
Dependent Claim
138 words
The method of claim 20 in which said method further includes the step of executing selected arithmetic-logic operations on the m+n bit information in said AMUs to form a new m+n bit word, and the step of converting said new m+n bit word into two words having an m-bit format, said conversion comprising the steps of: 1. transferring said n bits of said new word from said second AMU to said first AMU, 2. combining said transferred n bits of said new word with m-n bits of information to form a first m-bit word, 3. applying said first formed word from an output of said first AMU to said data bus, and 4. subsequently applying said m-bits of said new word from an output of said first AMU as a second formed m-bit word to said data bus.
Claim 29
Dependent Claim
120 words
In a processor connected to an m-bit data bus for exchange of data words between said data bus and said processor, said processor also being connected to an m+n bit address bus for the application of address words by said processor to said address bus, a method of operating said processor comprising the steps of: 1. applying a first m-bit word received from said data bus to a first input of a first AMU having an m-bit width, 2. registering said m-bit word in said first AMU, 3. transferring n bits from n predetermined bit positions of said first word from a first output of said first AMU to a first input of a second AMU having an n-bit width,
Claim 30
Dependent Claim
120 words
In a processor connected to an m-bit data bus for exchange of data words between said data bus and said processor, said processor also being connected to an m+n bit address bus for the application of address words by said processor to said address bus, a method of operating said processor comprising the steps of: 1. applying a first m-bit word received from said data bus to a first input of a first AMU having an m-bit width, 2. registering said m-bit word in said first AMU, 3. transferring n bits from n predetermined bit positions of said first word from a first output of said first AMU to a first input of a second AMU having an n-bit width,
Claim 31
Dependent Claim
65 words
concurrently entering a second m-bit word received from said data bus into said first AMU at its first input, 5. subsequently reading out concurrently said n bits from an address output of said second AMU and said second m-bit word from an address output of said first AMU to form an m+n bit word, and 5. applying said m+n bit word to said address bus.
Claim 32
Dependent Claim
65 words
concurrently entering a second m-bit word received from said data bus into said first AMU at its first input, 5. subsequently reading out concurrently said n bits from an address output of said second AMU and said second m-bit word from an address output of said first AMU to form an m+n bit word, and 5. applying said m+n bit word to said address bus.
Claim 33
Dependent Claim
43 words
The method of claim 24 in which said n bits are transferred to said second AMU over an n-bit conductor path connected between said first input of said second AMU and n predetermined bit positions of said first output for said first AMU.
Claim 34
Dependent Claim
75 words
The method of claim 25 in which said method further comprises the steps of: 1. writing into any selected location of a RAM the m+n bits of information currently in said AMUs, 2. entering m+n bit information from any selected location of said RAM into said AMUs via second inputs of said AMUs, and 3. applying the m+n bit information received from said RAM to said address bus from said address outputs of said AMUs.
Claim 35
Dependent Claim
127 words
The method of claim 26 in combination with a method for converting said m+n bit information into two data words having an m-bit format, said conversion comprising the steps of: 1. transferring said n bits of said m+n bit information from said first output of said second AMU to said second input of said first AMU, 2. combining said n bit information transferred to said first AMU with m-n bit information to form a first m-bit data word, 3. applying said first formed data word from said first output of said first AMU to said data bus, and 4. applying said m bits of said m+n bit information from said first output of said first AMU as a second formed m-bit data word to said data bus.
References Cited (Backward Citations)
US3930232A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-05-15 | 1981-11-14 | 1982-05-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-05-15 | 1985-11-14 | 1986-05-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-05-15 | 1989-11-14 | 1990-05-16 | $7700.00 | Window Closed / Lapsed |