Abstract:
Swapping of bits between different words of a memory is accomplished by reference to data on bad bits in the memory. This data controls address inputs to each bit in a memory word so that any word with multiple uncorrectable errors is changed to a correctable data word by placing one or more of the bad bits in the word into another word of the memory. The data is used in maintaining a list of preferred word address locations for bad bits. These preferred word locations are word addresses which contain less than a threshold level of faulty bit positions. As each faulty bit is permuted into one of these preferred word addresses, the list is updated to account for the new location of the permuted bit. Before being permuted, the actual physical memory address of a fault is used in making up the list. After permutation, the logical address of the faulty bit is used in changing the list. The process can involve categorizing of failures in accordance with type and performing algorithm operations which identify combinations of bit addresses that would result in combining the failures so that there are more errors in any memory word than would be correctable by the error correction code monitoring the memory.

Description:
BACKGROUND OF THE INVENTION 
     The present invention relates to the automatic skewing of addresses in a memory to change memory words with uncorrectable errors into memory words with errors that can be corrected by the error correction code protecting the memory. 
     Error correction and detection schemes for encoding data are known to detect more errors than they are capable of correcting. For instance, a 64 data bit word can be provided with a single error correction and a double error detection capability by using eight check bits which are stored on the same word location in memory as the 64 data bits. A failure of any single one of the 72 cells which store the data and check bits can be corrected by error correcting circuitry. This same circuitry can also be used to detect double errors existing in the word but generally will not correct these double errors. That is, if a single bit fails the particular defective bit can be identified and, therefore, corrected. However, if two bits fail the occurrence of the failure can be detected but the failing bits generally cannot be pinpointed and, therefore, cannot be corrected. 
     The term &#34;generally&#34; has been used in connection with double error correction because some of the single error correction codes do correct specific types of double errors such as errors in adjacent bit positions. However, not all double errors will occur in a correctable pattern. Therefore, to repeat what has already been said, an error correction system generally speaking will detect a greater number of errors than it has the capability of automatically correcting. 
     To take advantage of this capacity of an error correction code to detect more errors than it can correct, Beausoleil U.S. Pat. No. 3,644,902 suggests a means for changing errors that are detectable but uncorrectable into errors that are both detectable and correctable. In the Beausoleil patent, a memory unit is made up of a plurality of arrays each containing all the bits for one bit position in the memory unit. These arrays are each addressed through a decoder so that the proper bit of any word is selected from each array when the word is addressed. The Beausoleil patent suggests that, when multiple errors are to be avoided, circuitry be employed that permanently modifies the address supplied to the decoders to swap bits between words by physically wrapping the arrays and thereby change words with uncorrectable errors into words with correctable errors. 
     In Bossen et al U.S. Pat. No. 3,812,336, and in an article entitled &#34;Address Reconfiguration for Large-Scale Integrated Memory Yield Inducement&#34;, appearing on page 1245 of the September 1973 issue of the IBM Technical Disclosure Bulletin, an address modification scheme was proposed to form electronic swapping of memory bits. In this scheme the address supplied to the decoder of any particular bit array is modified by logic circuitry as a function of data stored in a shift register associated with the particular bit position of the words in the memory unit. The logic circuitry controlled by each of the registers includes an Exclusive OR gate for each of the inputs of the decoder of the particular bit position. Each of the Exclusive OR gates accepts one digit of the word address and the output of one of the stages of the linear feedback shift register and supplied its output to one of the inputs of the decoder. In the IBM Technical Disclosure Bulletin article, the decoder input address of the bad bit is placed in the shift register so that when the bad bit is requested bit location 0 is accessed instead. In the Bossen et al patent, a different Galois field number is stored in each of the shift registers starting with zero in the shift register of the first bit position and proceeding in the Galois field number sequence to the highest number needed in the shift register of the last bit position. Each time a multiple error is detected, each of the shift registers, except the shift register for the first bit position, is shifted one Galois number. This assures that the detected multiple error will be eliminated by scattering the bits making up the failing word. As a result of this scattering, each of the falling bits end up in a different word changing the uncorrectable multiple error condition into a number of correctable single error conditions. 
     Test results pointing to the location of bad bits are used in Beausoleil Pat. Nos. 3,781,826 and 3,897,626 to divide chips into groups in accordance with the location of the failing bits. In U.S. Pat. No. 3,897,626, these chips are mounted on memory cards with all chips having a defective chip in a given chip section being mounted on a corresponding section of a card. The address wiring is then used to skew the errors so that no memory word contains more than one bad bit. If a failure is detected by an ECC system, an Exclusive ORing of two sections of the address of the failing word will locate the bad or suspicious bit. 
     In U.S. patent application Ser. No. 362,925, filed Mar. 29, 1982 and entitled &#34;Deterministic Permutation Algorithm&#34;, the swapping of bits between different words of a memory is accomplished by using data on bad bits in the memory. The permutation of the bit addresses is done by an exclusionary process which identifies address combinations which result in alignment of bit failures that are uncorrectable by the error correction system of the memory and then limiting the selection process to other combinations. In the preferred embodiment, failures are categorized by type, such as chip, line or bit failure to determine uncorrectable combinations of failures. The bit addresses are then permuted in order of decreasing number of failures. 
     BRIEF DESCRIPTION OF THE INVENTION 
     In accordance with the present invention, the swapping of bad bits between different words of a memory is accomplished by a new process using data on bad bits in the memory. In the mentioned U.S. patent application, Ser. No. 362,925, the exclusionary process that selects address locations for bad bits of any bit position takes into account only the bit positions that have already had their addresses permuted. In the present arrangement, consideration is also given to data on bit failures in bit positions yet to be permuted. This is done by maintaining a list of &#34;preferred word address locations&#34; for the insertion of bad bits. A preferred word location in one which at that moment contains a less than a threshold level of faulty bit positions. As each faulty bit is permuted into one of these preferred word address locations, the list is changed to take into account the placement of the bad bit. Up until permutation, the unpermutted or actual physical address of a bad bit is used in calculating the list. After being permuted the logical memory address is used in changing the list. 
     Therefore, it is an object of the present invention to provide a scheme for swapping bits in memory words to change uncorrectable error conditions into correctable error conditions. 
     It is another object of the present invention to swap bits in memory words using fault data on bad cells in the memory. 
     An additional object of the invention is to swap bits in memory words based on known error conditions existing in the memory categorized by the type of error. 
    
    
     THE DRAWINGS 
     These and other objects of the present invention can be best understood by reference to the figures of the drawings of which: 
     FIG. 1 is a schematic of a memory employing the present invention. 
     FIGS. 2 to 6 are diagramatic representations of a set of faults in the memory of FIG. 1 prior to, during and after completion of the rearrangement process of the present invention. 
     FIG. 7 is a flow diagram for rearranging uncorrectable errors in accordance with the present invention. 
     FIGS. 8 to 15 are diagrammatic and tabular representations of a second set of faults prior to and after the rearrangement of faults in accordance with the present invention. 
     FIG. 16 is a block diagram of an error correcting system employing the present invention. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     As shown in FIG. 1, the storage cells 10 of each bit position B 1  to B 72n  of a plurality of 72 bit memory words are each arranged in separate identical cards 12 in a plurality of arrays or bit islands 14. The arrays 14 are 16 bit arrays with each bit 10 located at a different intersection of one of four word lines 18 with one of four bit lines 20. The arrays 16 are each accessed thru a different word decoder 22 and bit decoder 24 which receive identical 2 bit address signals W 0 , W 1  and B 0 , B 1  respectively. 
     In addition to a word and bit decoder associated with each array each card 12 also contains a chip decoder 26 which receives a 4 bit address C 0  &#39;, C 1  &#39;, C 2  &#39;, C 3  &#39;. The bit decoder selects the output of one of the sixteen arrays 14 on each card 12. 
     The chip address bits C 0  &#39;, C 1  &#39;, C 2  &#39; and C 3  &#39; are each the output of an Exclusive OR circuit 30 that receives one address input C 0 , C 1 , C 2  or C 3  from the address register 32 and another input Z 0 , Z 1 , Z 2  or Z 3  from a different stage of a shift register 34. Therefore, if Z 0  to Z 3  are all zero, the chip decoder 26 will access the memory bit island requested by the address register 32. With any other binary combination Z 0  to Z 3  in the shift register 34, the chip decoder 26 will access one of the other fifteen arrays. 
     To summarize then, the memory address register transmits the same six address bits C 0 , C 1 , C 2 , C 3 , W 0 , W 1 , and B 0 , B 1  to all cards 12a to 12n. In each card 12 address bits W 0 , W 1  and B 0 , B 1  access the same cell 10 in sixteen different arrays 14. The address bits C 0  &#39;, C 1  &#39;, C 2  &#39;, C 3  &#39;, select the output of one of those chips on each card to be read out as one of the bits B 1  to B 72  of the accessed word. If Z 0 , Z 1 , Z 2  and Z 3  are all zero, this will be the same bit position in the same array on all cards. If the register 34 on any card contains data other than zeros, the bit output B 1  of that card will be a bit in the same position on another array 14 of the card. 
     In accordance with the present invention, the data placed in the register 34 is selected by a new procedure on the basis of stored information on defects or faults of the chips. Rather than describing the process in general abstract terms, we will illustrate it with the help of an example in a step by step fashion. Consider the fault map of FIG. 2 showing faults existing in the first 10 bit positions of the memory of FIG. 1. For purposes of the following explanation, it will be assumed that the remaining bit positions in the memory are error free. The faulty arrays or islands 14 are labeled X. We find that from a total of sixteen island words two words contain 3 bit errors, 4 words contain 2 bit errors, 2 words contain 1 bit error and 8 words do not contain any error. Let us assume that this memory is equipped with SEC/DED capability. Since there are any 8 words W/L without errors, it is possible that bad bits from the words with 3 and 2 bit errors, can be dispersed into those errorless words. 
     Step 1. Identify all the bit sections according to their maximum error dispersion possibility (P T ); i.e., if we are successful in finding a suitable permutation vector, this is the maximum number of errors which can be dispersed. For example, if we can permute section B3 successfully, there is a potential that word lines 2 and 3 will have only single errors and word line 9 will have been left with 2 bit errors instead of 3. Therefore, section B3 has a maximum error dispersion possibility value equal to 3. Similarly, in section B6 (column B6), although there are 4 faults, with a suitable permutation vector one can disperse at the most, 3 errors. In this example, we find that sections B3, B6, B2, B5, B1, B4, B7 and B8 when permuted can potentially remove 3, 3, 2, 2, 1, 1, 1 and 1 error alignments respectively. 
     Step 2. Identify all the word addresses with zero error; i.e., word addresses 1, 4, 5, 7, 8, B, D and F. 
     Step 3. Also identify all word addresses corresponding to sections which have single error/section, i.e., word addresses 3, 6, and 9; since sections B4, B7 and B8 have only single error in word address 3, 6, and 9. These are defined as &#34;Don&#39;t care word addresses&#34; which can be gainfully used during any following iteration steps in the algorithm for finding mutually compatible permutation vectors. 
     Step 4. Choose a section with maximum error dispersion possibility. In our example, these are sections B3 and B6. Choose any one of these two sections. Let it be section B6. Identify faulty word addresses in section B6, (i.e., word addresses 6, 9, C and E). 
     Step 5. EXOR each error address in section B6 with word addresses having zero error identified in step 2 and &#34;don&#39;t care&#34; addresses identified in step 3. Choose a mutually compatible permutation vector from the vectors obtained by EXORing. If a completely compatible vector is not found, try to make use of &#34;don&#39;t care&#34; permutation vector set. 
     
         ______________________________________&#34;Don&#39;t care&#34;Error Free Words1 4 5 7 8 BDF3 6 9 ##STR1## ##STR2## ##STR3## ##STR4##______________________________________ 
    
     Suppose even &#34;don&#39;t care&#34; set does not help, then choose any permutation vector which removes the maximum number of error alignments. For example, suppose completely compatible permutation vector such as &#34;1&#34; not available, then a selection of a permutation vector from the vector set of 3, 9, B would be a suitable choice. Either of them can disperse error alignments in 2 words. 
     Here we found vector 1 which is able to disperse all 3 errors. While accomplishing this, the error free words 7, 8, D, and F now contain single bit error. Since there was only a single error in address E, this single error moves to address F leaving word E error free. Memory map after permuting addresses in section 6 is shown in FIG. 3 with updated P T  and errors in words. 
     Step 6. Now we proceed with the next section (column) with maximum error dispersion possibility (P T ) and repeat the procedure described in step 5 with the remaining error free word addresses. The reader should note that step 5 may change the value of maximum error dispersion possibility; therefore, the next section must be chosen on the basis of updated value of P T . We find it is section B3. Faulty words in section B3 are 2, 3 and 9. 
     
         ______________________________________Error Free WordsPermutation vectors                ##STR5##Permutation vectors                ##STR6##Permutation vectors                ##STR7##______________________________________ 
    
     Here we find a mutually compatible permutation vector 7, which is able to disperse 3 errors. In the process of doing so, we use error free words 4, 5, and E. The updated error map with P T  is shown in FIG. 4. 
     Step 7. Now we find that maximum error dispersion possibility P T  of each remaining sections B1, B2, B5, and B7 is 1. In this situation, it is preferable to work with sections with a minimum number of faults. Since sections B1 and B2 have 2 faults, one can choose any section. Let us choose section B2. Faulty words in section B2 are 0 and 2. Repeating once again as in step 6 with remaining error free words 1 and B we have: 
     
         ______________________________________ Error Free Word                ##STR8## Permutation Vectors                ##STR9## Permutation Vectors                ##STR10##______________________________________ 
    
     Here we take advantage of &#34;Don&#39;t care&#34; addresses to choose permutation vector 1. Although it disperses one error and at the same time adds 1 error, the new error can be dispersed by choosing section B4 with single fault which can be displaced to whatever error free word address is available. One can also choose permutation vector 3, 9, or B to provide an acceptable situation. 
     Step 8. Finally, since section B7 has only one fault and it combines with the fault in section B5 with 2 faults, section B7 is the next suitable section to work with. The selection of permutation vector is the same as for section B2 described in step 7. 
     Therefore, the complete set of permutation vectors which will disperse all the errors is as follows: 
     
         ______________________________________SECTION    PERMUTATION VECTORS______________________________________B2         1B3         7B4         1B6         1B7         D______________________________________ 
    
     The reader should note that in step 7, if we had chosen section B1 instead of section B2, then permutation vector 1 would have been found to be mutually compatible without the need for don&#39;t care addresses. The permutation vector 1 for section B1 would have permuted errors in word 0 and A to 1 and B words, thereby, leaving section B4 as it was. The final memory map is shown in FIG. 6, where all multi-bit errors have been dispersed. FIG. 7 is a flow diagram of the algorithm that has just been described. An APL program embodying the algorithm is attached to the back of the Specification. 
     The algorithm has been described in connection with a memory equipped with single error connection double error detection (SEC/DED) capability. FIG. 7 is a flow diagram for the algorithm. It can also be used to disperse errors in a memory equipped with a double error detection triple error detection (DEC/TED) capability. For DEC/TED equipped memory, one must identify error words with three or more error addresses. The address permutation is then used to disperse those errors into words with 0 or 1 errors. Permutation is done in the order determined by the highest value of updated P T  as explained earlier in this report. 
     The above description of the present illustration was done without regard to the type of fault that has occurred in the arrays 14. That is, the faults were not characterized as to whether they were bit failures, line failures or array failures. In the description of the invention in connection with FIG. 8 to the type of fault will be categorized and will be applied to a more complex memory. The memory consists of eighteen cards, each card being populated with 128, 65K bit chips. These chips are placed as 32×4 array on each card. Each card contributes four bits to each 72 bit wide memory word available to the system, thereby providing 2 million, 72-bit memory words (Base Storage Module BSM). However, from error dispersion logic implementation view point, the memory can be visualized as made up of 72 sections. Each section is equipped with its own independent address translation logic of five EX-OR gates and five latches. This logic is wired in such a fashion that the addressing bits which identify 32 chip rows can be translated according to the values of permutation bits stored earlier in the latches. 
     FIG. 8 represents the fault map for the memory. In general, the memory consists of 32×K matrix where K is the number of chip sections (columns) which contain at least (one) faulty array. In the example of FIG. 8, there are 52 sections with faulty arrays. The fault type in each section can be a complete chip kill, one or more bit line kill, one or more word line kill or one or more cell kill or the combination of bit line, word line and cell kill type faults. Whenever the occurrence of such faults in two or more sections results in the alignment, of chip faults to cause two or more bit errors per memory word can occur. The objective of address translation is to avoid such fault alignments and to provide a configuration where two or more bit faults can be avoided. Entries `0`, `1`, `2`, `3`. and `4` in FIG. 8 represents `no fault`, `chipkill`, `bit line kill`, `word line kill` and `cell kill` type faults respectively. Entries such as 5, 6, 7 and 9 represents multiple fault type situations. For example, 5 implies a chip containing a failed bit line and a word line, while 7 represents a chip containing a failed word line and a cell kill. The actual addresses of a faulty bit line, word line and cell along with the information available in the fault map such as shown in FIG. 8 is called a complete fault map. 
     The error dispersion algorithm will now be described in a step by step fashion, by using a complete fault map. The algorithm will then be applied to a partial fault map. 
     Let us assume the availability of a complete fault map, i.e., fault data such as shown in FIG. 8 and summarized in FIG. 9. Although address of every fault type in each chip is available, in FIG. 8 only addresses of faults must be further taken into account by the algorithm are tabulated in FIG. 9. This is because only these faults can potentially cause alignments due to their identical &#34;addresses&#34; or &#34;address components&#34;. FIG. 10 lists the permutation vectors which must be excluded in case the algorithm randomly select them from various available choices. For example, if algorithm chooses a vector p1 for section 14, then permutation vector (p+4) should be excluded while selecting a vector for section 28. Otherwise, the word line kill in row address 13 will align with cell kill in row address 9 after fault dispersion and thereby will cause one word to contain a two bit error. 
     FIG. 11 represents the Initial Error Summary Table which is basically extracted from FIG. 8 and FIG. 9. It consists of 32 row addresses and seven columns. First column represents the number of faults in each row address. The 2nd, 3rd, 4th and 5th columns represent the number of chip, bit line, word line and call kill faults for each row address. Column 7 indicates the number of memory words which have two or more bit errors. The circled entries represent the faults with identical address and thereby causing fault alignment. For example in row address 3, sections 20 and 28 have two chips with faulty bit lines whose addresses are identical and therefore produce 256 memory words each having two bit errors. 
     Step 1. With the help of FIGS. 8, 9 and 10 first extract the &#34;work matrix&#34;, i.e., only those sections which cause fault alignments and thus produce two or more bit error memory words. For example, in row address 17, a chip kill in section 42 aligns with chips in sections 6, 8, 41 and 71, which have (word line+cell) fail, a word line fail, bit line fail and a cell fail respectively. These fault alignments cause 772 memory words with two or more bit errors. Therefore, sections 6, 8, 41, 42 and 71 are included in the work matrix. 
     In the memory example, the word matrix is a 32×24 matrix of the following sections: 
     1, 3, 6, 8, 11, 14, 18, 19, 20, 25, 28, 29, 32, 36, 41, 42, 47, 48, 51, 54, 63, 65, 71. 
     Step 2. With the help of FIG. 10, select a set of &#34;target addresses&#34; for each fault type, where the &#34;target address&#34; is an address to which a particular fault type can be moved without causing an increase in the number of multi-bit error words. 
     In the example, the following sets of addresses make the target address set for each fault type. 
     TARGET ADDRESS SET FOR CHIP KILL 
     1st Choice 
     {Row addresses with no fault}={nil} 
     2nd Choice 
     {Row addresses with only cell kill faults or row addresses with no faults} 
     {2, 7, 12, 19, 20, 21, 26, 27, 28} 
     TARGET ADDRESS SET FOR BIT LINE KILL 
     1st Choice 
     {Row addresses with bit line kill or with bit line and cell kill} 
     {3, 4, 8, 11, 14, 15, 18, 30, 31} 
     2nd Choice 
     {Row addresses with bit line or cell kill} 
     {2, 3, 4, 7, 8, 11, 12, 14, 15, 18, 19, 20, 21, 26, 27, 28, 30, 31} 
     TARGET ADDRESS SET FOR WORD LINE KILL 
     1st Choice 
     {Row addresses with word line kill or with word line and cell kill} 
     {0, 1, 5, 10, 24, 29} 
     2nd Choice 
     {Row addresses with word line or cell kill} 
     {0, 1, 2, 5, 7, 10, 12, 19, 20, 21, 22, 24, 26, 27, 28, 29} 
     TARGET ADDRESS SET FOR CELL KILL 
     {2nd Choice target address set for bit line kill} or 
     {2nd Choice target address for set word line kill} 
     ={0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 14, 15, 18, 19, 20, 21, 22, 24, 26, 27, 28, 30, 31}. 
     In FIG. 8, there are no row addresses with zero faults and thus ideally there are no target addresses to which a chip kill can be moved. In such a situation the next best available target addresses can be the row addresses which have cell kill faults only. In the same way one would like to choose target addresses for bit line and word line kills as those addresses that already have bit line and word line fails respectively. In other words, a bit kill can be moved to row addresses containing a bit line kill and/or a cell kill only. Similarly, a word line kill can be moved to row addresses containing a word line kill or a cell fail only. This would enable to keep the target address set size approximately the same. This will be independent of the number of faults dispersed, and therefore will help to disperse more faults. 
     Step 3. For each section in the &#34;work matrix&#34; find a maximum mutually compatible permutation vector, by EXORing each fault-type address with the addresses in their respective &#34;target set&#34;. For example, for section 8 of the &#34;work matrix&#34; with cell fails in row address 5 and 10 and a word line fail in row address 17, the maximum mutually compatible permutation vector is determined as follows: 
     [Addresses in the target set for cell kill]⊕[Address of the cell kills in section 8], 
     [Addresses in the target set for word line kill]⊕[Address of word line kill in section 8.] 
     
         ______________________________________ ##STR11## ##STR12## ##STR13## ##STR14## ##STR15## ##STR16##______________________________________ 
    
     Here one can easily pick a set of permutation vectors which are not only maximum mutually compatible but rather completely (3-way) compatible. These are shown by circled entries. Any one of these will reduce the number of multiple bit error words. Therefore, algorithm picks one in a random fashion. A maximum mutually compatible permutation vector is not necessarily completely compatible, however a completely compatible permutation vector is always maximum mutually compatible. For example, suppose a completely compatible vector could not be found for section 8, the algorithm will search for a two-way compatibility. In such a situation, if there is more than one choice available, the algorithm will pick that permutation vector from the choice set which decreases the number of multi-bit error words to minimum. As the algorithm continues to operate from section to section, the target address sets are continuously updated. Once a fault pair is realigned, the algorithm automatically skips the 2nd section in the pair. These characteristics of the algorithm make it highly convergent. 
     FIG. 12 and FIG. 13 show the final memory fault map and its corresponding error summary table after fault dispersion. The error column in FIG. 13 indicates 0s in every row address, implying that all the faults which caused two or more bit error memory words have been dispersed. 
     For the sake of completeness, it is worthwhile to describe a general approach for fault dispersion with the availability of a partial fault map only. The nature of the fault map may vary with the amount of information available about the fault types and their respective addresses within individual chips. For example, a fault map may only identify chip kill, line kill and cell kill, i.e. it does not provide any information if the line killed is a word line or bit line. On the other hand, a second fault map may identify chip kill, bit line kill, word line kill and cell kill type faults, but not the location of failed bit line, word line or cell within a chip. It is obvious that it will be less tedious and less time consuming to work with the second map, however, the general approach of using these maps must be the same. 
     The general approach has been to start with the available fault information and disperse all possible faults, as if all the bit line, word line and cell faults have different addresses within the individual chips. In other words, any two bit lines and cells can be bunched in any of the permutable row addresses. Similarly, any two word lines and cells can be bunched in any of the permutable row addresses. This is followed by reconfiguring the memory according to the values of permutation vector and testing for two or more bit error words. The addresses of the faulty words and the location of faulty bit within the words in the reconfigured memory provide the information about some of the fault types and their addresses not available earlier. With this new information, the fault map is updated and once again a new set of permutation vectors are found. Once again the memory is reconfigured and tested. This procedure is repeated until no multiple bit error words are found or the number of multi-bit error words cannot be further reduced. 
     The algorithm assumes the availability of fault map and its corresponding error summary of FIG. 9 and FIG. 11 respectively. The only difference is that the information provided in FIG. 10 and hence the list of permutation vectors to be excluded from the selection is not available to the algorithm. Based on this partial information and assuming that all bit line and word line and cell kill addresses are unique, the algorithm calculates a list of permutation vectors which must disperse all the faults to a new reconfigured memory map of FIG. 14 and its associated summary table of FIG. 15. These permutation vectors with their respective sections are listed as follows: 
     
         ______________________________________ Sections Permutation Vectors     ##STR17##          1, 6, 8,11,13,14,17, 18,21,25,28,29,32, 36,42,48,51,56         7,20,20, 7, 7, 916102317 72920 311271227______________________________________ 
    
     The reconfigured memory map of FIG. 14 when tested is found to contain one, two bit error words resulting from an alignment in row address 22 due to a cell kill in section 14 and a word line kill in section 48. The alignment resulted due to a common address component to a cell kill and word line kill. Therefore, permutation vector 9 and 27 for section 14 and 48 are not mutually acceptable. In this example, the algorithm finds another permutation vector 21 for section 48. The error summary table of FIG. 13 is used by the algorithm to disperse faults indicates there are zero UE&#39;s. This is because the table does not have cell and word addresses. This memory reconfiguration does not have any two bit or multi-bit errors in any of its memory words. 
     Although the step by step description of the method may give the appearance that the algorithm must proceed sequentially column by column in determining permutation vectors is not always necessary. Many sections can be simultaneously handled if they do not have chip kill faults and 1st choice &#34;target addresses&#34; sets for bit line, word line, and cell fails can meet maximum compatibility criterion. The other sections which either have chip kill or needs second choice &#34;address target sets&#34; and thus require an update on target address sets must require sequential operation. Such an approach can speed up algorithm execution up to 40% over a complete sequential operation. 
     In FIG. 16 a memory 40 such as that shown in FIG. 1 is checked by conventional error correction apparatus 42. The occurrence of an uncorrectable error (UE) signal from the apparatus initiates testing of the memory array be tester 44. The tester is a device for application test patterns to the memory location containing the UE. For instance, the tester could apply a pattern of all 1&#39;s followed by a pattern of all zeros to the flawed memory location to determine bits stuck at 0 or 1 respectively. When the faulty bits have been identified, their address is stored in memory in a fault map in the manner described in the present application or an other mapping suitable for the purpose. Generation of a fult map is described in U.S. patent application Ser. No. 345,944, filed Dec. 18, 1981, and entitled &#34;Apparatus for High Speed Fault Mapping of Large Memories&#34;. 
     The UE condition also initiates operation of the permutation generation logic 48 to change data in the registers 34 of the memory to eliminate the UE condition. In accordance with the present invention, the permutation generator is a microcoded processor 48 capable of executing the algorithm set forth above. 
     The output of the permutation generator is the CR values for the various bit positions of the memory so these CR values are fed into the latches 34. The latches can be stages of an LSSD shift register. So the data could be shifted along the LSSD chain into the proper stages. 
     Two embodiments with a number of modifications have been described. Therefore it should be understood that many modifications and changes can be made in the illustrated embodiments without departing from the spirit and scope of the invention as represented in the attached claims. ##SPC1## 26