US4534029A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fault alignment control system and circuits
Assignee: International Business Machines Corp
•
Filing: 1983-03-24
•
Granted: 1985-08-06
•
Expires: 2003-03-24
Abstract
Abstract This permutation circuit can be considered to be a multi-bit adder without a carry. In one embodiment it takes the form of m address bits being fed to m+y 2-way exclusive OR gates with m+y permutation bits to generate m+y input bits accessing a decoder with 2 m output positions. In another embodiment the decoder takes the form an m bit adder with which adds m address bits to m permutation bits to generate m bit actual address. Multiple decoders of both types may be joined together in various combinations to generate higher order addresses. Also, k full-adder of less than m bits can also be used in similar fashion as m+y Exor gates to provide shift rotate capability within a desired block of 2 y rows.
Inventors
- 👤 Shanker Singh
- 👤 Vijendra P. Singh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:12
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1008; G06F11/1048
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
175 words
In a memory system made up of logical data words each with its bit positions accessed by the same logical address bits through permuting means which converts the logical address to actual address bits of a data bit on the basis of permutation bits that are selected to distribute faulty data bits among the logical data words and thereby eliminate error conditions in the logical data words that are uncorrectable by the error correcting code protecting the memory system, a permuted decoder means comprising: permutation bit means for supplying n+m permutation bits to be used to permute n of said logical address bits where n and m are positive integers; permutation means for receiving said n address bits and the n+m permutation bits from said permutation bit means and for providing n+m actual address bits; and partial decoder means including gate means responsive to the true and complements of the n+m actual address bits for decoding the n+m actual address bits from said permutation means into one of no more than 2 n possible locations.
Claim 2
Dependent Claim
175 words
In a memory system made up of logical data words each with its bit positions accessed by the same logical address bits through permuting means which converts the logical address to actual address bits of a data bit on the basis of permutation bits that are selected to distribute faulty data bits among the logical data words and thereby eliminate error conditions in the logical data words that are uncorrectable by the error correcting code protecting the memory system, a permuted decoder means comprising: permutation bit means for supplying n+m permutation bits to be used to permute n of said logical address bits where n and m are positive integers; permutation means for receiving said n address bits and the n+m permutation bits from said permutation bit means and for providing n+m actual address bits; and partial decoder means including gate means responsive to the true and complements of the n+m actual address bits for decoding the n+m actual address bits from said permutation means into one of no more than 2 n possible locations.
Claim 3
Dependent Claim
59 words
The memory system of claim 1 wherein said permutation means includes n+m exclusive OR means each responsive to one of the n address bits and a different one of the n+n permutation bits for n+m actual address bits so that at least one of the n address bits is fed to more then one of the Exclusive OR means.
Claim 4
Dependent Claim
28 words
The memory system of claim 2 including full-adder means adding a set of n address bits with n permutation bits to generate the first mentioned n address bits.
Claim 5
Dependent Claim
51 words
The memory of claim 1 wherein said permutation means includes a plurality of permutation modules at least one of said modules comprising permutation element means for receiving an address bit and a+b permutation bits to provide a+b actual address bits to the decoder means where a and b are positive integers.
Claim 6
Dependent Claim
156 words
In a memory system made up of logical data words each with its bit positions accessed by the same logical address bits through permuting means which converts the logical address to actual address bits of a data bit on the basis of permutation bits that are selected to distribute faulty data bits among the logical data words and thereby eliminate error conditions in the logical data words that are uncorrectable by the error correcting code protecting the memory system, a permuted decoder means comprising: a plurality, n, of k bit full-adder means each adder means receiving k address bits and k permutation bits to generate k partial sum output bits with no carry where n and k are positive integers, a decoder means for receiving the n times k (n×k) output bits of said plurality of full-adder means and decoding said output bits to select one of of 2 n ×k outputs of said decoder means.
Claim 7
Dependent Claim
156 words
In a memory system made up of logical data words each with its bit positions accessed by the same logical address bits through permuting means which converts the logical address to actual address bits of a data bit on the basis of permutation bits that are selected to distribute faulty data bits among the logical data words and thereby eliminate error conditions in the logical data words that are uncorrectable by the error correcting code protecting the memory system, a permuted decoder means comprising: a plurality, n, of k bit full-adder means each adder means receiving k address bits and k permutation bits to generate k partial sum output bits with no carry where n and k are positive integers, a decoder means for receiving the n times k (n×k) output bits of said plurality of full-adder means and decoding said output bits to select one of of 2 n ×k outputs of said decoder means.
References Cited (Backward Citations)
US4051460A
Cited
US4047163A
Cited
US4051354A
Cited
US4191996A
Cited
US4355376A
Cited
US4441170A
Cited
US4389715A
Cited
US4450559A
Cited
US4459685A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-08-05 | 1989-02-04 | 1989-08-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-08-05 | 1993-02-04 | 1993-08-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-08-05 | 1997-02-04 | 1997-08-06 | $7700.00 | Window Closed / Lapsed |