← Back to Patent Explorer
US3299261A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiple-input memory accessing apparatus

Assignee: International Business Machines Corp
•
Filing: 1963-12-16
•
Granted: 1967-01-17
•
Expires: 1983-12-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

No abstract record available.

Inventors

  • 👤 Jr George F Steigerwalt

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 20:49
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/509; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/3001

Claims Analysis

Total Claims: 2
Claim 1
Independent Claim 430 words
MEMORY ADDRESS MODIFICATION APPARATUS COMPRISING: AN ADDRESSABLE MEMORY; A NUMBER OF MULTI-BIT WORD SOURCES, EACH SOURCE HAVING ONE OUTPUT FOR EACH BIT OF A MULTI-BIT WORD, FOR SUPPLYING OPERANDS TO BE COMBINED WITH EACH OTHER FOR THE PURPOSE OF ADDRESSING SAID MEMORY; A MATRIX OF FULL ADDERS, EACH FULL ADDER HAVING FIRST, SECOND AND THIRD INPUTS AND SUM AND CARRY OUTPUTS; SAID MATRIX COMPRISING A NUMBER OF LEVELS EQUAL TO SAID NUMBER OF MULTI-BIT WORD SOURCES MINUS ONE, EACH OF SAID LEVELS HAVING A NUMBER OF FULL ADDERS EQUAL TO THE NUMBER OF BITS IN THE LARGEST OF SAID OPERANDS; FIRST MEANS CONNECTING THE OUTPUTS OF THREE OF SAID MULTI-BIT WORD SOURCES TO THE INPUTS OF CORRESPONDING FULL ADDERS IN A FIRST LEVEL OF SAID MATRIX; SECOND MEANS CONNECTING THE OUTPUTS FROM EACH REMAINING ONE OF SAID MULTI-BIT WORD SOURCES TO THE FIRST INPUTS OF CORRESPONDING FULL ADDERS OF A DIFFERENT LEVEL OF SAID MATRIX SO THAT EACH LEVEL EXCEPT A LAST LEVEL AND SAID FIRST LEVEL OF SAID MATRIX RECEIVES THE OUTPUT FROM ONE AND ONLY ONE OF SAID SOURCES OF MULTI-BIT WORDS; THIRD MEANS CONNECTING THE SUM OUTPUT OF EACH ADDER IN EACH LEVEL EXCEPT SAID LAST LEVEL TO A SECOND INPUT OF THE CORRESPONDING ADDER IN THE SUCCEEDING LEVEL SO THAT THE SUM OUTPUT OF THE MTH ADDER IN THE NTH LEVEL IS CONNECTED TO A SECOND INPUT OF THE MTH ADDER IN THE (N+1)ST LEVEL; FOURTH MEANS CONNECTING THE CARRY OUTPUT OF EACH ADDER EXCEPT THE HIGHEST ORDER ADDER OF EACH LEVEL EXCEPT SAID LAST LEVEL TO A THIRD INPUT OF THE NEXT HIGHER ORDER ADDER IN THE SUCCEEDING LEVEL SO THAT THE CARRY OUTPUT OF THE MTH ADDER IN THE NTH LEVEL IS CONNECTED TO THE THIRD INPUT OF THE (M+1)ST ADDER IN THE (N+1)ST LEVEL; FIFTH MEANS CONNECTING THE CARRY OUTPUT OF EACH ADDER OF SAID LAST LEVEL EXCEPT THE HIGHEST ORDER ADDER OF SAID LAST LEVEL TO THE FIRST INPUT OF THE NEXT HIGHER ORDER ADDER IN SAID LAST LEVEL SO THAT THE CARRY OUTPUT OF THE MTH ADDER OF THE LAST LEVEL IS CONNECTED TO THE FIRST INPUT OF THE (M+1)ST ADDER OF THE LAST LEVEL; A SOURCE OF INCREMENTING SIGNALS; MEANS CONNECTING SAID SOURCE OF INCREMENTING SIGNALS TO THE THIRD INPUT OF THE LOWEST ORDER ADDER IN EACH LEVEL EXCEPT SAID FIRST LEVEL FOR INCREMENTING ADDRESS WORDS; AND MEANS CONNECTING THE SUM OUTPUT OF EACH ADDER IN SAID LAST LEVEL TO SAID ADDRESSABLE MEMORY FOR SUPPLYING MODIFIED ADDRESS WORDS THAT HAVE BEEN FORMED AS A FUNCTION OF SAID OPERANDS AND INCREMENTS.
Claim 2
Dependent Claim 430 words
MEMORY ADDRESS MODIFICATION APPARATUS COMPRISING: AN ADDRESSABLE MEMORY; A NUMBER OF MULTI-BIT WORD SOURCES, EACH SOURCE HAVING ONE OUTPUT FOR EACH BIT OF A MULTI-BIT WORD, FOR SUPPLYING OPERANDS TO BE COMBINED WITH EACH OTHER FOR THE PURPOSE OF ADDRESSING SAID MEMORY; A MATRIX OF FULL ADDERS, EACH FULL ADDER HAVING FIRST, SECOND AND THIRD INPUTS AND SUM AND CARRY OUTPUTS; SAID MATRIX COMPRISING A NUMBER OF LEVELS EQUAL TO SAID NUMBER OF MULTI-BIT WORD SOURCES MINUS ONE, EACH OF SAID LEVELS HAVING A NUMBER OF FULL ADDERS EQUAL TO THE NUMBER OF BITS IN THE LARGEST OF SAID OPERANDS; FIRST MEANS CONNECTING THE OUTPUTS OF THREE OF SAID MULTI-BIT WORD SOURCES TO THE INPUTS OF CORRESPONDING FULL ADDERS IN A FIRST LEVEL OF SAID MATRIX; SECOND MEANS CONNECTING THE OUTPUTS FROM EACH REMAINING ONE OF SAID MULTI-BIT WORD SOURCES TO THE FIRST INPUTS OF CORRESPONDING FULL ADDERS OF A DIFFERENT LEVEL OF SAID MATRIX SO THAT EACH LEVEL EXCEPT A LAST LEVEL AND SAID FIRST LEVEL OF SAID MATRIX RECEIVES THE OUTPUT FROM ONE AND ONLY ONE OF SAID SOURCES OF MULTI-BIT WORDS; THIRD MEANS CONNECTING THE SUM OUTPUT OF EACH ADDER IN EACH LEVEL EXCEPT SAID LAST LEVEL TO A SECOND INPUT OF THE CORRESPONDING ADDER IN THE SUCCEEDING LEVEL SO THAT THE SUM OUTPUT OF THE MTH ADDER IN THE NTH LEVEL IS CONNECTED TO A SECOND INPUT OF THE MTH ADDER IN THE (N+1)ST LEVEL; FOURTH MEANS CONNECTING THE CARRY OUTPUT OF EACH ADDER EXCEPT THE HIGHEST ORDER ADDER OF EACH LEVEL EXCEPT SAID LAST LEVEL TO A THIRD INPUT OF THE NEXT HIGHER ORDER ADDER IN THE SUCCEEDING LEVEL SO THAT THE CARRY OUTPUT OF THE MTH ADDER IN THE NTH LEVEL IS CONNECTED TO THE THIRD INPUT OF THE (M+1)ST ADDER IN THE (N+1)ST LEVEL; FIFTH MEANS CONNECTING THE CARRY OUTPUT OF EACH ADDER OF SAID LAST LEVEL EXCEPT THE HIGHEST ORDER ADDER OF SAID LAST LEVEL TO THE FIRST INPUT OF THE NEXT HIGHER ORDER ADDER IN SAID LAST LEVEL SO THAT THE CARRY OUTPUT OF THE MTH ADDER OF THE LAST LEVEL IS CONNECTED TO THE FIRST INPUT OF THE (M+1)ST ADDER OF THE LAST LEVEL; A SOURCE OF INCREMENTING SIGNALS; MEANS CONNECTING SAID SOURCE OF INCREMENTING SIGNALS TO THE THIRD INPUT OF THE LOWEST ORDER ADDER IN EACH LEVEL EXCEPT SAID FIRST LEVEL FOR INCREMENTING ADDRESS WORDS; AND MEANS CONNECTING THE SUM OUTPUT OF EACH ADDER IN SAID LAST LEVEL TO SAID ADDRESSABLE MEMORY FOR SUPPLYING MODIFIED ADDRESS WORDS THAT HAVE BEEN FORMED AS A FUNCTION OF SAID OPERANDS AND INCREMENTS.

References Cited (Backward Citations)

US2916210A Cited
US2914248A Cited
US2879001A Cited
US3098153A Cited
US3023962A Cited
US3015441A Cited
US3036773A Cited
US3015443A Cited
US3163749A Cited
US3115574A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1970-01-16 1970-07-18 1971-01-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1974-01-16 1974-07-18 1975-01-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1978-01-16 1978-07-18 1979-01-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag