Claims
- 1. A method of writing at least one data word of 2p bits in a memory, the memory comprising a memory plane with at least one memory word of 2p cells, each connected to a respective bit line, and wherein the memory plane comprises a column register comprising 2q high-voltage latches and 2p-2q low-voltage latches, where p is a non-zero whole number and where q is a whole number less than p, each of the high-voltage latches comprising high-voltage memorization means for memorizing a binary data and each of the low-voltage latches comprising low-voltage memorization means for memorizing a binary data, the method comprising the following steps:1) erasing all the cells of a memory word; 2) loading 2q data in the 2q high-voltage latches, and loading 2p-2q other data in the 2p-2q low-voltage latches; and 3) programming 2q cells of the memory as a function of the data memorized in the 2q high-voltage latches; as well as repeating 2p-q−1 times the following steps: 4) loading, in the 2q high-voltage latches, of 2q of the other data that were loaded in 2q low-voltage latches at step 2); and 5) programming 2q other cells of the memory as a function of the data memorized in the 2q high-voltage latches.
- 2. The method according to claim 1, wherein p is equal to 3 and wherein q is equal to 2.
- 3. The method according to claim 1, wherein steps 1) and/or 3) to 5) are implemented simultaneously for several or the totality of the memory words of a same line of cells of the memory.
- 4. The method according to claim 1, wherein the programming step 5) is followed by a step 6) of resetting to zero the respective memorization means of the low-voltage latches and of the high-voltage latches.
- 5. The method according to claim 4, wherein steps 1) and/or 3) to 5) are implemented simultaneously for several or the totality of the memory words of a same line of cells of the memory.
- 6. The method according to claim 4, wherein p is equal to 3 and wherein q is equal to 2.
- 7. The method according to claim 6, wherein steps 1) and/or 3) to 5) are implemented simultaneously for several or the totality of the memory words of a same line of cells of the memory.
Priority Claims (1)
Number |
Date |
Country |
Kind |
99 12149 |
Sep 1999 |
FR |
|
Parent Case Info
This is a divisional of application Ser. No. 09/675,366, filed Sep. 29, 2000, now U.S. Pat. No. 6,307,792. The entire disclosure of prior application Ser. No. 09/675,366 is herein incorporated by reference.
US Referenced Citations (14)
Foreign Referenced Citations (1)
Number |
Date |
Country |
362080899 |
Apr 1987 |
JP |
Non-Patent Literature Citations (1)
Entry |
French Search Report dated Jun. 16, 2000 with Annex to French Application No. 99-12149. |