| 摘要 |
Disclosed is a method utilizing dynamic masking for efficiently programming an N-bit memory array and, more generally, for mapping successive subsets of data segments into a succession of N-bit auxiliary bytes. When the number of programming bits in an incoming byte exceeds K, a mask maps the bit pattern of the incoming byte into sequential N-bit auxiliary bytes. A first auxiliary byte retains the bit pattern of the incoming byte up to the Kth programming bit, and the remaining bit positions of the first auxiliary byte exhibit a state complementary to the programming bits. A second auxiliary byte retains the bit pattern of the incoming byte starting with the first location after the Kth programming bit and continuing up to the Kth additional programming bit (if any); all remaining bit positions of the second auxiliary byte (including the bit positions that contained programming bits in the first auxiliary byte) exhibit the complementary state. Further auxiliary bytes can be created to accommodate all K programming bits, if necessary.
|
