Patent US3812480A successfully refreshed from Google Patents.
US3812480A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Code translator employing sequential memories
Assignee: AT&T Inc
•
Filing: 1972-11-15
•
Granted: 1974-05-21
•
Expires: 1992-11-15
Abstract
Abstract The introduction of single wall domains (magnetic bubbles) into coded positions of a pair of domain recirculating loops enables the provision of control signals at anyone of a number of possible time slots with relatively few external wiring connections. The transfer of a domain from each loop of the pair to a control loop responsive to the presence of a domain in a reference stage in each loop permits the formation of a twobubble code in the control loop for determining the timing of the signals. The three loops define a practical translator which can be integrated into a single domain chip.
Inventors
- 👤 D Kish
- 👤 J Smith
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 16:36
CPC Classifications
G; G06; G06F; G06F1/00; G06F1/04; G11; G11C; G11C19/00; G11C19/02; G11C19/08; G11C19/0875
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
100 words
A code translator comprising a layer of material in which single wall domains can be moved, means for defining first and second multistage loops for recirculating said domains each including a reference stage, said first and second loops comprising A and B stages, respectively, A and B having no common factor other than unity, means responsive to the simultaneous arrival of a domain in each of said loops at said reference stage for providing a timing signal, means for introducing a domain into a selected stage of each of said loops, and means for moving domains in said loops synchronously.
Claim 2
Dependent Claim
100 words
A code translator comprising a layer of material in which single wall domains can be moved, means for defining first and second multistage loops for recirculating said domains each including a reference stage, said first and second loops comprising A and B stages, respectively, A and B having no common factor other than unity, means responsive to the simultaneous arrival of a domain in each of said loops at said reference stage for providing a timing signal, means for introducing a domain into a selected stage of each of said loops, and means for moving domains in said loops synchronously.
Claim 3
Dependent Claim
23 words
A code translator in accordance with claim 1 including means for detecting the presence of a domain at each of said reference stages.
Claim 4
Dependent Claim
23 words
a code translator in accordance with claim 2 wherein said means for detecting comprises a domain detector at each of said reference stages.
Claim 5
Dependent Claim
57 words
A code translator in accordance with claim 2 wherein said means for detecting comprises a domain detector at said reference stage in said first loop and means for transferring a domain from said reference stage in said second loop to said first loop in a stage next to that occupied by the domain in said first loop.
Claim 6
Dependent Claim
30 words
A code translator in accordance with claim 4 wherein said means for transferring comprises means responsive to the presence of a domain in said reference position of said first loop.
Claim 7
Dependent Claim
40 words
A code translator in accordance with claim 1 comprising a third multistage loop, and first means for transferring a domain simultaneously from said reference stage of each of said first and second loops into associated stages of said third loops.
Claim 8
Dependent Claim
31 words
A code translator in accordance with claim 6 wherein said first means for transferring comprises means responsive to the presence of a domain at said reference stage of said first loop.
Claim 9
Dependent Claim
59 words
A code translator in accordance with claim 7 wherein said first loop and said third loop have a portion of their length including at least said reference stage in common, said portion also including second means for transferring a domain from said third to said first loop responsive to the presence of a domain at said common reference Stage.
Claim 10
Dependent Claim
49 words
A code translator in accordance with claim 8 including means for inhibiting said second means in response to the presence of a domain in each of said common reference stage and the next subsequent stage of said third loop for permitting movement of those domains about said third loop.
Claim 11
Dependent Claim
28 words
A code translator in accordance with claim 9 including means responsive to the detection of domains in consecutive stages of said third loop for selectively annihilating those domains.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1977-05-20 | 1977-11-19 | 1978-05-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1981-05-20 | 1981-11-19 | 1982-05-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1985-05-20 | 1985-11-19 | 1986-05-21 | $7700.00 | Window Closed / Lapsed |