Abstract:
The disclosure is a NAND flash memory with the function of error checking and correction during a page copy operation. The NAND flash memory is able to prohibit transcription of erroneous bits to a duplicate page from a source page. Embodiments of the inventive flash memory include a correction circuit for correcting bit errors of source data stored in a page buffer, a circuit configured to provide the source data to the correction circuit and to provide correction data to the page buffer, and a copy circuit configured to copy the source data to the page buffer, and to store the correction data in the other page from the page buffer.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a Continuation of U.S. patent application Ser. No. 10/817,061, filed Apr. 2, 2004, now pending, which claims priority from Korean Patent Application No. 2003-21114, filed Apr. 3, 2003, the contents of which are herein incorporated by reference in their entirety. 
     
    
     FIELD OF THE INVENTION 
       [0002]    This disclosure generally relates to nonvolatile flash memories and more specifically, to flash memories for reliable page copy operations with error correcting functions and their methods of operating therein. 
       BACKGROUND OF THE INVENTION 
       [0003]    Flash memories are commonly applicable to mass storage subsystems for electronic devices employed in mobile communications, game sets, and so forth. Such subsystems are usually implemented as either removable memory cards that can be inserted into multiple host systems or as non-movable embedded storage within the host systems. In both implementations, the subsystem includes one or more flash devices and often a subsystem controller. 
         [0004]    Flash memories are composed of one or more arrays of transistor cells, each cell capable of non-volatile storage of one or more bits of data. Therefore, flash memories do not require power to retain the data programmed therein. Once programmed however, a cell must be erased before it can be reprogrammed with a new data value. These arrays of cells are partitioned into groups to provide for efficient implementation of read, program and erase functions. The typical flash memory architecture for mass storage arranges large groups of cells into erasable blocks. Each block is further partitioned into one or more addressable sectors that are the basic unit for read and program functions. 
         [0005]    Flash memories basically have their own functional operations of reading, writing (or programming), and erasing. Flash memories additionally extend their facilities to practice a page copy operation (or a copy-back operation). The page copy operation is to transcript data stored in a page assigned to a specific address to another page assigned to another address. During the page copy, data stored in a page of a specific address are transferred to a page buffer and then the data remaining in the page buffer are written into another page assigned to another address by way of a programming process without reading the data out of the flash memory. The page copy function eliminates a need of reading-out data to be written and of loading data to be written from the external source of the flash memory, which is advantageous to enhancing systemic data rates associated with the subsystem controller. 
         [0006]    However, unfortunately, it may occur that the pages to be copied and to be written have their own error bits. As shown in  FIG. 1 , assuming that a page PG 4  is to be copied and a page PGn- 3  is to be written, both pages each having one error bit, the data stored in the page PG 4  is transferred to the page buffer  10  and then written into the page PGn- 3  from the page buffer  10 . As a result of the page copy operation, two error bits are included in the page PGn- 3 . Because most flash memory controllers used as subsystem controllers in a card-type memory are usually only designed to correct one-bit error for a page, such a two-bit error in a page may be incapable of being cured after completing the copy back operation. 
         [0007]    Although a flash memory controller could be equipped with an error correcting function capable of coping even with the two-bit error per page, it would cause the circuit architecture to be much more complex and thereby deteriorate operational efficiencies in the memory control system. 
         [0008]    Embodiments of the invention address these and other limitations of the prior art. 
       SUMMARY OF THE INVENTION 
       [0009]    Embodiments of the present invention provide a nonvolatile memory capable of maintaining the integrity of data through a page copy operation, and a method thereof. Such a nonvolatile memory is capable of preventing a transcription of error bits during a page copy operation. 
         [0010]    According to an aspect of the present invention, a nonvolatile memory includes a number of pages storing data; a page buffer temporarily storing data by the page; a circuit for correcting a bit error of source data of a specific one of the pages; circuitry configured to provide the source data to the circuit and to provide amended data to the page buffer from the circuit; and a copy circuit configured to copy the source data into the page buffer and to store the amended data into another page from the page buffer. 
         [0011]    The circuit generates new parities from the source data and compares the new parities with the old parities. Additionally, the device includes a circuit for generating column parities for bits composing one byte of the source data; and a circuit for generating line parities for bytes of the source data. 
         [0012]    In the embodiment, a nonvolatile memory includes: a data field composed of a number of pages for storing data; a first circuit configured to storing first parities in a predetermined region of the data field, the first parities being generated during a programming operation for the page; a page buffer for temporarily storing data by the page; a second circuit configured to copy source data stored in a specific one of the pages into the page buffer; a third circuit configured to generate second parities from the source data stored in the page buffer; and a fourth circuit configured to transfer amended data of the source data to the page buffer in response to a result of comparing the first parities with the second parities. A fifth circuit is further included to store the amended data held in the page buffer into another page of the pages. 
         [0013]    In the embodiment, a method of transferring source data of a specific page, the source data containing old parities, to another page in a nonvolatile memory having a page buffer temporarily storing data by the page, includes the processes of: storing the source data into the page buffer; generating new parities from the source data stored in the page buffer; comparing the old parities with the new parities; creating modified data of the source data in response to a result of the comparing; and moving the modified data to the another page through the page buffer. From the embodiment, it is available to inform an error status by the comparing result of the outside of the memory. 
         [0014]    In this embodiment, a nonvolatile memory includes: a data storage field composed of a number of pages storing data; a page buffer for storing data of a specific one of the pages, being connected to the data storage field; and error correction circuit connected to the page buffer and including: a bit error detector configured to detect an bit error of the data of the specific page; and a bit error corrector configured to amend the bit error. The bit error detector includes: a parity generator for creating new parities from the data stored in the page buffer; and a comparator for generating error address information by comparing the new parities with old parities of the data. 
         [0015]    The error address information is referred by the bit error corrector to correct the data and to transfer amend data to the page buffer. The modified data are transcribed into the specific page and another page. 
         [0016]    The present invention will be better understood from the following detailed description of the exemplary embodiment thereof taken in conjunction with the accompanying drawings. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0017]    The forgoing and other features and advantages of the invention will be apparent from the more particular description of a preferred embodiment of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention: 
           [0018]      FIG. 1  is a block diagram illustrating a conventional page copy-back feature in a NAND flash memory device. 
           [0019]      FIG. 2  is a block diagram illustrating a page copy-back feature with error correction according to embodiments of the present invention. 
           [0020]      FIG. 3  is a block diagram illustrating an error correction circuit according to embodiments of the present invention. 
           [0021]      FIG. 4  is a circuit diagram illustrating gating circuits for performing data transmission between page buffers and the error correction circuit of  FIG. 3 . 
           [0022]      FIG. 5  is a timing diagram of data transmission between the page buffers and the error correction circuit of  FIG. 3 . 
           [0023]      FIG. 6  is a table illustrating a procedure of generating column and line parities according to embodiments of the invention. 
           [0024]      FIG. 7  is a circuit diagram illustrating a circuit for generating the column parities shown in  FIG. 6 . 
           [0025]      FIG. 8  is a circuit diagram illustrating a circuit for generating the line parities shown in  FIG. 6 . 
           [0026]      FIG. 9  is a timing diagram of signals used in data transmission between the page buffers and the error correction circuit. 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0027]    It should be understood that the description of the preferred embodiment is merely illustrative and that it should not be taken in a limiting sense. In the following detailed description, several specific details are set forth in order to provide a thorough understanding of the present invention. It will be obvious, however, to one skilled in the art that the present invention may be practiced without these specific details. 
         [0028]    A flash memory applicable to the present invention is embodied on a NAND flash memory, adaptable to be embedded in portable electronic devices such as integrated circuit cards, in which a number of memory cells are arranged in the pattern of strings coupled to a plurality of wordlines and bitlines disposed in a matrix of rows and columns. 
         [0029]    A NAND flash memory according to embodiments of the present invention has a memory cell array divided into a plurality of pages designated by addresses. Each page is formed of a number of memory cells coupled to a wordline and coupled to a plurality of bitlines each by each. The page is a unit of reading and writing. 
         [0030]    A NAND flash memory according to embodiments of the present invention is designed to carry out functional operations such as erasing to remove data stored in memory cells, programming to write data in memory cells, reading data out of the memory (i.e. a read-out operation), verifying to check out the status of memory cells after completing the erasing and programming, and page-copying to transcript data of a page into another page without a read-out operation. 
         [0031]    A NAND flash memory according to embodiments of the present invention includes a page buffer circuit for temporally storing data to be read from memory cells or loaded from outside the memory in the operations of programming, reading-out, or page-copying. Also including are buffers and decoders for selecting pages or memory cells with addresses supplied from the outside, sense amplifiers for detecting data values, gate circuitry for transferring data from/to the memory cell array to/from input/output channels, and control circuits for managing the operations therein. 
         [0032]    Embodiments of to the present invention include an error correcting operation associated with the page copy function. 
         [0033]    In this embodiment, the term “read-out” is used to identify an operation of reading data out of the memory, i.e. the state that data from memory cells go out of the memory. The term “copy” is used to identify an operation of transferring data of a specific page into the page buffer, and “transcription” is used to identify an operation of moving the data held in the page buffer into another page. Further, “source data” is used to identify data to be copied with an error bit, and “modified (or correct or amended) data” is used to identify data to be transcribed without any error bit. 
         [0034]    Now, practical embodiments of the invention will be explained in conjunction with the drawings  FIGS. 2 through 9 . 
         [0035]      FIG. 2  illustrates a schematic feature of correcting a bit error during a page copy operation mode according to embodiments of the present invention. First, data stored in, for example, the page PG 4 , i.e., the source data, are loaded into the page buffer  10  by way of a read operation (this reading is distinguishable from the read-out operation used elsewhere in the present specification), which is referred as the “copy” operation. The data stored in the page buffer  10 , i.e., the source data of the page PG 4  (hereinafter referred as “source page), are put into an error correction circuit  20  to cure an error bit embedded in the source data before they are written into another page (e.g., PGn- 3 ; hereinafter referred to “transcription page”). The data modified by the error correction circuit  20  are transferred back into the page buffer  10  and then written into the page PGn- 3 . As a result, the page PGn- 3  is rendered to be free from the error bit embedded in the source data, preventing from the transcription of an error bit by the source data. 
         [0036]    Even if the page PGn- 4  to be transcribed has its own error bit, a known function of error correcting may cure the single bit error thereof More details about the error correcting procedure during the page copy operation will be described hereinbelow. 
         [0037]      FIG. 3  illustrates a functional structure for conducting the error correction during the page copy operation. Referring to  FIG. 3 , once the source data De temporally stored in the page buffer  10  are provided to the error correction circuit  20 , a comparator  50  compares old parities OP, which have been created during the former programming (or writing) cycle and stored in a predetermined field of the memory, with new parities NP that are generated by a parity generator  40  during the copy operation. The new parities NP are parity data to be used to correct a bit error, i.e., a progressive bit error generated during the page copy operation with the source data. The old and new parities, OP and NP, are generated by the same manner. After comparing the old parities OP with the new parities NP, an information signal Ae of the page address involved in the progressive bit error is generated from the comparator  50 . The erroneous address information signal Ae is applied to an error correction logic circuit  60  to cure the bit error. The amended data Dc from the error correction logic circuit  60  are transferred to the page buffer  10  together with control signals CNT therefrom. More details about the parity generation and comparison is described hereinbelow. 
         [0038]      FIG. 4  is a circuit diagram of latching and column-decoding blocks LDB 0 ·LDBm- 1 , being disposed between the page buffering and sensing logic block  12  (included in the page buffer  10 ) and input/output lines I/O 0 ˜I/On- 1 , for transferring the source and correct data. Referring to  FIG. 4 , the source data of the source page (e.g., PG 4 ) assigned to a specific address are transferred to the error correction circuit  20  from the page buffering and sensing block  12  through the latching and column-decoding blocks LDB 0 ˜LDBm- 1  each corresponding to the input/output lines I/O 0 ˜I/On- 1 . The latching and column-decoding blocks LDB 0 ˜LDBm- 1  also transfers the amended data Dc provided from the error correction circuit  20  to the transcript page (e.g., PGn- 1 ) through the page buffering and sensing block  12 . 
         [0039]    The source data De of the source page PG 4  are read by the page buffering and sensing block  12  and stored in latches LCH 0 ˜LCHn- 1  each corresponding to the bitlines BL 0 ˜BLn- 1 . The source data staying at the latches LCH 0 ˜LCHn- 1  are transferred to the input/output lines I/O 0 ˜I/On- 1  through column gates (or Y-gates) AG 0 ˜AGn- 1  and BG 0 ˜BGk- 1  in response to column gating signals YA 0 ˜YAn- 1  (primary) and YB 0 ˜YBk- 1  (secondary) by a unit of bit sequentially, as shown in  FIG. 5 , which may be referred to as “error-data out” as an operational state. For instance, a source data bit corresponding to the bitline BL 0  is transferred to the error correction circuit  20  through the input/output line I/O 0  when both of the column gating signals YA 0  and YB 0  are active with high levels. 
         [0040]    The amended data Dc are transferred through the input/output lines I/O 0 ˜I/On- 1  from the error correction circuit  20  to the latches LCH 0 ˜LCHn- 1  each coupled to the bitlines BL 0 ˜BLn- 1 , which may be referred to as “amended-data in” as an operational state. For instance, an amended data bit corresponding to the bitline BL 0  is transferred to the page buffer  10  (i.e., the page buffering and sensing block  12 ) through the input/output line I/O 0  when both of the column gating signals YA 0  and YB 0  are active with high levels. The amended data Dc temporarily stored in the latches are written into the transcript page PGn- 1  by way of a programming process.  FIG. 6  shows a practical fashion of generating the new parities NP according to embodiments of the present invention. The old parities OP are previously stored in a predetermined field of the memory, which were made in a former programming operation. Known techniques for generating parities are briefly divided into two ways: one is a serial way and the other is a parallel way. Embodiments of the present invention employs the serial way in order to save a topological circuit area, but either embodiment is acceptable. 
         [0041]    Illustrating that the source data De from which the parities are established is composed of 8-bits by 512-bytes, the parities are classified into column parities and line parities. The column parities are obtained from the 8 bits of one byte, while the line parities from the 512 bytes. 
         [0042]    The column and line parities can be made in the circuits shown in  FIGS. 7 and 8  respectively, both circuits being included in the parity generator  40  shown in  FIG. 4 . The generation of the column and line parities is accomplished by conducting exclusive-OR (XOR) logic chains with binary combinations to obtain a bit error from the packages of bits or bytes. 
         [0043]    Now will be described about creating the column parities from the eight bits b 0 ˜b 7  with reference to  FIGS. 6 and 7  and Table 1 following. 
         [0000]    
       
         
               
               
               
             
               
               
               
               
             
           
               
                   
                 TABLE 1 
               
             
             
               
                   
                   
               
               
                   
                 Arithmetic Combination 
                   
               
             
          
           
               
                   
                 Column Parity 
                 b7 b6 b5 b4 
                 b3 b2 b1 b0 
               
               
                   
                   
               
               
                   
                 CP1 
                 * * 
                 * * 
               
               
                   
                 nCP1 
                 * * 
                 * * 
               
               
                   
                 CP2 
                 * * 
                 * * 
               
               
                   
                 nCP2 
                 * * 
                 * * 
               
               
                   
                 CP4 
                 * * * * 
               
               
                   
                 nCP4 
                   
                 * * * * 
               
               
                   
                   
               
               
                   
                 The letter “*” represents the XOR operator to obtain the comparison result from the relevant bit combination. Therefore, complete arithmetic equations of the XOR logic are summarized as follows each for the column parities of six bits. 
               
               
                   
                 CP1 = b7 * b5 * b3 * b1 
               
               
                   
                 nCP1 = b6 * b4 * b2 * b0 
               
               
                   
                 CP2 = b7 * b6 * b3 * b2 
               
               
                   
                 nCP2 = b5 * b4 * b1 * b0 
               
               
                   
                 CP4 = b7 * b6 * b5 * b4 
               
               
                   
                 nCP4 = b3 * b2 * b1 * b0 
               
             
          
         
       
     
         [0044]    Referring to  FIG. 7 , implementing the arithmetic combinations to generate each column parity is associated with four XOR gates XR and one flipflop FF. Each input/output line corresponds to each data bit. The column parity nCP 4  is generated from a flipflop FF 6  receiving an output of an XOR gate XR 19 . The gate XR 19  receives an output of an XOR gate XR 13  and the column parity nCP 4  fed-back thereto from the flipflop FF 6 . The gate XR 13  receives outputs of XOR gates XR 1  and XR 2 . The input/output lines I/O 2  and I/O 3  are coupled to inputs of the gate XR 2 , while the input/output lines I/O 0  and I/O 1  to inputs of the gate XR 1 , The column parity CP 4  complementary to the nCP 4  is generated from a flipflop FF 5  receiving an output of an XOR gate XR 20 . The gate XR 20  receives an output of an XOR gate XR 14  and the column parity CP 4  fed-back thereto from the flipflop FF 5 . The gate XR 14  receives outputs of XOR gates XR 3  and XR 4 . The input/output lines I/O 4  and I/O 5  are coupled to inputs of the gate XR 3 , while the input/output lines I/O 6  and I/O 7  to inputs of the gate XR 4 . 
         [0045]    The column parity nCP 2  is generated from a flipflop FF 4  receiving an output of an XOR gate XR 21 . The gate XR 21  receives an output of an XOR gate XR  15  and the column parity nCP 2  fed-back thereto from the flipflop FF 4 . The gate XR 15  receives outputs of XOR gates XR 5  and XR 6 . The input/output lines I/O 0  and I/O 1  are coupled to inputs of the gate XR 5 , while the input/output lines I/O 4  and I/O 5  to inputs of the gate XR 6 . The column parity CP 2  complementary to the nCP 2  is generated from a flipflop FF 3  receiving an output of an XOR gate XR 22 . The gate XR 22  receives an output of an XOR gate XR 16  and the column parity CP 2  fed-back thereto from the flipflop FF 3 . The gate XR 16  receives outputs of XOR gates XR 7  and XR 8 . The input/output lines I/O 2  and I/O 3  are coupled to an input of the gate XR 7 , while the input/output lines I/O 6  and I/O 7  to an input of the gate XR 8 . 
         [0046]    The column parity nCP 1  is generated from a flipflop FF 2  receiving an output of an XOR gate XR 23 . The gate XR 23  receives an output of an XOR gate XR 17  and the column parity nCP 1  fed-back thereto from the flipflop FF 2 . The gate XR 17  receives outputs of XOR gates XR 9  and XR 10 . The input/output lines I/O 0  and I/O 2  are coupled to inputs of the gate XR 9 , while the input/output lines I/O 4  and I/O 6  to inputs of the gate XR 10 . The column parity CP 1  complementary to the nCP 2  is generated from a flipflop FF 1  receiving an output of an XOR gate XR 24 . The gate XR 24  receives an output of an XOR gate XR 18  and the column parity CP 1  fed-back thereto from the flipflop FF 1 . The gate XR 18  receives outputs of XOR gates XR 11  and XR 12 . The input/output lines I/O 1  and I/O 3  are coupled to an input of the gate XR 11 , while the input/output lines I/O 5  and I/O 7  to an input of the gate XR 12 . 
         [0047]    A clock signal CLK and a reset signal RST are applied to the flipflops FF 1 ˜FF 6  in common. Thus, the flipflops FF 1 ˜FF 6  outputs the column parities in response to rising edges of every cycle of the clock signal CLK. the feedback input of each column parity to the XOR gate positioned before its corresponding flipflop (e.g., nCP 4  to XR 19  from FF 6 ) is directed to detect the variation between a current bit and the next bit in the source data (i.e., to detect a progressive bit error during the page copy operation) and then to manage it with the serial way of parity generation. 
         [0048]    As a practical example in the column parity generation, the column parities CP 1 , CP 2  and nCP 4  will be set to “1”, provided the bit b 3  is an error bit. 
         [0049]    The generation of the line parities from the 512 bytes will be described with reference to  FIGS. 6 and 8  and the following Table 2. Table 2 arranges byte combinations for XOR arithmetic implements in order to obtain the line parities LP 1 , nLP 1 , LP 2 , nLP 2 , LP 4 , nLP 4 , LP 512 , and nLP 512  (LP 1 ˜nLP 512 ; 18 bits) against the 512 bytes of the source data. 
         [0000]    
       
         
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                   
                 TABLE 2 
               
             
             
               
                   
                   
               
               
                   
                 Arithmetic Combination 
               
             
          
           
               
                   
                   
                 {circumflex over ( )}B511 
                   
                   
                   
                   
                   
                   
                   
                   
               
               
                 Line 
                   
                 {circumflex over ( )}B510 
                   
                   
                 {circumflex over ( )}B255 
                   
                   
                   
                 {circumflex over ( )}B3 
               
               
                 Parity 
                 {circumflex over ( )}B512 
                 {circumflex over ( )}B509 
                 . . . 
                 {circumflex over ( )}B256 
                 {circumflex over ( )}B254 
                 {circumflex over ( )}B253 
                 . . . 
                 {circumflex over ( )}B4 
                 {circumflex over ( )}B2 
                 {circumflex over ( )}B1 
               
               
                   
               
               
                 LP1 
                 * 
                 * 
                 . . . 
                 * 
                 * 
                   
                 . . . 
                 * 
                 * 
                   
               
               
                 nLP1 
                   
                 ** 
                 . . . 
                   
                 * 
                 * 
                 . . . 
                   
                 * 
                 * 
               
               
                 LP2 
                 * 
                 * 
                 . . . 
                 * 
                 * 
                   
                 . . . 
                 * 
                 * 
               
               
                 nLP2 
                   
                 ** 
                 . . . 
                   
                 * 
                 * 
                 . . . 
                   
                 * 
                 * 
               
               
                 LP4 
                 * 
                 *** 
                 . . . 
                 * 
                 ** 
                 * 
                 . . . 
               
               
                 nLP4 
                   
                   
                 . . . 
                   
                   
                   
                 . . . 
                 * 
                 ** 
                 * 
               
             
          
           
               
                 . . . 
                 . . . 
               
             
          
           
               
                 LP512 
                 * 
                 *** 
                 . . . 
                   
                   
                   
                 . . . 
                   
                   
                   
               
               
                 nLP512 
                   
                   
                 . . . 
                 * 
                 ** 
                 * 
                 . . . 
                 * 
                 ** 
                 * 
               
               
                   
               
             
          
         
       
     
         [0050]    In Table 2, the letter “*” notes the XOR operator to obtain the comparison result from the relevant bit combination, and “̂B” represents a result of an XOR operation for eight bits of their corresponding byte (e.g., ̂B 512 =b 7 *b 6 *b 5 *b 4 *b 3 *b 2 *b 1 *b 0  in the 512&#39;th byte). The factor ̂ 13  will be referred to as “byte parity unit” hereinafter. 
         [0051]    Therefore, complete arithmetic equations of the XOR logic from Table 2 are summarized as follows each for the line parities of 18 bits.
   LP 1 =̂B 512 *̂B 510 * . . . *̂B 256 *̂B 254 * . . . *̂B 4  * 132     nLP 2 =̂B 511 *̂B 509 * . . . *̂B 255 *̂B 253 * . . . *̂B 3 *̂B 1     LP 2 =̂B 512  ̂B 511 * . . . *̂B 256 *̂B 255 * . . . *̂B 4  ̂B 3     nLP 2 =̂B 510 *̂B 509 * . . . *̂B 254 *̂B 253 * . . . *̂B 2 *̂B 1     LP 4 =̂B 512 *̂B 511 *̂B 510 *̂B 509 * . . . *̂B 256 *̂B 255 *̂B 254 *̂B 253  * . . . * ̂B 8 *̂B 7  *̂B 6 *̂B 5     nLP 4 =̂B 508 *̂B 507 *̂B 506 *̂B 505 * . . . *̂B 252 *̂B 251 *̂B 250 *̂B 249  *. . . * ̂B 4 *̂B 3  *̂B 2 *̂B 1     LP 512 =̂B 512 *̂B 511  *̂B 510 *̂B 509 * . . . * ̂B 260 *̂B 259 
       *̂B 258 *̂B 257     
       nLP 512 =̂B 256 *̂B 255  *̂B 254 *̂B 253 * . . . * ̂B 4 *̂B 3 
       *̂B 2 *̂B 1     
       
 
         [0062]    Referring to  FIG. 8 , the byte parity unit ̂B for each byte is first obtained through XOR gates XR 31 ˜XR 37 . The byte parity unit ̂B is generated from the gate XR 37 . The gate XR 37  receives outputs of the gates XR 35  and XR 36 . The gate XR 35  receives outputs of the gates XR 31  and XR 32 , and the gate XR 36  receives outputs of the gates XR 33  and XR 34 . Inputs of the gate XR 31  are coupled to the input/output lines I/O 0  and I/O 1 , and inputs of the gate XR 32  are coupled to the input/output lines I/O 2  and I/O 3 . Inputs of the gate XR 33  are coupled to the input/output lines I/O 4  and I/O 5 , and inputs of the gate XR 34  are coupled to the input/output lines I/O 6  and I/O 7 . 
         [0063]    The output of the gate XR 37 , ̂B, is branched into 18 ways to establish the 18 line parities LP 1 ˜nLP 512 , being applied to inputs of NAND gates ND 1 ˜ND 18  in common. If there is an error bit among the eight bits of their corresponding byte, the byte parity unit ̂B is set to “1”. The NAND gates ND 1 ˜ND 18  respond each to clock control signals nCLK 1 , CLK 1 , nCLK 2 , CLK 2 , . . . , nCLK 512 , and CLK 512  (nCLK 1 ˜CLK 512 ; 18 ea) to control bit paths from the byte parity unit ̂B to the line parities. Outputs of the NAND gates ND 1 ˜ND 18  are applied to inputs of XOR gates XR 1 ˜XR 18  respectively. The gates XR 1 ˜XR 18  also receive the line parities nLP 1 ˜LP 18  fed-back thereto from flipflops FF 1 ˜FF 18  receiving outputs of the gates XR 1 ˜XR 18 , respectively. 
         [0064]    As the clock signal CLK and the reset signal RST are applied to the flipflops FF 1 ˜FF 18  in common, the flipflops FF 1 ˜FF 18  outputs the line parities in response to rising edges of every cycle of the clock signal CLK. The feedback input of each column parity to the XOR gate positioned before its corresponding flipflop (e.g., LP 512  to XR 1018  from FF 1018 ) is directed to detect the variation between a current bit and the next bit in the source data (i.e., to detect a progressive bit error during the page copy operation) and then to manage it with the serial way of line parity generation. As a practical example in the line parity generation, if the byte B 3  has an error bit, the line parities nLP 1 , LP 2 , nLP 4 , . . . , nLP 512  will be set to “1”. 
         [0065]    The timing diagram of  FIG. 9  shows pulsing states of the column gating signals and clock control signals for transferring the source data from the page buffer  10  to the error correction circuit  20 , associated with the operations in the circuits of  FIGS. 4 through 8 . The transmission procedure shown in  FIG. 9  is exemplarily carried out by way of the latching and column-decoding block LDB 1  shown in  FIG. 4 . 
         [0066]    Referring to  FIG. 9 , as the primary column gating signals YA 0 ˜YAn- 1  are successively active with high levels for the secondary column gating signal YB 0  is being enabled with a high level, data bits corresponding to the bitlines BL 0 ˜BLn- 1  are sequentially transferred to the error correction circuit  20  through their corresponding input/output lines I/O 0 ˜I/On- 1 . By the same manner, in accordance with the sequential activation of the primary column gating signals YA 0 ˜YAn- 1  for each active state of the secondary column gating signals YB 0 ˜YBk- 1 , all the 512 bytes of the source data are transferred to the error correction circuit  20  through the input/output lines I/O 0 ˜I/On- 1 . 
         [0067]    In the error correction circuit  20 , responding to the periodic oscillation of the clock signal CLK, the flipflops FF 1 ˜FF 6  of the column parity generator shown in  FIG. 7  output the column parities CP 1 ˜nCP 4 . At the same time, the clock control signals CLK 1 ˜nCLK 512  demultiplied from the clock signal CLK enable the bit paths to be conductive through the NAND gates ND 1 ˜ND 18  of the line parity generator shown in  FIG. 8 , and the flipflops FF 1 ˜FF 18  of the line parity generator outputs the line parities LP 1 ˜nLP 512  of 18 bits. 
         [0068]    The bit number of the new parities NP is 24 that is composed of the eight column parities CP 1 ˜nCP 4  and the eighteen line parities LP 1 ˜nLP 512 , which is the same with the old parities OP that have been stored in a predetermined field of the flash memory. 
         [0069]    An overall sequence for carry out the page copy operation with the error correction is as follows. 
         [0070]    First, the old parities OP are generated and stored in a predetermined field of the memory during a programming period. After then, the new parities NP are generated by the circuits and procedure aforementioned as shown in  FIGS. 6 through 8 . The old and new parities are compared from each other by 24 bits. 
         [0071]    In comparing the old parities OP with the new parities NP by the parity comparator  50 , if all 24 bits of the old and new parities are identical (i.e., the XOR operations with the old and new parities result in “0”), it is regarded as no error bit. On the other hand, it is regarded as one-bit error when the comparison result is “ 1 ” for 12 bits (a half of the 24 bits) between the old and new parities. Such a one-bit error is cured by the correction logic circuit  60 . Otherwise, only a comparison result for one bit among the 24 bits becomes “1”, it is regarded as a single error that has been already contained in the source data of the page to be copied. Other case except the former cases of comparison results may be regarded as there are more than two error bits. 
         [0072]    Such bit error conditions may be available to be identified by a user in response to a command. Further, it may be practicable to transcribe the amended data into the source page as well as the transcription page. 
         [0073]    The error correction circuit may be embedded in the flash memory according to embodiments of the present invention. 
         [0074]    As described above, since an error bit contained in the source data of a source page is detected and cured by the error correction circuit before being written into a transcription page, it prevents the error bit of the source data from being transcribed into the transcription page. 
         [0075]    Moreover, the flash memory according to present invention efficiently eliminates a progressive bit error that could occur during a page copy operation. 
         [0076]    And, according to the embodiment aforementioned, there is no need of buffering components for error correction during a page copy operation because the page buffer, which is basically employed in a normal flash memory, is efficiently usable to assist the operation without additional modifications. 
         [0077]    Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as described in the accompanying claims.