Over-voltage write operation of tunnel magnet-resistance (“TMR”) memory device and correcting failure bits therefrom by using on-the-fly bit failure detection and bit redundancy remapping techniques

Information

  • Patent Grant
  • 10656994
  • Patent Number
    10,656,994
  • Date Filed
    Wednesday, December 27, 2017
    7 years ago
  • Date Issued
    Tuesday, May 19, 2020
    4 years ago
Abstract
A method for correcting bit defects in an STT-MRAM memory is disclosed. The method includes reading a codeword in the STT-MRAM memory, wherein the STT-MRAM memory includes a plurality of codewords, wherein each codeword includes a plurality of redundant bits. Further, the method includes mapping defective bits in the codeword to redundant bits of the plurality of redundant bits based on a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits in the codeword are to be mapped to the redundant bits. Finally, the method includes replacing the defective bits in the codeword with corresponding mapped redundant bits.
Description
FIELD

The present patent document relates generally to random access memory (RAM). More particularly, the present patent document relates to failure detection and correction operations in magnetoresistive random-access-memory (“MRAM”). The methods and devices described herein are particularly useful in spin-transfer torque magnetic memory (STT-MRAM) devices.


BACKGROUND

Magnetoresistive random-access memory (“MRAM”) is a non-volatile memory technology that stores data through magnetic storage elements. These elements are two ferromagnetic plates or electrodes that can hold a magnetic field and are separated by a non-magnetic material, such as a non-magnetic metal or insulator. This structure is known as a magnetic tunnel junction (“MTJ”). FIG. 1 illustrates an exemplary MRAM cell 110 comprising a MTJ 120. In general, one of the plates has its magnetization pinned (i.e., a “reference layer” or “fixed layer” 130), meaning that this layer has a higher coercivity than the other layer and requires a larger magnetic field or spin-polarized current to change the orientation of its magnetization. The second plate is typically referred to as the free layer 140 and its magnetization direction can be changed by a smaller magnetic field or spin-polarized current relative to the reference layer.


MRAM devices can store information by changing the orientation of the magnetization of the free layer. In particular, based on whether the free layer is in a parallel or anti-parallel alignment relative to the reference layer, either a “1” or a “0” can be stored in each MRAM cell as shown in FIG. 1. Due to the spin-polarized electron tunneling effect, the electrical resistance of the cell change due to the orientation of the magnetic fields of the two layers. The electrical resistance is typically referred to as tunnel magnetoresistance (TMR) which is a magnetoresistive effect that occurs in a MTJ. The cell's resistance will be different for the parallel and anti-parallel states and thus the cell's resistance can be used to distinguish between a “1” and a “0”. One important feature of MRAM devices is that they are non-volatile memory devices, since they maintain the information even when the power is off. The two plates can be sub-micron in lateral size and the magnetization direction can still be stable with respect to thermal fluctuations.


MRAM devices are considered as the next generation structures for a wide range of memory applications. MRAM products based on spin torque transfer switching are already making its way into large data storage devices. Spin transfer torque magnetic random access memory (“STT-MRAM”), such as the one illustrated in FIG. 1, or spin transfer switching, uses spin-aligned (“polarized”) electrons to change the magnetization orientation of the free layer in the magnetic tunnel junction. In general, electrons possess a spin, a quantized number of angular momentum intrinsic to the electron. An electrical current is generally unpolarized, e.g., it consists of 50% spin up and 50% spin down electrons. Passing a current though a magnetic layer polarizes electrons with the spin orientation corresponding to the magnetization direction of the magnetic layer (e.g., polarizer), thus produces a spin-polarized current. If a spin-polarized current is passed to the magnetic region of a free layer in the magnetic tunnel junction device, the electrons will transfer a portion of their spin-angular momentum to the magnetization layer to produce a torque on the magnetization of the free layer. Thus, this spin transfer torque can switch the magnetization of the free layer, which, in effect, writes either a “1” or a “0” based on whether the free layer is in the parallel or anti-parallel states relative to the reference layer.


Spin transfer torque magnetic random access memory (“STT-MRAM”) has an inherently stochastic write mechanism, wherein bits have certain probability of write failure on any given write cycle. The write failures are most generally random, and have a characteristic failure rate. A high write error rate (WER) may make the memory unreliable. The error rate can typically increase with age and increased use of the memory. Bit-errors can result in system crashes, but even if a bit-error does not result in a system crash, it may cause severe problems because the error can linger in the system causing incorrect calculations and multiply itself into further data. This is problematic especially in certain applications, e.g., financial, medical, automotive, etc. and is generally commercially unacceptable. The corrupted data can also propagate to storage media and grow to an extent that is difficult to diagnose and recover.


Accordingly servers and other high reliability environments have conventionally integrated Error Correcting Code (ECC) into their memory subsystems to protect against the damage caused by such errors. ECC is typically used to enhance data integrity in error-prone or high-reliability systems. Workstations and computer server platforms have buoyed their data integrity for decades by adding additional ECC channels to their data buses.


Typically ECC adds a checksum stored with the data that enables detection and/or correction of bit failures. This error correction can be implemented, for example, by widening the data-bus of the processor from 64 bits to 72 bits to accommodate an 8-bit checksum with every 64-bit word. The memory controller will typically be equipped with logic to generate ECC checksums and to verify and correct data read from the memory by using these checksums. In conventional memories using STT-MRAM error correction an error correcting code (ECC), e.g., BCH (Bose-Chaudhuri-Hocquenghem) is used to correct errors.


While conventional error correction, e.g., ECC are effective, they have certain drawbacks. For example, the error correction using ECC is not performed in real-time. In other words, the ECC correction may be performed during a read operation, but the error is not corrected as the data is written into the STT-MRAM memory cell.


Further, other conventional error correction schemes may require considerable overhead because the addresses/locations of all the bad bits in the memory chip need to be stored prior to performing the correction. The Content Addressable Memories (CAMs) required to store such addresses and locations occupy significant surface area and are expensive because of the high overhead involved in saving the bit addresses/locations for all the failing bits. Storing each address of a defective bit in a CAM also acts as a limit on the number of addresses that can potentially be stored. Further, storing addresses of bad bits and then replacing them with good bits is also not an optimal scheme for STT-MRAM memories because the defect rate is typically high and too much memory would be required to store the addresses of all the bad bits. Also, this error mitigation scheme does not work for defects that are discovered on-the-fly (e.g. replacing the bad bits with good bits may have only happened at the tester phase in manufacturing).


Further, typically, error schemes like ECC can detect and correct errors during a read operation, but it does not write the data back into the memory array. This behavior causes the error to stay resident inside the memory array across multiple accesses and may contribute to a memory failure at a later time when additional errors occur. For example, if the memory is used for longer periods of time, there is an increased probability of a second failure occurring in the same ‘word’ as a first failure. The first failure may lie silently for years as the internal ECC logic repairs the error every time the word is read. When a second (or third or fourth . . . ) error hits the same word, the internal ECC circuitry is unable to repair the word and corrupted read data is provided to the system.


Additionally, ECC is not efficient for correcting high fixed defect rates. This is particularly problematic for memories comprising STT-MRAM that typically have higher failure rates as compared to other memories. FIG. 2 illustrates the number of codewords with less than 1 bit ECC left reserved as a function of the defect rate. As seen in FIG. 2, for a 1% defect rate, using a BCH-3 ECC scheme, over a 100 words need repair. Conventionally, ECC is appropriate for applications where the defect rates are approximately 50 parts per million (ppm) or less. For memories with higher defect rates ECC and other error correction schemes become problematic. Accordingly, in memory applications comprising STT-MRAM where defect rates are higher, using only conventional error mitigation schemes like ECC results in inefficiencies.


BRIEF SUMMARY OF THE INVENTION

Accordingly, a need exists for a system and method that provides real-time detection and correction of STT-MRAM memory cells and that does not require storing any defective bit locations. In one embodiment, the present invention provides an effective method of replacing bit defects using redundant bits added to each codeword of the memory without incurring a large overhead to peripheral circuits. Rather than storing a map of the locations of the bad bits, embodiments utilize an algorithm to map bad bits of a particular codeword to the associated redundancy bits allocated to the codeword.


In one embodiment, the present invention comprises a memory wherein multiple redundant bits are added to each codeword of the memory. In other words, each codeword of the memory comprises multiple redundant bits, e.g., 4, 6, 8 or more redundant bits per word. Prior to performing a write operation during memory usage, a codeword is read and any shorted (short-circuited) or open (open-circuited) bits in the codeword are mapped out on-the-fly. Any shorted or open bits in the codeword that are defective are replaced with one of the redundant bits in accordance with a mapping algorithm. The write operation is then executed with the redundant bits used in place of the defective bits. In other words, instead of using the defective bits, the correct data is written into one of the redundant bits for that codeword. In this way, the defects are detected and corrected in real-time using embodiments of the present invention.


In one embodiment, the redundant bits are also used to correct defective bits when performing a read operation. During a read operation, a codeword is simultaneously read and any shorted or open bits in the word are on-the-fly mapped out. The defective bits in the word are replaced using the redundant bits using the same mapping scheme or algorithm that was used in the prior write operation. It is appreciated that once the defective bits are replaced in accordance with the above technique, ECC algorithms can still be applied to the resultant word to detect and correct for transient bit errors that may exist in the data word in accordance with embodiments of the present invention.


In one embodiment, a method for correcting bit defects in a STT-MRAM memory is disclosed. The method comprises executing a read before write operation in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a plurality of redundant bits. The read before write operation comprises reading a codeword and on-the-fly mapping defective bits in the codeword. Further, the method comprises replacing the one or more defective bits in the codeword with a corresponding one or more redundant bits and executing a write operation with corresponding redundant bits in place of the defective bits. The selection of the redundant bits to use in place of the defective bits in the codeword is performed in accordance with a defect bit mapping scheme.


In another embodiment, a method for correcting bit defects in a STT-MRAM memory is discussed. The method comprises executing a read operation in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a plurality of redundant bits, and wherein the read operation comprises: (a) reading a codeword; and (b) mapping defective bits in the codeword. Further, the method comprises replacing the one or more defective bits in the codeword with a corresponding one or more redundant bits, wherein the defective bits are replaced with the redundant bits based on relative positions of the defective bits in accordance with a mapping scheme.


In a different embodiment, an apparatus for correcting bit defects in a STT-MRAM memory is disclosed. The apparatus comprises a controller and an STT-MRAM memory comprising a plurality of codewords, wherein each codeword comprises a plurality of redundant bits, and wherein the controller is configured to perform a write operation, wherein the write operation comprises executing a read before write operation in the STT-MRAM memory. The read before write operation comprises: (a) reading a codeword; and (b) mapping on-the-fly defective bits in the codeword to redundant bits allocated to the codewords. Further, the write operation comprises replacing the one or more defective bits in the codeword with a corresponding one or more redundant bits and executing a write operation with corresponding redundant bits in place of the defective bits.


Embodiments of the present invention include any of the above described embodiments in combination with performing ECC error correction on the read data word to defect and correct for transient errors therein.


In one embodiment, a method for correcting bit defects in an STT-MRAM memory is disclosed. The method comprises reading a codeword in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a plurality of bits and a plurality of redundant bits. The method also comprises mapping defective bits in the plurality of bits of the codeword to redundant bits of the plurality of redundant bits based on a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits in the codeword are to be mapped to the redundant bits. Further, based on the mapping, the method comprises using mapped redundant bits in lieu of the defective bits in the codeword.


In another embodiment, a method for correcting bit defects in an STT-MRAM memory is disclosed. The method comprises reading a codeword in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a respective plurality of bits and a respective plurality of redundant bits. Further, the method comprises mapping each defective bit in the codeword to a respective redundant bit of the plurality of redundant bits in accordance with a mapping scheme, wherein the mapping scheme is operable to determine a manner in which defective bits of the codeword are to be mapped to redundant bits of the codeword. The method also comprises replacing the defective bits of the codeword with redundant bits of the plurality of redundant bits, wherein the defective bits are replaced with the redundant bits based on relative positions of the defective bits in accordance with the mapping scheme.


In another embodiment, an apparatus for correcting bit defects in an STT-MRAM memory is disclosed. The apparatus comprises a processor and an STT-MRAM memory comprising a plurality of codewords, wherein each codeword comprises a respective plurality of bits and a respective plurality of redundant bits. The processor is configured to read a codeword in the STT-MRAM memory and map defective bits in the codeword to redundant bits of the plurality of redundant bits based on a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits in the codeword are to be mapped to the redundant bits. Further, the processor is configured to replace the defective bits in the codeword with corresponding redundant bits as mapped.


The following detailed description together with the accompanying drawings will provide a better understanding of the nature and advantages of the present invention.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements.



FIG. 1 illustrates an exemplary MRAM cell comprising a magnetic-tunnel-junction.



FIG. 2 illustrates the number of codewords with less than 1 bit ECC left reserved as a function of the defect rate.



FIG. 3 illustrates the manner in which redundant bits are mapped to defective bits in accordance with an embodiment of the present invention.



FIG. 4 graphically illustrates the distribution of the resistance states across an STT-MRAM chip array.



FIG. 5 illustrates the behavior of the defect rate in a memory chip as more redundant bits per word are added in accordance with an embodiment of the present invention.



FIG. 6 illustrates the manner in which a malfunction can occur if a bit shorts during a read operation in accordance with an embodiment of the present invention.



FIG. 7A graphically illustrates the manner in which the distribution of the resistance states across an STT-MRAM chip array wherein there is overlap between the high and low resistance states.



FIG. 7B graphically illustrates the manner in which the distribution of the resistance states across an STT-MRAM chip array changes by shorting marginal TMR bits or by reducing TMR requirements for the sense amplifiers in accordance with embodiments of the present invention.



FIG. 8A shows a flowchart of an exemplary method for correcting bit defects in a STT-MRAM memory array during a write operation in accordance with embodiments of the present invention.



FIG. 8B shows a flowchart of an exemplary method for correcting bit defects in a STT-MRAM memory array during a read operation in accordance with embodiments of the present invention.



FIG. 9 illustrates an apparatus for correcting bit defects in a STT-MRAM memory array in accordance with embodiments of the present invention.



FIG. 10 shows a flowchart 1010 of an exemplary method for correcting bit defects in a STT-MRAM memory array in accordance with embodiments of the present invention.



FIG. 11 shows a flowchart 1110 of another exemplary method for correcting bit defects in a STT-MRAM memory array in accordance with embodiments of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the various embodiments of the present disclosure, examples of which are illustrated in the accompanying drawings. While described in conjunction with these embodiments, it will be understood that they are not intended to limit the disclosure to these embodiments. On the contrary, the disclosure is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the disclosure as defined by the appended claims. Furthermore, in the following detailed description of the present disclosure, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. However, it will be understood that the present disclosure may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to unnecessarily obscure aspects of the present disclosure.


Some portions of the detailed descriptions that follow are presented in terms of procedures, logic blocks, processing, and other symbolic representations of operations on data bits within a computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. In the present application, a procedure, logic block, process, or the like, is conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those utilizing physical manipulations of physical quantities. Usually, although not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as transactions, bits, values, elements, symbols, characters, samples, pixels, or the like.


Over-Voltage Write Operation of TMR Memory Device and Correcting Failure Bits Therefrom by Using On-the-Fly Bit Failure Detection and Bit Redundancy Remapping Techniques

Embodiments of the present invention provide real-time detection and correction of MRAM memory cells, and in particular, STT-MRAM cells. In one embodiment, the present invention provides an effective method of replacing defects using redundant bits added to each codeword of the memory without incurring a large overhead to peripheral circuits.


As used herein, the term “data word” shall apply to the informational bits that are to be written to a memory cell or read from a memory cell. The term “codeword” shall apply to the memory storage elements that store the data word. The term “redundant bits” shall apply to additional memory storage elements that each codeword is supplemented with to store the correct state for defective bits within the associated codeword.


As explained above, conventional methods of error correction have shortcomings that make them less efficient especially when addressing higher error rates for STT-MRAM. For example, the error correction may not be performed in real time. Further, the error correction scheme may be able to detect and correct errors during a read operation, but it does not write the correct data back into the memory array. This behavior causes the error to stay resident inside the memory array across multiple accesses and may contribute to a memory failure at a later time when additional errors occur.


Additionally, conventional error correction schemes are not efficient for correcting high fixed defect rates. This is particularly problematic for memories comprising STT-MRAM that typically have higher failure rates as compared to other memories. One reason conventional schemes are inefficient for correcting high defect rates is because of the high overhead required to store addresses of all the defective bit locations. Accordingly, as described above, conventional defective bit mapping and replacement schemes consume a significant amount of space, power and speed. With the defect rates of STT-MRAM, the overhead associated with storing addresses for all the defective bit locations would be prohibitively high.


In order to address the shortcomings of conventional error correction schemes, embodiments of the present invention comprise a memory wherein multiple redundant bits are added to each codeword of the memory. In other words, each codeword of the memory comprises multiple redundant bits, e.g., 4, 6, 8 or more redundant bits per word.



FIG. 3 illustrates the manner in which redundant bits are mapped to defective bits in accordance with an embodiment of the present invention. FIG. 3 illustrates an exemplary word 300 that comprises 4 defective bits, namely, bit 330 (short circuit), bit 331 (short circuit), bit 332 (open circuit) and bit 333 (short circuit). Note that embodiments of the present invention are particularly suited for correcting defects related to open circuits (“opens”) and short circuits (“shorts”), e.g., defective bits. For example, short circuited bits are a common occurrence in MRAMs and, accordingly, embodiments of the present invention provide an effective way for curing bit defects related to short circuits. Codeword 300 also comprises 4 redundant bits, R1, R2, R3 and R4 associated with codeword 300. Typically, each codeword in the memory will comprise the same number of additional redundant bits.


Prior to performing a write operation to a codeword, embodiments of the present invention would first read the codeword on which the write operation is to be performed. For example, the reading may be in accordance with a read-before-write (RBW) operation. Accordingly, codeword 300 is read and the shorted (short-circuited) or open (open-circuited) bits in the codeword are mapped out. In other words, the read operation maps out the locations of the defective bits 330, 331, 332 and 333 on-the-fly. Note that the mapping of the defective bits is conducted simultaneously with the read operation. In one embodiment, the mapping may be performed substantially simultaneously with the read operation, e.g., in the same cycle with a slight delay or in a subsequent cycle.


The defective bits can be identified by their resistance which is detected by sense amplifiers used during the read. The codeword is read and the mapping of the defective bits is done simultaneously to avoid paying a time penalty. Further, note that performing a read before the write is advantageous because the read cycle can be used to determine which bits need to change when performing the write. Accordingly, a power savings can also result from only writing the bits in a codeword that need to change. In other words, during the write cycle, only the bits that need to change will be flipped.


Note that in rare instances it may not be efficient to perform a read prior to a write. In such cases, the mapping scheme that was determined in a prior read cycle may, in one embodiment, be used to perform the write operation (without conducting an immediately preceding read), e.g., where the last read was performed for the same location prior to attempting a write operation.


In one embodiment, a verify operation is performed after the write to ensure that no endurance fails happened during the write. If an endurance failure, e.g., a bit shorting during the write operation, etc. occurs during the write operation, it will trigger a failure during the verify operation. In other words, it will signal that the write operation failed.


The shorted or open bits in the codeword, namely bits 330-333, are subsequently replaced with one of the redundant bits in accordance with a mapping scheme 375. In other words, the defective bits are swapped out with the redundant bits. In one embodiment, a multiplexer network is used to perform this swapping operation. In one embodiment, one multiplexer network per bank of sense amplifiers would be required to implement this scheme.


In one embodiment, in the mapping scheme 375, the redundant bits are mapped to the defective bits on the basis of relative positions of the defect. In other words, the first redundant bit (the left-most bit R1 in FIG. 3) gets mapped to the earliest defective bit in codeword 300 (bit 330 in FIG. 3). The second redundant bit R2 will get mapped to the second defective bit in codeword 300 (bit 331). Similarly, redundant bit R3 gets mapped to bit 332 while redundant bit R4 gets mapped to bit 333. Another relatively simple mapping scheme would map the redundant bits to the defective bit in a right to left orientation. For example, bit R4 would be mapped to shorted bit 330, bit R3 would be mapped to shorted bit 331, bit R2 would be mapped to open bit 332 and bit R1 will be mapped to shorted bit 333. Because of the relative simplicity of these mapping schemes, they do not require storing any complex algorithms within the memory chip. Note, however, that some logic in the memory chip may need to be dedicated to implement even a simple mapping scheme.


In other embodiments, other replacement schemes or algorithms for mapping redundant bits to the defective bits can also be used to improve efficiency. Such schemes would be more complex than simply mapping bits on the basis of relative positions of the defects and may require programming and storing a corresponding algorithm into the memory chip. In some embodiments, however, the replacement scheme may be simpler schemes that can be implemented with additional logic.


Subsequently, the write operation is then executed with the redundant bits used in place of the defective bits to receive the write data. In other words, instead of using the defective bits, the correct data is written into one of the redundant bits for that codeword. Further, in order to save power, the write is disabled for the defective bits. In other words, the write operation does not attempt to write to the defective bits. In this way, the defects are advantageously detected and corrected in real-time using embodiments of the present invention. The local bit redundancy scheme advantageously replaces defects at the bit level in real-time without incurring a large overhead in peripheral circuits. Unlike prior error correction schemes that incurred a significant overhead as a result of needing to store defective bit addresses to correct at a later time, embodiments of the present invention advantageously correct bit defects in memory without the need for storing any defective bit addressees. Further, unlike prior error mitigation schemes that would perform detection and correction procedures during the testing process prior to shipping, embodiments of the present invention perform detection and correction of errors in real-time (or in situ).


In one embodiment, the RBW operation is performed simultaneously or partially simultaneously with the write operation in order to decrease the overall length of the write operation.


Embodiments of the present invention also advantageously mitigate errors in the memory chip over the lifetime of the chip. In other words, the error correction scheme is not merely limited to a particular duration of time, e.g., during testing of the chip. If a bit in the memory fails after the chip has already shipped and is in use by an end user, the error mitigation scheme will detect the defective bit during a pre-read for a write operation (or a verify operation) and replace the defective bit in the word with a redundant bit. In other words, the error correction scheme of the present invention can detect defective bits on-the-fly over the lifetime of the chip and replace the defective bits with redundant bits (provided there are redundant bits remaining). Note, that it is not uncommon for bits to be shorted out over the lifetime of an MRAM chip. Accordingly, it is advantageous to have an error correction scheme that accommodates defects that develop over time in a chip. If a newly discovered defective bit is present, then the mapping scheme will remap the redundant bits to the defective bits in accordance with the mapping scheme.


By comparison, conventional redundancy schemes store information regarding the locations of the defective bits in CAMs and find and replace the defective portions of the memory only during the testing process. Embodiments of the present invention perform correction over the lifetime of the chip without storing any such locations/addresses of the defective bits. Further, the correction of the present embodiment is performed on-the-fly at read and write speeds. Replacing defective bits over the lifetime of the chip with functional redundant bits also increases the lifetime of the chip. For example, if a bit is shorted after the memory chip has already been shipped, it will simply be replaced by a heretofore unused redundant bit. Accordingly, the lifetime of the chip is increased because a new redundant bit replaces an older bit which became defective during use.


In one embodiment, the redundant bits are also used to correct defective bits when performing a read operation in accordance with a mapping scheme. During a read operation, a codeword is simultaneously read and any shorted or open bits in the word are mapped out based on their resistance. The defective bits in the word are replaced using the redundant bits using the same mapping scheme that was used in the prior write operation in order to determine the data word to be read out. Note that in order to speed up the read operation, both the codeword is simultaneously read and any mapping of shorted and open bits is performed at the same time. If speed is not a consideration, then, in one embodiment, the reading of the codewords and the mapping of the defective bits can be separate operations.


In one embodiment, if a codeword uses up its allocation of redundant bits, it may borrow redundant bits from neighboring words. For example, if 4 redundant bits are allocated per codeword and if a word has more than 4 defective bits, in one embodiment, it may be possible for the codeword to borrow vacant redundant bits from neighboring codewords. This may be possible, for example, if multiple words can be read simultaneously (or in the same cycle). In such cases, redundant bits may be borrowed from other words that are read in the same cycle.



FIG. 4 graphically illustrates the distribution of the resistance states across an STT-MRAM chip array. This is a resistance distribution. As discussed above, MRAM devices store information by changing the orientation of the magnetization of the free layer. In particular, based on whether the free layer is in a parallel or anti-parallel alignment relative to the reference layer, either a “1” or a “0” can be stored in each MRAM cell as shown in FIG. 1. Due to the spin-polarized electron tunneling effect, the electrical resistance of the cell change due to the orientation of the magnetic fields of the two layers. The cell's resistance will be different for the parallel and anti-parallel states and thus the cell's resistance can be used to distinguish between a “1” and a “0”. Typically, if the free layer is in parallel alignment relative to the reference layer (low resistance state, Rlow 535), this is considered to mean “1” while if alignment is anti-parallel the resistance will be higher (high resistance state, R-high 540) and this means “0.”


As seen in FIG. 4, memory cells in the STT-MRAM chip array be distributed so that the cells can typically have one of four resistance states: R-high 540, R-low 535, R-open 545 or R-short 530. Defective bits that are short-circuited (and correspond to R-short 530) or open-circuited (and correspond to R-open 545) can be identified because their resistance will either be significantly lower (in the case of R-short) or higher (in the case of R-open) than the typical resistances of the R-low and R-high states respectively.


In one embodiment, in order for the additional states R-open and R-short to be identified during a typical STT-MRAM read operation, additional sense amplifiers are incorporated into the memory chip to perform the resistance measurements. A sense amplifier is one of the elements which make up the circuitry on a memory chip and are well known. A sense amplifier is part of the read circuitry that is used when data is read from the memory; its role is to sense the low power signals from a bit-line that represents a data bit (1 or 0) stored in a memory cell, and amplify the small voltage swing to recognizable logic levels so the data can be interpreted properly by logic outside the memory.


Conventionally, there is one sense amplifier for each column of memory cells, so there are usually hundreds or thousands of identical sense amplifiers on a modern memory chip. However, in conventional memories, the sense amplifiers may only have a single sense reference. In other words, the sense amplifiers in conventional memories may only be able to distinguish between a “1” and a “0”.


Embodiments of the present invention, however, require sensing of additional states (namely R-open and R-short) and, therefore, may require additional sense amplifiers for each column of memory cells so that during a read operation, all four states can be distinguished from each other. As discussed in connection with FIG. 3, a read operation needs to read the bits in the codeword and map out all the defective bits within the codeword. In order for the read operation to distinguish between the four potential states (namely, a “1”, a “0”, a short circuit and an open circuit), additional sense amplifiers are incorporated in the circuitry for the memory chip. Accordingly, with the additional sense amplifiers, multiple sense points, e.g., sense points 432, 431 and 433 may be detected. To detect the additional sense points, embodiments of the present invention may, for example, require two different extra sense amplifiers per bit (or per column, depending on the structure of the memory). Note that sense point or sense reference 431 can be determined using a simple calculation: ((R-high+R-low)/2).


The various reference points (e.g., 431, 432 and 433) can be set simultaneously so that during a read cycle, the different states can be mapped out at the same time. Alternatively, if time is not a constraint, the different reference points can be set serially so that the detection of the various states is done serially.



FIG. 5 illustrates the behavior of the defect rate in a memory chip as more redundant bits per word are added in accordance with an embodiment of the present invention. In FIG. 5, “F” represents the number of redundant bits added per code word. As seen in FIG. 5, when F=4 (each code word has 4 redundant bits), the defect rate falls lower than 10−10. With additional redundant bits, e.g., 6 bits, the defect rate falls lower than 10−15 but there will be a trade-off between a low defect rate and efficiency with increasing number of redundant bits because processing a higher number of redundant bits takes longer.


In one embodiment, the redundant bits of the present invention can be combined with other error mitigation schemes to further reduce defect rates. For example, a hybrid scheme may utilize both redundant bits and BCH2 or BCH3 error correction. For example BCH2 can be combined with redundant bits so that each word in the memory comprises 32 data-bits, 12 parity bits for BCH2 and 6 redundant bits. Bit redundancy is used to correct any word that has a defect in it. BCH2 error correction is then used to correct data words which are not completely cleaned up by bit redundancy. The hybrid schemes are also effective because using an ECC scheme, e.g., BCH2, BCH3, Reed Solomon, Hamming code and Low Density Parity Check (LDPC), etc. in conjunction with redundant bits may be able to correct for errors, e.g., write errors, data retention failures, transient errors, etc. that cannot be cleaned up using only redundant bits. Accordingly, while redundant bits may be effective at correcting for hard defects within a codeword, the error correction process can be supplemented with an ECC scheme to correct for other types of errors, e.g., transient errors that are not caused by hard defects. The ECC scheme will typically be applied to a data word after the redundant bit replacement scheme has already been implemented to replace bit defects in the corresponding codeword with corresponding redundant bits. Further, instead of using an expensive type of ECC, e.g., a 4-bit ECC exclusively to correct for errors, embodiments of the present invention supplement the redundant bit scheme with a less expensive type of ECC, e.g., a 2-bit to achieve the same or better results than a prohibitively expensive ECC. In other words, combining the inclusion of redundant bits with other redundancy schemes (e.g., ECC) results in power, time and space savings because less complex redundancy schemes need to be employed.


A typical STT-MRAM may contain certain memory cells that may not clearly fall within any of the states illustrated in FIG. 4. In other words, the resistance of certain STT-MRAM cells may be ambiguous preventing them from being easily classified as either a high, low, short or open. For example, if the resistance of a cell is in close proximity to any of the sense points, e.g., points 432, 432 or 433, it may be difficult to classify the state of that cell. Such defects, which are neither shorts nor open circuits, are not detectable during user read or verify operations. Examples of such defects include stuck bits, waterfalls, shunts and low tunnel magnetoresistance (TMR) bits.


In one embodiment of the present invention, all cells with resistances that cannot be easily classified are converted or forced into short circuited cells during the testing or characterization stage. Shorting such problematic bits allows them to be replaced by redundant bits, thereby, precluding them from being corrected using a more expensive ECC process. In one embodiment, during the testing phase, a test algorithm is executed that determines the number of such bits and converts them into shorts.


For example, there may be certain shunted bits in the region between Rlow 535 and Rshort 530. These bits are not short circuits, however, they are also not completely functional bits. As a result of certain process anomalies, these bits may not be capable of a full swing between Rhigh and Rlow. In other words, while the bits may exhibit some switching behavior, they are not capable of exhibiting a full TMR swing in a way that the sense amplifier can clearly distinguish between the two states of the bit and classify them as either Rhigh or Rlow. In one embodiment, the shunted bits are shorted out so that they can be replaced by a corresponding redundant bit.


In certain cases, there may be defective bits that skew the WER of the MRAM device. For example, in the case of magnetic defects, there may be cases where certain bits have a defect rate that are much higher than the other bits in the MRAM device. One bit in the memory may, for example, have a high defect rate of 10−5 while other bits in the same device have an average defect rate of 10−6. In order to prevent the bits with the high defect rate from skewing the WER, in one embodiment, these bits can be shorted out and replaced with redundant bits, e.g., during memory operation.


By way of further example, certain bits may be classified as waterfall bits. These bits are typically stuck bits that do not switch at all either because of a process or magnetic defect. They may be either stuck high or stuck low. These bits may be found in the middle of the distribution, e.g., either in the middle of the Rlow distribution 535 or the middle of the Rhigh distribution 540. Low TMR bits may exhibit the same behavior as waterfall bits. In other words, low TMR bits may also be either stuck high or stuck low. Low TMR bits can also be caused by either a magnetic or process defect. In one embodiment, the waterfall or low TMR bits are shorted out so that they can be replaced by a corresponding redundant bit.


One of the metrics monitored for the bits in an MRAM device is retention. The retention of the bit is related to the stability of the bit. Retention relates to the amount of time that a bit will retain its data. The bits in a memory device may have a retention distribution. Some bits, for example, may retain their data for several hours while some may only retain their information for under an hour. A given application for an MRAM device may, however, require a minimum retention period. For example, a given application may require a minimum retention period of an hour. In one embodiment, all bits that have retention rates below an hour can then be shorted out and replaced by redundant bits. In other words, bits that do not meet the requirements of a particular application can be blown out of the distribution and replaced by the redundant bits.


Typically, bits in a STT-MRAM memory chip will short during a write operation because of the higher voltage employed during a write operation (as compared to a read operation). In certain unlikely instances if a bit shorts during a read operation while the mapping of the defective bits is being performed, it can cause the replacement scheme to malfunction.



FIG. 6 illustrates the manner in which a malfunction can occur if a bit shorts during a read operation in accordance with an embodiment of the present invention. If a defect, e.g., a short 650 appears during a read operation that was not present during an earlier write operation, then all the redundant bits 660-663 can get incorrectly assigned especially if a simple replacement scheme is being followed, e.g., a left to right or right to left replacement scheme based on the relative positions of the defects. For example, if a simple left to right replacement scheme is being followed, then a short 650 that appears during a read operation (but was not present when the data was written) may incorrectly be mapped to redundant bit R1660. This would result in all the following redundant bits also being incorrectly assigned, e.g., R2661 would be incorrectly assigned to bit 630 (instead of 631), R3662 would be incorrectly assigned to bit 631 (instead of 632) and so forth.


To reduce the impact of this issue, a more complex replacement scheme, e.g., replacement scheme 375 can be programmed into the memory chip. As mentioned above, in some embodiments, other replacement schemes or algorithms for mapping redundant bits to the defective bits can also be used to improve efficiency. Such schemes would be more complex than simply mapping bits on the basis of relative positions of the defects and would likely require programming and storing a corresponding algorithm into the memory chip. However, more complex schemes would prevent against problems created as a result of the rare circumstance of a bit shorting during a read operation.


In one embodiment, the replacement scheme may alternate between a left-to-right scheme and a right-to-left scheme. Such a scheme would prevent against all the redundant bits getting misassigned in the case of a bit failure during a read operation. For example, if bit 650 shorts during a read operation, in a scheme that alternates, redundant bit R1660 would be misassigned to bit 650. However, if the scheme alternates, then redundant bit R4663 would be swapped with the right-most bit in the codeword, which in this case is, bit 634. Accordingly, instead of all 4 redundant bits being misassigned, only 2 end up being misassigned in a scheme that alternates between the two replacement schemes.


In another embodiment, the replacement scheme may restrict the allocation of redundant bits to designated portions of the code word. For example, for a 32 bit codeword, redundant bit R1660 may be restricted to defects appearing in the first 8 bits of the codeword, R2661 may be restricted to defects appearing in the next 8 bits of the codeword, and so forth. While this scheme is effective in restricting the number of redundant bits that may potentially be misaligned if a bit shorts during the read operation, it may be problematic if all the defective bits are lumped together in one of the 8 bit sections.


Similar to a bit shorting during a read operation, it is possible that a bit may short during a write operation after the redundant bits have already been mapped out during the pre-write read operation. To mitigate against this, typically embodiments of the present invention will perform a verify operation following the write. In other words, a write-verify (which effectively is the same as a ‘read’ operation) can be performed to make sure no bits shorted or otherwise malfunctioned during the write operation. If a malfunction is detected during the verify operation, the entire write operation is performed again (which may include the pre-write read operation for mapping out the redundant bits).


In one embodiment, a verify operation occurs after the re-write also. In another embodiment, if the verify operation fails, the data word is entered into an error cache (or dynamic redundancy register) where it is stored for correcting at a later time. Examples of functionality that enables monitoring performance of a client device are described in U.S. patent application Ser. No. 15/277,799, entitled “DEVICE WITH DYNAMIC REDUNDANCY REGISTERS”, filed on 27 Sep. 2016, and which is hereby incorporated by reference in its entirety for all purposes.


If the data word needs to be accessed prior to fixing the malfunction, it is read directly from the cache. In one embodiment, a verify operation occurs after the write to error buffer to ensure that the proper information was written to the error buffer.


In one embodiment, in order to improve read speed, the bit-cell resistance distribution can be cleaned up by shorting marginal TMR bits or by reducing TMR requirements for the sense amplifiers. FIG. 7A graphically illustrates the manner in which the distribution of the resistance states across an STT-MRAM chip array wherein there is overlap between the high and low resistance states. As shown in FIG. 7A, the bit-cell resistance distribution comprises region 620, wherein certain bit-cells in the array have resistances that fall in the region 620. This region is also known as the “margin area.” The margin area is typically a bandwidth of resistances centered around reference point 631, wherein a sense amplifier will not be able to accurately distinguish a resistance within the margin area as either Rhigh or Rlow. In other words, typically, bit-cells with resistances that fall within margin area 620 (either directly in the region overlapping the R-low 622 and R-high curves 624 or in close proximity to the overlap region) will likely not be read accurately by a sense amplifier at high speeds. The width of margin area 620 depends on the speed of the sense amplifier. A sense amplifier will typically be unable to discern between a “1” or a “0” for STT-MRAM cells when the bit-cell resistances are within region 620. Such bits are unreliable because they may be detected as either a “0” or “1”. In order to avoid the overhead of having an ECC process clean up such ambiguous bits, in one embodiment, all bit-cells with resistances that fall in the overlap region 620 are shorted out.


In one embodiment, the margin area 620 is determined by characterizing the sense amplifier. The width of the margin area is dependent on the speed of the sense amplifier. Characterizing the sense amplifier comprises moving the sense amplifier reference point to the left to determine the Margin High reference point 691. After establishing the Margin High reference point 691, the bits with resistance values higher than the reference point 691 are determined. Subsequently, the sense amplifier reference point is moved to the right to determine the Margin Low reference point 692. After establishing the Margin Low reference point 692, the bits with resistance values lower than the reference point 692 are determined. Thereafter, an XOR is performed between the two sets of results to establish the bits with resistance values that lie between the Margin High reference point 691 and Margin Low reference point 692. The margin bits in between the two reference points can then be shorted out and pushed towards the R-short distribution 695.



FIG. 7B graphically illustrates the manner in which the distribution of the resistance states across an STT-MRAM chip array changes by shorting marginal TMR bits or by reducing TMR requirements for the sense amplifiers in accordance with embodiments of the present invention. When unreliable bits in region 620 are shorted out, the R-low 682 and R-high 684 curves move further apart to where there is no overlapping region anymore. In other words, the sense amplifier window is opened up so a stringent sense amplifier is no longer required to distinguish between a “1” or “0” for ambiguous bits. More stringent sense amplifiers typically require more power and longer evaluation times, so by shorting out the ambiguous bits, the chip conserves power. Further, all the shorted bits can now be corrected by using the redundant bit replacement scheme rather than using costly ECC procedures. And because each codeword in the memory comprises at least 4 redundant bits, it is unlikely that any single codeword will have more than 4 bits shorted out during the process of cleaning up the sense amplifier window.


In one embodiment, the redundant bit replacement scheme of the present invention also results in higher tolerance for write endurance failures. Typically with MRAM, driving the cells at higher voltages at higher speeds results in lower endurance levels. With the bit replacement scheme of the present invention, lower endurance levels can be tolerated because each code word has multiple redundant bits to replace any defective bits. Accordingly, the chip can be allowed to operate at a higher voltage because statistically the error rates do not surpass a critical threshold as a result of the multiple redundant bits being used to replace any defects occurring on the fly. Further, because embodiments of the present invention can be used to correct bit defects over the lifetime of the chip, there is no time limit on the efficacy of the scheme.



FIG. 8A shows a flowchart 800 of an exemplary method for correcting bit defects in a STT-MRAM memory array during a write operation in accordance with embodiments of the present invention.


At step 801, a data word to be written into memory is accessed in accordance with a write operation command. The data word is passed to an ECC hash function, e.g., to determine a checksum.


At step 802, a read-before-write operation is executed on the STT-MRAM memory array, wherein the STT-MRAM memory comprises a plurality of codewords. Further, each codeword comprises a plurality of redundant bits.


At step 803, the read-before-write operation executes by reading a codeword. Subsequently, at step 804, the read-before-write operation maps defective bits in the codeword to redundant bits for the word based on a mapping scheme.


At step 805, the defective bits in the codeword are replaced with a corresponding mapped redundant bit.


At step 806, a write operation is executed with corresponding redundant bits in place of the defective bits. Accordingly, the data word can be saved into the memory using both the codeword and corresponding redundant bits.


At step 807, verification is performed that the write operation executed correctly by performing another read operation to read out the data word stored in the codeword and corresponding redundant bits.



FIG. 8B shows a flowchart 810 of an exemplary method for correcting bit defects in a STT-MRAM memory array during a read operation in accordance with embodiments of the present invention.


At step 811, a read operation comprises reading a codeword in an STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a plurality of redundant bits.


At step 812, the read operation maps defective bits in the codeword to redundant bits for the word based on a mapping scheme.


At step 813, the defective bits in the codeword are replaced with a corresponding redundant bit in accordance with the mapping scheme.


At step 814, an ECC operation is performed on the data word read out to correct for transient defects not corrected using the plurality of redundant bits.



FIG. 9 illustrates an apparatus for correcting bit defects in a STT-MRAM memory array 900 in accordance with embodiments of the present invention.


Shown in FIG. 9, is the memory array 900 comprising a codewords array 901 with the corresponding redundant bits 902 allocated for each codeword. FIG. 9 also illustrates the logic 903 that implements the mapping scheme between the codewords and the redundant bits.


Write logic 906 implements a method for correcting bit defects in a STT-MRAM memory array during a write operation (as discussed in conjunction with FIG. 8A). Read logic 907 implements a method for correcting bit defects in a STT-MRAM memory array during a read operation (as discussed in conjunction with FIG. 8B).


Further, FIG. 9 illustrates ECC logic 908 that operates in conjunction with the read and write logic. Also, the memory comprises address 920 and data bus lines 921 that communicate with the processor. Further, control bus 922 is illustrates, wherein the control bus would receive commands regarding a read/write operation, etc.



FIG. 10 shows a flowchart 1010 of an exemplary method for correcting bit defects in a STT-MRAM memory array in accordance with embodiments of the present invention.


At step 1011, a margin area is determined associated with a resistance distribution for a memory array, e.g., STT-MRAM memory array. A read operation is performed on the memory array to characterize the resistance distribution. The resistance distribution comprises a distribution of bit-cell resistances for all bits comprising the STT-MRAM memory array, wherein the distribution of bit-cell resistances comprises a distribution of acceptable high resistance bits and a distribution of acceptable low resistance bits, e.g., regions Rlow and Rhigh shown in FIG. 7A. As discussed in connection with FIGS. 7A and 7B, the bit-cell resistance distribution comprises region 620, wherein certain bit-cells in the array have resistances that fall in the region 620. This region is also known as the “margin area.” The margin area is typically a bandwidth of resistances centered around reference point 631, wherein a sense amplifier will not be able to accurately distinguish a resistance within the margin area as either Rhigh or Rlow. In other words, typically, bit-cells with resistances that fall within margin area 620 (either directly in the region overlapping the R-low 622 and R-high curves 624 or in close proximity to the overlap region) will likely not be read accurately by a sense amplifier at high speeds


Once the margin area is determined, at step 1012, the method comprises forcing the bit-cell resistances of memory bit-cells associated with the margin area to short circuits in order to widen a window between the distribution of acceptable high resistance bits and acceptable low resistance bits. Note that steps 1011 to 1012 can occur during product testing or characterization.


Finally, at step 1013, the method comprises replacing each of the short-circuited memory bit-cells with a corresponding redundant bit in the codeword associated with the short-circuited memory bit-cell. For example, during memory operation, the replacing can occur in accordance with a mapping scheme. In other words, for example, a redundant bit is mapped to the short-circuited bit in the codeword in accordance with the position of the short-circuited memory bit-cell. During memory operation then, a redundant bit is stored in the associated codeword in lieu of the short-circuited bit in accordance with the mapping. As discussed above, a mapping scheme will dictate the manner in which the redundant bits get mapped to the short-circuited bit-cells.



FIG. 11 shows a flowchart 1110 of another exemplary method for correcting bit defects in a STT-MRAM memory array in accordance with embodiments of the present invention.


At step 1111, the resistance distribution of a memory array, e.g., STT-MRAM is characterized. In other words, a read operation is performed on the memory array to characterize the resistance distribution.


At step 1112, all bit-cells in the memory array that cannot be easily characterized are short-circuited. As noted above, such defects, which are neither shorts nor open circuits, are not user read or verify operations. Examples of such defects include stuck bits, waterfalls, shunts and low tunnel magnetoresistance (TMR) bits. Note that steps 1111 to 1112 can occur during product testing or characterization.


At step 1113, the method comprises replacing each of the short-circuited memory bit-cells with a corresponding redundant bit in the codeword associated with the short-circuited memory bit-cell. For example, during memory operation, the replacing can occur in accordance with a mapping scheme. In other words, for example, a redundant bit is mapped to the short-circuited bit in the codeword in accordance with the position of the short-circuited memory bit-cell. During memory operation then, a redundant bit is stored in the associated codeword in lieu of the short-circuited bit in accordance with the mapping. As discussed above, a mapping scheme will dictate the manner in which the redundant bits get mapped to the short-circuited bit-cells.


The above description and drawings are only to be considered illustrative of specific embodiments, which achieve the features and advantages described herein. Modifications and substitutions to specific process conditions can be made. Accordingly, the embodiments in this patent document are not considered as being limited by the foregoing description and drawings.

Claims
  • 1. A method for correcting bit defects in an STT-MRAM memory, the method comprising: reading a codeword in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a plurality of bits and a plurality of redundant bits;mapping defective bits in the plurality of bits of the codeword to redundant bits of the plurality of redundant bits based on a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits in the codeword are to be mapped to the redundant bits, wherein the mapping comprises: determining if each bit from the defective bits represents an open circuit or a short circuit in the STT-MRAM memory;determining a respective position of each defective bit in the codeword; andmapping a respective redundant bit of the plurality of redundant bits to eachdefective bit in accordance with a position of each defective bit;based on the mapping, using mapped redundant bits in lieu of the defective bits in the codeword; andperforming an ECC correction operation on the codeword read from the STT-MRAM memory to correct any additional errors in the codeword.
  • 2. The method of claim 1, wherein the reading the codeword and the mapping of the defective bits are performed substantially simultaneously.
  • 3. The method of claim 1, wherein the mapping scheme comprises a left to right mapping scheme, wherein a left most defective bit in the codeword is mapped to a left most redundant bit of the plurality of redundant bits of the codeword, and wherein each subsequent defective bit traversing from left to right is mapped to a next available redundant bit traversing from left to right.
  • 4. The method of claim 1, wherein the mapping scheme comprises a right to left mapping scheme, wherein a right most defective bit in the codeword is mapped to a right most redundant bit of the plurality of redundant bits of the codeword, and wherein each subsequent defective bit traversing from right to left is mapped to a next available redundant bit traversing from a right to left.
  • 5. The method of claim 1, wherein the mapping scheme alternates between a left to right mapping scheme and a right to left mapping scheme.
  • 6. The method of claim 1, where the mapping scheme comprises: dividing the codeword into a plurality of segments; andallocating one or more redundant bits from said plurality of redundant bits to each of the plurality of segments, wherein a defective bit in each segment is mapped to a redundant bit that is allocated thereto.
  • 7. The method of claim 1 further comprising: shorting ambiguous bits in the STT-MRAM memory, wherein the ambiguous bits have ambiguous resistances between being high or low bits; andusing the mapping scheme to map the ambiguous bits to redundant bits.
  • 8. A method for correcting bit defects in an STT-MRAM memory, the method comprising: reading a codeword in the STT-MRAM memory, wherein the STT-MRAM memory comprises a plurality of codewords, wherein each codeword comprises a respective plurality of bits and a respective plurality of redundant bits;mapping each defective bit in the codeword to a respective redundant bit of the plurality of redundant bits in accordance with a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits of the codeword are to be mapped to redundant bits of the codeword, wherein the mapping comprises: determining if each defective bit represents an open circuit or a short circuit in the STT-MRAM memory;determining a position of the defective bit in the codeword; andmapping a redundant bit to the defective bit based on the position;replacing the defective bits of the codeword with redundant bits of the plurality of redundant bits, wherein the defective bits are replaced with the redundant bits based on relative positions of the defective bits in accordance with the mapping scheme; andperforming an ECC correction operation on the codeword read from the STT-MRAM memory to correct any additional errors in the codeword.
  • 9. The method of claim 8, wherein the reading the codeword and the mapping of the defective bits are performed substantially simultaneously.
  • 10. The method of claim 8, wherein the mapping scheme comprises a left to right mapping scheme, wherein a left most defective bit in the codeword is mapped to a left most redundant bit of the plurality of redundant bits, and wherein each subsequent defective bit traversing from left to right is mapped to a next available redundant bit traversing left to right.
  • 11. The method of claim 8, wherein the mapping scheme comprises a right to left mapping scheme, wherein a right most defective bit in the codeword is mapped to a right most redundant bit of the plurality of redundant bits, and wherein each subsequent defective bit traversing from right to left is mapped to a next available redundant bit traversing right to left.
  • 12. The method of claim 8, wherein the mapping scheme alternates between a left to right mapping scheme and a right to left mapping scheme.
  • 13. The method of claim 8, where the mapping scheme comprises: dividing the codeword into a plurality of segments; andallocating one or more redundant bits from said plurality of redundant bits to each of the plurality of segments, wherein a defective bit in each segment is mapped to a redundant bit that is allocated thereto.
  • 14. An apparatus for correcting bit defects in an STT-MRAM memory, the apparatus comprising: a processor;an STT-MRAM memory comprising a plurality of codewords, wherein each codeword comprises a respective plurality of bits and a respective plurality of redundant bits, and wherein the processor is configured to: read a codeword in the STT-MRAM memory;map defective bits in the codeword to redundant bits of the plurality of redundant bits based on a mapping scheme, wherein the mapping scheme is operable to determine a manner in which the defective bits in the codeword are to be mapped to the redundant bits, wherein to map the defective bits, the processor is further configured to: determine if each defective bit represents an open circuit or a short circuit in the STT-MRAM memory;determine a position of the defective bit in the codeword; andmap a redundant bit to the defective bit based on the position;replace the defective bits in the codeword with corresponding redundant bits as mapped andperform an ECC correction operation on the codeword read from the STT-MRAM memory to correct any additional errors in the codeword.
  • 15. The apparatus of claim 14, wherein the processor is configured to read the codeword and map the defective bits simultaneously.
  • 16. The apparatus of claim 14, wherein the mapping scheme comprises a left to right mapping scheme, wherein a left most defective bit in the codeword is mapped to a left most redundant bit of the plurality of redundant bits, and wherein each subsequent defective bit traversing from a left to right is mapped to a next available redundant bit traversing left to right.
  • 17. The apparatus of claim 14, wherein the mapping scheme comprises a right to left mapping scheme, wherein a right most defective bit in the codeword is mapped to a right most redundant bit of the plurality of redundant bits, and wherein each subsequent defective bit traversing from right to left is mapped to a next available redundant bit traversing right to left.
  • 18. The apparatus of claim 14, wherein the mapping scheme alternates between a left to right mapping scheme and a right to left mapping scheme.
  • 19. The apparatus of claim 14, wherein in order to implement the mapping scheme, the processor is configured to: divide the codeword into a plurality of segments; andallocate one or more redundant bits from said plurality of redundant bits to each of the plurality of segments, wherein a defective bit in each segment is mapped to a redundant bit that is allocated thereto.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a Continuation-in-Part of, claims the benefit of and priority to U.S. application Ser. No. 15/792,672, filed Oct. 24, 2017, entitled “ON-THE-FLY BIT FAILURE DETECTION AND BIT REDUNDANCY REMAPPING TECHNIQUES TO CORRECT FOR FIXED BIT DEFECTS” and hereby incorporated by reference in its entirety.

US Referenced Citations (518)
Number Name Date Kind
1000204 Idan Alrod Aug 1911 A
4597487 Crosby et al. Jul 1986 A
5153880 Owen et al. Oct 1992 A
5541868 Prinz Jul 1996 A
5559952 Fujimoto Sep 1996 A
5629549 Johnson May 1997 A
5640343 Gallagher et al. Jun 1997 A
5654566 Johnson Aug 1997 A
5691936 Sakakima et al. Nov 1997 A
5695846 Lange et al. Dec 1997 A
5695864 Zlonczewski Dec 1997 A
5732016 Chen et al. Mar 1998 A
5751647 O'Toole May 1998 A
5754753 Smelser May 1998 A
5856897 Mauri Jan 1999 A
5896252 Kanai Apr 1999 A
5966323 Chen et al. Oct 1999 A
6016269 Peterson et al. Jan 2000 A
6055179 Koganei et al. Apr 2000 A
6055204 Bosshart Apr 2000 A
6064948 West May 2000 A
6075941 Itoh Jun 2000 A
6097579 Gill Aug 2000 A
6112295 Bhamidipati et al. Aug 2000 A
6124711 Tanaka et al. Sep 2000 A
6134138 Lu et al. Oct 2000 A
6140838 Johnson Oct 2000 A
6154139 Kanai et al. Nov 2000 A
6154349 Kanai et al. Nov 2000 A
6172902 Wegrowe et al. Jan 2001 B1
6181614 Aipperspach et al. Jan 2001 B1
6233172 Chen et al. May 2001 B1
6233690 Choi et al. May 2001 B1
6243288 Ishikawa et al. Jun 2001 B1
6252798 Satoh et al. Jun 2001 B1
6256223 Sun Jul 2001 B1
6292389 Chen et al. Sep 2001 B1
6347049 Childress et al. Feb 2002 B1
6376260 Chen et al. Apr 2002 B1
6385082 Abraham et al. May 2002 B1
6393504 Leung et al. May 2002 B1
6436526 Odagawa et al. Aug 2002 B1
6442681 Ryan et al. Aug 2002 B1
6447935 Zhang et al. Sep 2002 B1
6458603 Kersch et al. Oct 2002 B1
6493197 Ito et al. Dec 2002 B2
6522137 Sun et al. Feb 2003 B1
6531339 King et al. Mar 2003 B2
6532164 Redon et al. Mar 2003 B2
6538918 Swanson et al. Mar 2003 B2
6545903 Savtchenko et al. Apr 2003 B1
6545906 Savtchenko et al. Apr 2003 B1
6563681 Sasaki et al. May 2003 B1
6566246 deFelipe et al. May 2003 B1
6603677 Redon et al. Aug 2003 B2
6608776 Hidaka Aug 2003 B2
6635367 Igarashi et al. Oct 2003 B2
6653153 Doan et al. Nov 2003 B2
6654278 Engel et al. Nov 2003 B1
6677165 Lu et al. Jan 2004 B1
6710984 Yuasa et al. Mar 2004 B1
6713195 Wang et al. Mar 2004 B2
6714444 Huai et al. Mar 2004 B2
6731537 Kanamori May 2004 B2
6744086 Daughton et al. Jun 2004 B2
6750491 Sharma et al. Jun 2004 B2
6751074 Inomata et al. Jun 2004 B2
6765824 Kishi et al. Jul 2004 B2
6772036 Eryurek et al. Aug 2004 B2
6773515 Li et al. Aug 2004 B2
6777730 Daughton et al. Aug 2004 B2
6785159 Tuttle Aug 2004 B2
6807091 Saito Oct 2004 B2
6812437 Levy Nov 2004 B2
6829161 Huai et al. Dec 2004 B2
6835423 Chen et al. Dec 2004 B2
6838740 Huai et al. Jan 2005 B2
6839821 Estakhri Jan 2005 B2
6842317 Sugita et al. Jan 2005 B2
6842366 Chan Jan 2005 B2
6847547 Albert et al. Jan 2005 B2
6879512 Luo Apr 2005 B2
6887719 Lu et al. May 2005 B2
6888742 Nguyen et al. May 2005 B1
6902807 Argitia et al. Jun 2005 B1
6906369 Ross et al. Jun 2005 B2
6920063 Huai et al. Jul 2005 B2
6933155 Albert et al. Aug 2005 B2
6936479 Sharma Aug 2005 B2
6938142 Pawlowski Aug 2005 B2
6956257 Zhu et al. Oct 2005 B2
6958507 Atwood et al. Oct 2005 B2
6958927 Nguyen et al. Oct 2005 B1
6967363 Huai Nov 2005 B1
6967863 Huai Nov 2005 B2
6980469 Kent et al. Dec 2005 B2
6984529 Stojakovic et al. Jan 2006 B2
6985385 Nguyen et al. Jan 2006 B2
6992359 Nguyen et al. Jan 2006 B2
6995962 Saito et al. Feb 2006 B2
6996017 Scheuerlein et al. Feb 2006 B2
7002839 Kawabata et al. Feb 2006 B2
7005958 Wan Feb 2006 B2
7006371 Matsuoka Feb 2006 B2
7006375 Covington Feb 2006 B2
7009877 Huai et al. Mar 2006 B1
7033126 Van Den Berg Apr 2006 B2
7041598 Sharma May 2006 B2
7045368 Hong et al. May 2006 B2
7054119 Sharma et al. May 2006 B2
7057922 Fukumoto Jun 2006 B2
7058782 Henderson et al. Jun 2006 B2
7095646 Slaughter et al. Aug 2006 B2
7098494 Pakala et al. Aug 2006 B2
7106624 Huai et al. Sep 2006 B2
7110287 Huai et al. Sep 2006 B2
7149106 Mancoff et al. Dec 2006 B2
7161829 Huai et al. Jan 2007 B2
7170778 Kent et al. Jan 2007 B2
7187577 Wang Mar 2007 B1
7190611 Nguyen et al. Mar 2007 B2
7203129 Lin et al. Apr 2007 B2
7203802 Huras Apr 2007 B2
7218559 Satoh May 2007 B2
7227773 Nguyen et al. Jun 2007 B1
7233039 Huai et al. Jun 2007 B2
7242045 Nguyen et al. Jul 2007 B2
7245462 Huai et al. Jul 2007 B2
7262941 Li et al. Aug 2007 B2
7273780 Kim Sep 2007 B2
7283333 Gill Oct 2007 B2
7307876 Kent et al. Dec 2007 B2
7313015 Bessho Dec 2007 B2
7324387 Bergemont et al. Jan 2008 B1
7324389 Cernea Jan 2008 B2
7335960 Han et al. Feb 2008 B2
7351594 Bae et al. Apr 2008 B2
7352021 Bae et al. Apr 2008 B2
7369427 Diao et al. May 2008 B2
7372722 Jeong May 2008 B2
7376006 Bednorz et al. May 2008 B2
7386765 Ellis Jun 2008 B2
7404017 Kuo Jul 2008 B2
7421535 Jarvis et al. Sep 2008 B2
7436699 Tanizaki Oct 2008 B2
7449345 Horng et al. Nov 2008 B2
7453719 Sakimura et al. Nov 2008 B2
7476919 Hong et al. Jan 2009 B2
7502249 Ding Mar 2009 B1
7502253 Rizzo Mar 2009 B2
7508042 Guo Mar 2009 B2
7511985 Horii Mar 2009 B2
7515458 Hung et al. Apr 2009 B2
7515485 Lee Apr 2009 B2
7532503 Morise et al. May 2009 B2
7541117 Ogawa Jun 2009 B2
7542326 Yoshimura Jun 2009 B2
7573737 Kent et al. Aug 2009 B2
7576956 Huai Aug 2009 B2
7582166 Lampe Sep 2009 B2
7598555 Papworth-Parkin Oct 2009 B1
7602000 Sun et al. Oct 2009 B2
7619431 DeWilde et al. Nov 2009 B2
7633800 Adusumilli et al. Dec 2009 B2
7642612 Izumi et al. Jan 2010 B2
7660161 Van Tran Feb 2010 B2
7663171 Inokuchi et al. Feb 2010 B2
7675792 Bedeschi Mar 2010 B2
7696551 Xiao Apr 2010 B2
7733699 Roohparvar Jun 2010 B2
7739559 Suzuki et al. Jun 2010 B2
7773439 Do et al. Aug 2010 B2
7776665 Izumi et al. Aug 2010 B2
7796439 Arai Sep 2010 B2
7810017 Radke Oct 2010 B2
7821818 Dieny et al. Oct 2010 B2
7852662 Yang Dec 2010 B2
7861141 Chen Dec 2010 B2
7881095 Lu Feb 2011 B2
7911832 Kent et al. Mar 2011 B2
7916515 Li Mar 2011 B2
7936595 Han et al. May 2011 B2
7936598 Zheng et al. May 2011 B2
7983077 Park Jul 2011 B2
7986544 Kent et al. Jul 2011 B2
8008095 Assefa et al. Aug 2011 B2
8028119 Miura Sep 2011 B2
8041879 Erez Oct 2011 B2
8055957 Kondo Nov 2011 B2
8058925 Rasmussen Nov 2011 B2
8059460 Jeong et al. Nov 2011 B2
8072821 Arai Dec 2011 B2
8077496 Choi Dec 2011 B2
8080365 Nozaki Dec 2011 B2
8088556 Nozaki Jan 2012 B2
8094480 Tonomura Jan 2012 B2
8102701 Prejbeanu et al. Jan 2012 B2
8105948 Zhong et al. Jan 2012 B2
8120949 Ranjan et al. Feb 2012 B2
8143683 Wang et al. Mar 2012 B2
8144509 Jung Mar 2012 B2
8148970 Fuse Apr 2012 B2
8159867 Cho et al. Apr 2012 B2
8201024 Burger Jun 2012 B2
8223534 Chung Jul 2012 B2
8238149 Shih et al. Aug 2012 B2
8255742 Ipek Aug 2012 B2
8278996 Miki Oct 2012 B2
8279666 Dieny et al. Oct 2012 B2
8295073 Norman Oct 2012 B2
8295082 Chua-Eoan Oct 2012 B2
8296606 Blodgett Oct 2012 B2
8334213 Mao Dec 2012 B2
8345474 Oh Jan 2013 B2
8349536 Nozaki Jan 2013 B2
8362580 Chen et al. Jan 2013 B2
8363465 Kent et al. Jan 2013 B2
8374050 Zhou et al. Feb 2013 B2
8386836 Burger Feb 2013 B2
8415650 Greene Apr 2013 B2
8416620 Zheng et al. Apr 2013 B2
8422286 Ranjan et al. Apr 2013 B2
8422330 Hatano et al. Apr 2013 B2
8432727 Ryu Apr 2013 B2
8441844 El Baraji May 2013 B2
8456883 Liu Jun 2013 B1
8456926 Ong et al. Jun 2013 B2
8477530 Ranjan et al. Jul 2013 B2
8492381 Kuroiwa et al. Jul 2013 B2
8492881 Kuroiwa et al. Jul 2013 B2
8495432 Dickens Jul 2013 B2
8535952 Ranjan et al. Sep 2013 B2
8539303 Lu Sep 2013 B2
8542524 Keshtbod et al. Sep 2013 B2
8549303 Fifield et al. Oct 2013 B2
8558334 Ueki et al. Oct 2013 B2
8559215 Zhou et al. Oct 2013 B2
8574928 Satoh et al. Nov 2013 B2
8582353 Lee Nov 2013 B2
8590139 Op DeBeeck et al. Nov 2013 B2
8592927 Jan Nov 2013 B2
8593868 Park Nov 2013 B2
8609439 Prejbeanu et al. Dec 2013 B2
8617408 Balamane Dec 2013 B2
8625339 Ong Jan 2014 B2
8634232 Oh Jan 2014 B2
8667331 Hori Mar 2014 B2
8687415 Parkin et al. Apr 2014 B2
8705279 Kim Apr 2014 B2
8716817 Saida May 2014 B2
8716818 Yoshikawa et al. May 2014 B2
8722543 Belen May 2014 B2
8737137 Choy et al. May 2014 B1
8755222 Kent et al. Jun 2014 B2
8779410 Sato et al. Jul 2014 B2
8780617 Kang Jul 2014 B2
8792269 Abedifard Jul 2014 B1
8802451 Malmhall Aug 2014 B2
8810974 Noel et al. Aug 2014 B2
8817525 Ishihara Aug 2014 B2
8832530 Pangal et al. Sep 2014 B2
8852760 Wang et al. Oct 2014 B2
8853807 Son et al. Oct 2014 B2
8860156 Beach et al. Oct 2014 B2
8862808 Tsukamoto et al. Oct 2014 B2
8867258 Rao Oct 2014 B2
8883520 Satoh et al. Nov 2014 B2
8902628 Ha Dec 2014 B2
8966345 Wilkerson Feb 2015 B2
8987849 Jan Mar 2015 B2
9001550 Lung Apr 2015 B2
9019754 Bedeschi Apr 2015 B1
9019771 Lung et al. Apr 2015 B2
9025378 Tokiwa May 2015 B2
9026888 Kwok May 2015 B2
9030899 Lee May 2015 B2
9036407 Wang et al. May 2015 B2
9037812 Chew May 2015 B2
9043674 Wu May 2015 B2
9070441 Otsuka et al. Jun 2015 B2
9070855 Gan et al. Jun 2015 B2
9076530 Gomez et al. Jul 2015 B2
9082888 Kent et al. Jul 2015 B2
9104581 Fee et al. Aug 2015 B2
9104595 Sah Aug 2015 B2
9130155 Chepulskyy et al. Sep 2015 B2
9136463 Li Sep 2015 B2
9140747 Kim Sep 2015 B2
9165629 Chih Oct 2015 B2
9165787 Kang Oct 2015 B2
9166155 Deshpande Oct 2015 B2
9178958 Lindamood Nov 2015 B2
9189326 Kalamatianos Nov 2015 B2
9190471 Yi et al. Nov 2015 B2
9196332 Zhang et al. Nov 2015 B2
9229306 Mekhanik et al. Jan 2016 B2
9229853 Khan Jan 2016 B2
9231191 Huang et al. Jan 2016 B2
9245608 Chen et al. Jan 2016 B2
9250990 Motwani Feb 2016 B2
9250997 Kim et al. Feb 2016 B2
9251896 Ikeda Feb 2016 B2
9257483 Ishigaki Feb 2016 B2
9263667 Pinarbasi Feb 2016 B1
9286186 Weiss Mar 2016 B2
9298552 Leem Mar 2016 B2
9299412 Naeimi Mar 2016 B2
9317429 Ramanujan Apr 2016 B2
9324457 Takizawa Apr 2016 B2
9337412 Pinarbasi et al. May 2016 B2
9341939 Yu et al. May 2016 B1
9342403 Keppel et al. May 2016 B2
9349482 Kim et al. May 2016 B2
9351899 Bose et al. May 2016 B2
9362486 Kim et al. Jun 2016 B2
9363036 Zhang Jun 2016 B1
9378817 Kawai Jun 2016 B2
9379314 Park et al. Jun 2016 B2
9389954 Pelley et al. Jul 2016 B2
9396065 Webb et al. Jul 2016 B2
9396991 Arvin et al. Jul 2016 B2
9401336 Arvin et al. Jul 2016 B2
9406876 Pinarbasi Aug 2016 B2
9418721 Bose Aug 2016 B2
9431084 Bose et al. Aug 2016 B2
9449720 Lung Sep 2016 B1
9450180 Annunziata Sep 2016 B1
9455013 Kim Sep 2016 B2
9466789 Wang et al. Oct 2016 B2
9472282 Lee Oct 2016 B2
9472748 Kuo et al. Oct 2016 B2
9484527 Han et al. Nov 2016 B2
9488416 Fujita et al. Nov 2016 B2
9490054 Jan Nov 2016 B2
9508456 Shim Nov 2016 B1
9520128 Bauer et al. Dec 2016 B2
9520192 Naeimi et al. Dec 2016 B2
9548116 Roy Jan 2017 B2
9548445 Lee et al. Jan 2017 B2
9553102 Wang Jan 2017 B2
9583167 Chung Feb 2017 B2
9594683 Dittrich Mar 2017 B2
9600183 Tomishima et al. Mar 2017 B2
9608038 Wang et al. Mar 2017 B2
9634237 Lee et al. Apr 2017 B2
9640267 Tani May 2017 B2
9646701 Lee May 2017 B2
9652321 Motwani May 2017 B2
9662925 Raksha et al. May 2017 B2
9697140 Kwok Jul 2017 B2
9720616 Yu Aug 2017 B2
9728712 Kardasz et al. Aug 2017 B2
9741926 Pinarbasi et al. Aug 2017 B1
9772555 Park et al. Sep 2017 B2
9773974 Pinarbasi et al. Sep 2017 B2
9780300 Zhou et al. Oct 2017 B2
9793319 Gan et al. Oct 2017 B2
9853006 Arvin et al. Dec 2017 B2
9853206 Pinarbasi et al. Dec 2017 B2
9853292 Loveridge et al. Dec 2017 B2
9858976 Ikegami Jan 2018 B2
9859333 Kim et al. Jan 2018 B2
9865806 Choi et al. Jan 2018 B2
9935258 Chen et al. Apr 2018 B2
10008662 You Jun 2018 B2
10026609 Sreenivasan et al. Jul 2018 B2
10038137 Chuang Jul 2018 B2
10042588 Kang Aug 2018 B2
10043851 Shen Aug 2018 B1
10043967 Chen Aug 2018 B2
10062837 Kim et al. Aug 2018 B2
10115446 Louie et al. Oct 2018 B1
10134988 Fennimore et al. Nov 2018 B2
10163479 Berger et al. Dec 2018 B2
10186614 Asami Jan 2019 B2
20010016061 Shimoda Aug 2001 A1
20020090533 Zhang et al. Jul 2002 A1
20020105823 Redon et al. Aug 2002 A1
20030085186 Fujioka May 2003 A1
20030115538 Derner Jun 2003 A1
20030117840 Sharma et al. Jun 2003 A1
20030151944 Saito Aug 2003 A1
20030197984 Inomata et al. Oct 2003 A1
20030218903 Luo Nov 2003 A1
20040012994 Slaughter et al. Jan 2004 A1
20040026369 Ying Feb 2004 A1
20040061154 Huai et al. Apr 2004 A1
20040094785 Zhu et al. May 2004 A1
20040130936 Nguyen et al. Jul 2004 A1
20040173315 Leung Sep 2004 A1
20040257717 Sharma et al. Dec 2004 A1
20050041342 Huai et al. Feb 2005 A1
20050051820 Stojakovic et al. Mar 2005 A1
20050063222 Huai et al. Mar 2005 A1
20050104101 Sun et al. May 2005 A1
20050128842 Wei Jun 2005 A1
20050136600 Huai Jun 2005 A1
20050158881 Sharma Jul 2005 A1
20050180202 Huai et al. Aug 2005 A1
20050184839 Nguyen et al. Aug 2005 A1
20050201023 Huai et al. Sep 2005 A1
20050237787 Huai et al. Oct 2005 A1
20050280058 Pakala et al. Dec 2005 A1
20060018057 Huai Jan 2006 A1
20060049472 Diao et al. Mar 2006 A1
20060077734 Fong Apr 2006 A1
20060087880 Mancoff et al. Apr 2006 A1
20060092696 Bessho May 2006 A1
20060132990 Morise et al. Jun 2006 A1
20060227465 Inokuchi et al. Oct 2006 A1
20060271755 Miura Nov 2006 A1
20070019337 Apalkov et al. Jan 2007 A1
20070096229 Yoshikawa May 2007 A1
20070242501 Hung et al. Oct 2007 A1
20080049488 Rizzo Feb 2008 A1
20080079530 Weidman et al. Apr 2008 A1
20080112094 Kent et al. May 2008 A1
20080144376 Lee Jun 2008 A1
20080151614 Guo Jun 2008 A1
20080259508 Kent et al. Oct 2008 A2
20080297292 Viala et al. Dec 2008 A1
20090046501 Ranjan et al. Feb 2009 A1
20090072185 Raksha et al. Mar 2009 A1
20090091037 Assefa et al. Apr 2009 A1
20090098413 Kanegae Apr 2009 A1
20090146231 Kuper et al. Jun 2009 A1
20090161421 Cho et al. Jun 2009 A1
20090209102 Zhong et al. Aug 2009 A1
20090231909 Dieny et al. Sep 2009 A1
20100124091 Cowburn May 2010 A1
20100162065 Norman Jun 2010 A1
20100193891 Wang et al. Aug 2010 A1
20100211842 Moon Aug 2010 A1
20100246254 Prejbeanu et al. Sep 2010 A1
20100271870 Zheng et al. Oct 2010 A1
20100290275 Park et al. Nov 2010 A1
20110032645 Noel et al. Feb 2011 A1
20110058412 Zheng et al. Mar 2011 A1
20110061786 Mason Mar 2011 A1
20110089511 Keshtbod et al. Apr 2011 A1
20110133298 Chen et al. Jun 2011 A1
20110310691 Zhou et al. Dec 2011 A1
20110320696 Fee et al. Dec 2011 A1
20120052258 Op DeBeeck et al. Mar 2012 A1
20120069649 Ranjan et al. Mar 2012 A1
20120155156 Watts Jun 2012 A1
20120155158 Higo Jun 2012 A1
20120159281 Shalvi Jun 2012 A1
20120280336 Watts Jun 2012 A1
20120181642 Prejbeanu et al. Jul 2012 A1
20120188818 Ranjan et al. Jul 2012 A1
20120280339 Zhang et al. Nov 2012 A1
20120294078 Kent et al. Nov 2012 A1
20120299133 Son et al. Nov 2012 A1
20130001506 Sato et al. Jan 2013 A1
20130001652 Yoshikawa et al. Jan 2013 A1
20130021841 Zhou et al. Jan 2013 A1
20130107611 Cai May 2013 A1
20130244344 Malmhall et al. Sep 2013 A1
20130267042 Satoh et al. Oct 2013 A1
20130270661 Yi et al. Oct 2013 A1
20130307097 Yi et al. Nov 2013 A1
20130336060 Arakawa Dec 2013 A1
20130341801 Satoh et al. Dec 2013 A1
20140009994 Parkin et al. Jan 2014 A1
20140042571 Gan et al. Feb 2014 A1
20140070341 Beach et al. Mar 2014 A1
20140089762 Pangal et al. Mar 2014 A1
20140103472 Kent et al. Apr 2014 A1
20140136870 Breternitz et al. May 2014 A1
20140151837 Ryu Jun 2014 A1
20140169085 Wang et al. Jun 2014 A1
20140177316 Otsuka et al. Jun 2014 A1
20140217531 Jan Aug 2014 A1
20140252439 Guo Sep 2014 A1
20140264671 Chepulskyy et al. Sep 2014 A1
20140281284 Block et al. Sep 2014 A1
20150056368 Wang et al. Feb 2015 A1
20150143187 Mateescu et al. May 2015 A1
20150143343 Weiss et al. May 2015 A1
20150149873 Cai May 2015 A1
20150154116 Dittrich et al. Jun 2015 A1
20150206569 Bose et al. Jul 2015 A1
20150279904 Pinarbasi et al. Oct 2015 A1
20150311920 Wang Oct 2015 A1
20160087193 Pinarbasi et al. Mar 2016 A1
20160163973 Pinarbasi Jun 2016 A1
20160218278 Pinarbasi et al. Jul 2016 A1
20160283385 Boyd et al. Sep 2016 A1
20160315118 Kardasz et al. Oct 2016 A1
20160378592 Ikegami et al. Dec 2016 A1
20170062712 Choi et al. Mar 2017 A1
20170093439 Motwani Mar 2017 A1
20170123991 Sela et al. May 2017 A1
20170133104 Darbari et al. May 2017 A1
20170199459 Ryu et al. Jul 2017 A1
20170322847 Park Nov 2017 A1
20170329667 Hirano Nov 2017 A1
20180033957 Zhang Feb 2018 A1
20180097006 Kim et al. Apr 2018 A1
20180114589 El-Baraji et al. Apr 2018 A1
20180119278 Kornmeyer May 2018 A1
20180121117 Berger et al. May 2018 A1
20180121355 Berger et al. May 2018 A1
20180121361 Berger et al. May 2018 A1
20180122446 Berger et al. May 2018 A1
20180122447 Berger et al. May 2018 A1
20180122448 Berger et al. May 2018 A1
20180122449 Berger et al. May 2018 A1
20180122450 Berger et al. May 2018 A1
20180130945 Choi et al. May 2018 A1
20180211821 Kogler Jul 2018 A1
20180233362 Glodde Aug 2018 A1
20180233363 Glodde Aug 2018 A1
20180248110 Kardasz Aug 2018 A1
20180248113 Pinarbasi et al. Aug 2018 A1
20180331279 Shen Nov 2018 A1
20190044538 Palangappa Feb 2019 A1
Foreign Referenced Citations (31)
Number Date Country
2766141 Jan 2011 CA
105706259 Jun 2016 CN
1345277 Sep 2003 EP
2817998 Jun 2002 FR
2832542 May 2003 FR
2910716 Jun 2008 FR
H10-004012 Jan 1998 JP
H11-120758 Apr 1999 JP
H11-352867 Dec 1999 JP
2001-195878 Jul 2001 JP
2002-261352 Sep 2002 JP
2002-357489 Dec 2002 JP
2003-318461 Nov 2003 JP
2005-044848 Feb 2005 JP
2005-150482 Jun 2005 JP
2005-535111 Nov 2005 JP
2006128579 May 2006 JP
2008-524830 Jul 2008 JP
2009-027177 Feb 2009 JP
5297195 Apr 2009 JP
2013-012546 Jan 2013 JP
2014-039061 Feb 2014 JP
5635666 Dec 2014 JP
2015-002352 Jan 2015 JP
960002014 Feb 1996 KR
100519897 Sep 2003 KR
101373183 Jul 2009 KR
10-2014-015246 Sep 2014 KR
2009-080636 Jul 2009 WO
2011-005484 Jan 2011 WO
2014-062681 Apr 2014 WO
Non-Patent Literature Citations (11)
Entry
US 7,026,672 B2, 04/2006, Grandis (withdrawn)
US 2016/0218273 A1, 06/2016, Pinarbasi (withdrawn)
Bhatti Sabpreet et al., “Spintronics Based Random Access Memory: a Review,” Material Today, Nov. 2107, pp. 530-548, vol. 20, No. 9, Elsevier.
Helia Naemi, et al., “STTRAM Scaling and Retention Failure,” Intel Technology Journal, vol. 17, Issue 1, 2013, pp. 54-75 (22 pages).
S. Ikeda, et al., “A Perpendicular-Anisotropy CoFeB—MgO Magnetic Tunnel Junction”, Nature Materials, vol. 9, Sep. 2010, pp. 721-724 (4 pages).
R.H. Kock, et al., “Thermally Assisted Magnetization Reversal in Submicron-Sized Magnetic Thin Films”, Physical Review Letters, The American Physical Society, vol. 84, No. 23, Jun. 5, 2000, pp. 5419-5422 (4 pages).
K.J. Lee, et al., “Analytical Investigation of Spin-Transfer Dynamics Using a Perpendicular-to-Plane Polarizer”, Applied Physics Letters, American Insitute of Physics, vol. 86, (2005), pp. 022505-1 to 022505-3 (3 pages).
Kirsten Martens, et al., “Thermally Induced Magnetic Switching in Thin Ferromagnetic Annuli”, NSF grants PHY-0351964 (DLS), 2005, 11 pages.
Kristen Martens, et al., “Magnetic Reversal in Nanoscropic Ferromagnetic Rings”, NSF grants PHY-0351964 (DLS) 2006, 23 pages.
“Magnetic: Technology Spintronics, Media and Interface”, Data Storage Institute, R&D Highlights, Sep. 2010, 3 pages.
Daniel Scott Matic, “A Magnetic Tunnel Junction Compact Model for STT-RAM and MeRAM”, Master Thesis University of California, Los Angeles, 2013, pp. 43.
Related Publications (1)
Number Date Country
20190121694 A1 Apr 2019 US
Continuation in Parts (1)
Number Date Country
Parent 15792672 Oct 2017 US
Child 15855910 US