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

Memory address permutation apparatus

Assignee: International Business Machines Corp
•
Filing: 1982-09-30
•
Granted: 1985-03-19
•
Expires: 2002-09-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Swapping of bits between different words of a memory is accomplished by a single permutation means. The single permutation means generates actual address bits for all the bit positions in a memory word. These actual address bits are in a local store. Each time a memory word is accessing the locations of the bits are substituted for logical address bits and fed to the decoders of the different bit positions in the memory word being accessed.

Inventors

  • 👤 Frederick J. Aichelmann, Jr.
  • 👤 Lawrence K. Lange

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 13:38
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/88

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 271 words
In a memory system with memory space arranged in logical data words with bit positions of any of the logical data words stored in a plurality of memory elements where the memory elements are each accessed through a different one of a plurality of decoders by an actual address of a data location in the element, new apparatus for preventing faulty data bits at the same actual address in two different memory elements from being used to store different bit positions of a given logical data word comprising: address means for providing a logical address for said given logical data word; a single address translation means for translating said logical address to all actual addresses of data bits accessed by each of said plurality of decoders, said translation means including permutation means for substituting address bits of said logical address with address bits of another logical address in the memory space in the translating of the logical address to the actual address for one of said two different memory elements so that the actual address for bit position of the logical data word stored in said one of said two different memory elements differs both from the actual address for the bit position stored in the other of said two different memory elements and from the actual address of other bit positions in said logical data word; distribution means for supplying to each of said decoders the appropriate one of said actual addresses produced by said translation means whereby the alignment of the faulty data bits in said given logical address can be eliminated without the use of spare memory elements.
Claim 2
Dependent Claim 271 words
In a memory system with memory space arranged in logical data words with bit positions of any of the logical data words stored in a plurality of memory elements where the memory elements are each accessed through a different one of a plurality of decoders by an actual address of a data location in the element, new apparatus for preventing faulty data bits at the same actual address in two different memory elements from being used to store different bit positions of a given logical data word comprising: address means for providing a logical address for said given logical data word; a single address translation means for translating said logical address to all actual addresses of data bits accessed by each of said plurality of decoders, said translation means including permutation means for substituting address bits of said logical address with address bits of another logical address in the memory space in the translating of the logical address to the actual address for one of said two different memory elements so that the actual address for bit position of the logical data word stored in said one of said two different memory elements differs both from the actual address for the bit position stored in the other of said two different memory elements and from the actual address of other bit positions in said logical data word; distribution means for supplying to each of said decoders the appropriate one of said actual addresses produced by said translation means whereby the alignment of the faulty data bits in said given logical address can be eliminated without the use of spare memory elements.
Claim 3
Dependent Claim 32 words
The memory system of claim 1 wherein said distribution means comprises time multiplexing means for providing the appropriate actual address to said decoders one decoder after the other during different time periods.
Claim 4
Dependent Claim 61 words
The memory system of claim 2 wherein said permutation means includes: associative memory means addressed by a portion of said given logical address for providing said substituted address bits in response thereto, and means for combining said changed address bits with other bits of said logical address to assemble the actual address of said one of said two different memory elements.
Claim 5
Dependent Claim 64 words
The memory of claim 1 wherein said memory elements each comprise a plurality of memory arrays, the bits of any bit position of said logical data words are arranged in a plurality of arrays and said permutation means includes means for changing the address bits for selecting a bit from one of said arrays as a bit position of said given logical data word.
Claim 6
Dependent Claim 42 words
The memory of claim 1 wherein permutation means for selecting the actual address for any bit position in said memory includes selection means for selecting actual address bits for each of said bit positions one bit position after the other in sequence.
Claim 7
Dependent Claim 15 words
The memory of claim 4 wherein said sequence proceeds in the order of bit position.

References Cited (Backward Citations)

US3644902A Cited
US3897626A Cited
US3781826A Cited
US3812336A Cited
US3983537A Cited
US4028539A Cited
US4051460A Cited
US3995261A Cited
US4335458A Cited
US4394763A Cited
US4453251A Cited
US4430727A Cited
US4450559A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-03-18 1988-09-17 1989-03-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-03-18 1992-09-17 1993-03-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-03-18 1996-09-17 1997-03-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag