Abstract:
Counting status circuits are electrically coupled to corresponding status elements. The status elements selectably store a bit status of a bit line coupled to a memory array. The bit status can indicate one of at least pass and fail. The counting status circuits are electrically coupled to each other in a sequential order. Control logic causes processing of the counting status circuits in the sequential order to determine a total of the memory elements that store the bit status. The total number of memory elements that store the bit status indicate the number of error bits or non-error bits, which can help determine whether there are too many errors to be fixed by error correction codes.

Description:
RELATED APPLICATION 
       [0001]    This application claims the benefit of U.S. Provisional Patent Application No. 61/775,728, filed 11 Mar. 2013, incorporated herein by reference. 
     
    
     BACKGROUND 
       [0002]    1. Field of the Invention 
         [0003]    This technology relates to page buffer output, and more particularly relates to counting errors in page buffer output. 
         [0004]    2. Description of Related Art 
         [0005]    As technology shrinks, the random defects of memory cells increase, for example, open bit-line contacts in a NAND Flash array. This kind of defect can be either repaired with redundant cells, or tolerated if the number of defects is limited during a program or erase operation. If tolerated, the total number of defects for both erase and program operations in one page should be less than the ECC number requirement for each page, so that the ECC in read operation can fix the errors from the defects. If tolerated, also the page buffer counts the number of the error bits during program and erase verify operations. 
         [0006]      FIG. 1  is a simplified circuit diagram of a circuit that measures a number of errors in page buffer output. The circuit of  FIG. 1  is fast but not accurate, as follows. 
         [0007]    The page buffer output status latches  12 ,  14 ,  16 ,  18 ,  20 , and  22  indicate whether a corresponding page buffer output status bit has a bit status. In one example, the bit status indicates an error status of a corresponding bit line, such as one of at least pass and fail. The page buffer output status latches  12  and  22  have the failed bit status, and output the high value. The page buffer output status latches  14 ,  16 ,  18 , and  20  have a pass bit status, and output the low value. The value of the page buffer output status latches is coupled to a corresponding Fail Bit Detection Unit (FBDU). 
         [0008]    FBDU circuits  24 ,  26 ,  28 ,  30 ,  32 , and  34  are coupled to a corresponding one of the page buffer output status latches  12 ,  14 ,  16 ,  18 ,  20 , and  22 . An FBDU includes two serially connected NMOS transistors. In each FBDU, one of the two serially connected NMOS transistors has a gate coupled to signal VNC  36  which enables all of the FBDU circuits  24 ,  26 ,  28 ,  30 ,  32 , and  34 . In each FBDU, the other one of the two serially connected NMOS transistors has a gate coupled to a corresponding one of the page buffer output status latches  12 ,  14 ,  16 ,  18 ,  20 , and  22 ; this serially connected NMOS transistor is turned on when the corresponding one of the page buffer output status latches has a failed bit status, and turned off otherwise. Transistors other than MOS may be used. 
         [0009]    Supply voltage VDD  40  provides current of (N+½)*I through PMOS VPC  38 , where N is the maximum number of failed bits that can be indicated by the page buffer output status latches; in some cases N can be the maximum number of error bits which can be repaired via error correction. For each page buffer output status latch with a bit status failure, the corresponding FBDU sinks “I” current. K failures in the page buffer output status latches sink a total current of K*I. The difference between the supplied and sunk currents is (N−K+½)*I, which flows into the DET input terminal of the NAND gate  42 . 
         [0010]    NAND gate  42  also has another, EN input and an output coupled to latch  44 , which in turn has an output of PASS or FAIL. 
         [0011]    The output is as follows:
       K&lt;(N+½)-&gt;Pass   K&gt;(N+½)-&gt;Fail       
 
         [0014]    The circuit of  FIG. 1  is fast, because of simultaneous detection of all page buffer output status latches of the page buffer. Disadvantage of the circuit of  FIG. 1  include: 
         [0015]    i) The sunk current is from a current mirror. 
         [0016]    ii) Mismatches among the transistors impact the current accuracy. 
         [0017]    iii) When N is large, there is a small difference in the input currents at the DET input terminal between a PASS result and a FAIL result, which impacts the detection accuracy. 
         [0018]      FIG. 2  is a simplified circuit diagram of a circuit that detects the position of an error in page buffer output through binary search. The circuit of  FIG. 2  is accurate but not fast, as follows. 
         [0019]    Each page buffer output status latch is coupled to a corresponding instance of the “FBDU” circuit of  FIG. 2  including a latch  48 , which can be individually selected via SELECT signal  52 , individually reset via the RESET signal  50 , and loaded via LOAD signal  46 . All of the “FBDU” circuits are coupled to the same DET output  54 . 
         [0020]    Signal SELECT  52  is the decoded address signal. If the address is selected, the SELECT value is “H”; and if the address is not selected, the SELECT value is “L”. 
         [0021]    In the first step, the LOAD signal value is “H” and the failure status information is loaded from the corresponding page buffer output status bit to the latch  48 . 
         [0022]    The second step begins the process of detecting the failure status bit. First all addresses are selected, such that any failure status bit pulls down the DET signal  54  to 0. If the DET signal  54 ≠1, then at least one failure status bit exists. Then in a binary search, the failure address is located. Then the bit status of the located FBDU is reset, and the failure count is incremented. 
         [0023]    Finally, the second step is repeated, until no failure is found when all addresses are selected, such that the DET signal  54 =1. 
         [0024]    Because the circuit of  FIG. 2  counts failure status bits on a digital logic-like basis, the circuit of  FIG. 2  is very accurate. However, for N address bits (representing 2 N  addresses), each failure status bit requires checking the logic N+1 times for each failure due to the binary search for each failure status bit. Such a repeated search is time consuming. 
         [0025]      FIG. 3  is a schematic of different steps in a process of detecting the position of an error in page buffer output through binary search, showing the contents of the memory elements in the multiple stages of the circuit series that counts the number of errors in page buffer output, and the output value of the last stage of the circuit series. 
         [0026]    A different FBDU with its own latch is represented by each of the columns  56 ,  58 ,  60 ,  62 ,  64 ,  66 ,  68 , and  70 . The latches are initialized by corresponding page buffer output status bits. The first row  72  shows that the FBDUs of columns  56  and  66  are initialized to a failure status, and that the rest of the FBDUs are not. 
         [0027]    Rows  74 ,  76 ,  78 , and  80  are steps in a binary search for the first FBDU with a latch initialized to a failure status. In each case, the DET signal=0, so a failure bit is located among the selected FBDUs. In row  82 , after a failure bit has been localized to the FBDU of column  56 , the latch of FBDU of column  56  undergoes a RESET signal. In future searches, the FBDU of column  56  will not cause the DET signal to fall to 0, and the total of failure bits is incremented by 1. 
         [0028]    The binary search process for FBDUs with a latch holding the failure status bit continues, because the prior search iteration concluded with DET=0. Row  82  shows that the FBDU of column  66  holds a failure status, and that the rest of the FBDUs are not. 
         [0029]    Rows  86 ,  88 ,  90 , and  92  are steps in a binary search for the next FBDU with a latch holding a failure status. In rows  86  and  90 , the DET signal=0, so a failure bit is located among the selected FBDUs. In rows  88  and  92 , the DET signal=1, so a failure bit is not located among the selected FBDUs, indicating that the FBDU with the latch holding the failure status was among the unselected FBDUs. In row  94 , after a failure bit has been localized to the FBDU of column  66 , the latch of FBDU of column  66  undergoes a RESET signal. In future searches, the FBDU of column  66  will not cause the DET signal to fall to 0, and the total of failure bits is incremented by 1. 
         [0030]    In row  98 , the final iteration begins again with all FBDUs selected. Because DET=1, none of the FBDUs includes a latch holding a failure status. The total of failure bits is not incremented anymore, and holds the final total of FBDUs with a latch initialized to a failure status. 
         [0031]    The circuit of  FIG. 2  following the process of  FIG. 3  is slow but accurate. 
         [0032]    It would be desirable to measures a number of errors in page buffer output both quickly and accurately. 
       SUMMARY 
       [0033]    One aspect of the technology is a detecting circuit, comprising a plurality of counting circuits and control logic. 
         [0034]    The plurality of counting status circuits are electrically coupled to corresponding ones of a plurality of status elements. The plurality of counting status circuits are electrically coupled to each other in a sequential order. 
         [0035]    The control logic causes processing of the plurality of counting status circuits in the sequential order to determine a total of the plurality of status elements. 
         [0036]    One aspect of the technology is a memory circuit, comprising counting status circuits and control logic. 
         [0037]    The counting status circuits are electrically coupled to corresponding bit status memory elements. The bit status memory elements store a bit status of a bit line, which can be pass or fail. The counting status circuits are electrically coupled to each other in a sequential order. 
         [0038]    The control logic cause processing of the counting status circuits in the sequential order to determine a total of the memory elements that store the bit status. The total number of memory elements that store the bit status indicate a number of error bits or non-error bits, which can help determine whether there are too many errors to be fixed by error correction codes. 
         [0039]    Another aspect of the technology is a method of operating memory. 
         [0040]    The method includes:
       processing a plurality of counting status circuits in a sequential order to determine a total of a plurality of memory elements that store a bit status of one of a plurality of bit lines of a memory array, the bit status indicating one of at least pass and fail, the plurality of counting status circuits electrically coupled to each other in the sequential order,   wherein the plurality of counting status circuits receive data from corresponding ones of a plurality of bit status memory elements coupled to the plurality of bit lines of the memory array.       
 
         [0043]    One embodiment further includes a page buffer with page buffer output bits storing memory array output. The page buffer output bits include the corresponding page buffer output bits providing the bit status to one of the plurality of memory elements. 
         [0044]    In one embodiment, the counting status circuits have corresponding counting status memory elements. The corresponding counting status memory elements indicate whether the bit status of the bit status memory elements has been counted in the total of the memory elements that store the bit status. 
         [0045]    In one embodiment, initial contents of the corresponding counting status memory elements are determined by the corresponding page buffer output bits of the page buffer. For example, if the corresponding page buffer output bits of a page buffer indicate a failed bit status, then the initial contents of the corresponding counting status memory elements indicate a failed bit status. In one embodiment, the bit status in one of the bit status memory elements indicates a one of at least pass and fail of one of the bit lines. 
         [0046]    In one embodiment, each of the plurality of counting status circuits includes one of the plurality of bit status memory elements. The bit status memory element could be located outside of the counting status circuit, although at the cost of additional latency. 
         [0047]    In one embodiment, the processing of the counting status circuits in the sequential order, is interrupted from proceeding further in the sequential order, by one of the counting status circuits having a corresponding counting status memory element which indicates that the bit status of at least one of the bit status memory elements has not been counted in the total of the memory elements that store the bit status. 
         [0048]    In one embodiment, after the processing of the counting status circuits in the sequential order is interrupted, and before subsequent processing of the counting status circuits in the sequential order from a beginning of the sequential order, contents of the corresponding counting status memory element is changed by the control circuitry, to indicate that the bit status of at least one of the bit status memory elements has been counted in the total of the memory elements that store the bit status. Consequently, on a subsequent occasion, during processing of the counting status circuits in the sequential order, the same counting status circuit which caused interruption of the processing in the prior iteration will not cause interruption of the processing in subsequent iterations. 
         [0049]    In one embodiment, the processing of the counting status circuits in the sequential order, is successful in proceeding through all of the sequential order, responsive to none of the counting status circuits having a corresponding counting status memory element which indicates that the bit status of one of the bit status memory elements has not been counted in the total of the memory elements that store the bit status. One possible cause is that, upon initialization, none of the counting status memory elements indicates the failed bit status of one of the bit status memory elements. Another possible cause is that, although upon initialization, one or more of the counting status memory elements did indicate the failed bit status of one of the bit status memory elements, prior processing resulted in counting status memory elements changing their contents to indicate that the failed bit status of all of the bit status memory elements has been counted. 
         [0050]    In one embodiment, the control circuitry causes repetition of the processing of the counting status circuits in the sequential order, at least until none of the of counting status circuits has a corresponding counting status memory element which indicates that the bit status of one of the bit status memory elements has not been counted in the total of the memory elements that store the bit status. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0051]      FIG. 1  is a simplified circuit diagram of a circuit that measures a number of errors in page buffer output. 
           [0052]      FIG. 2  is a simplified circuit diagram of a circuit that detects the position of an error in page buffer output through binary search. 
           [0053]      FIG. 3  is a schematic of different steps in a process of detecting the position of an error in page buffer output through binary search, showing the contents of the memory elements in the multiple stages of the circuit series that counts the number of errors in page buffer output, and the output value of the last stage of the circuit series. 
           [0054]      FIG. 4  is a simplified circuit diagram of a circuit that counts the number of errors in page buffer output. 
           [0055]      FIG. 5  is a simplified block diagram of a stage of the circuit series that counts the number of errors in page buffer output. 
           [0056]      FIG. 6  is a simplified circuit diagram of a circuit coupled to the output of the last of the circuit series shown in  FIG. 5  that counts the number of errors in page buffer output. 
           [0057]      FIG. 7  is a truth table that shows the output of varied inputs of the stage of the circuit series shown in  FIG. 5 . 
           [0058]      FIG. 8  is a truth table that shows whether the contents of a memory element of the stage of a circuit series shown in  FIG. 5  changes in response to the state of the input and output of the stage of the circuit series shown in  FIG. 5 . 
           [0059]      FIG. 9  is a process flow of counting the number of errors in page buffer output, with the circuit of  FIG. 4 . 
           [0060]      FIG. 10  is a schematic of different steps in a process of counting the number of errors in page buffer output, showing the contents of the memory elements in the multiple stages of the circuit series that counts the number of errors in page buffer output, and the output value of the last stage of the circuit series. 
           [0061]      FIG. 11  is a more detailed circuit diagram of the simplified block diagram of  FIG. 5  for a stage of the circuit series that counts the number of errors in page buffer output. 
           [0062]      FIG. 12  is an example two-stage circuit series with two instances of the circuit shown in  FIG. 11  coupled in series to count the number of errors in page buffer output. 
           [0063]      FIG. 13  is an example of contents of the memory elements in the two-stage circuit series shown in  FIG. 12 . 
           [0064]      FIG. 14  is a timing diagram of the signals versus time for the circuit in  FIG. 12 . 
           [0065]      FIG. 15  is a more detailed circuit diagram of alternative to  FIG. 11  for the simplified block diagram of  FIG. 5  for a stage of the circuit series that counts the number of errors in page buffer output. 
           [0066]      FIG. 16  is a timing diagram of the signals versus time for the circuit in  FIG. 15 . 
           [0067]      FIG. 17  is a detailed circuit diagram of an alternative to the pass gate in  FIG. 11 . 
           [0068]      FIG. 18  is a schematic diagram of an integrated circuit including a memory array with improved FBDUs, or counting status circuits. 
       
    
    
     DETAILED DESCRIPTION 
       [0069]      FIG. 4  is a simplified circuit diagram of a circuit that counts the number of errors in page buffer output bits  111 ,  113 , and  115 . 
         [0070]    Output bits are read from bit lines of a memory array  102 . Page buffer circuitry determines whether the page buffer output bits  111 ,  113 , and  115  are characterized by a failure status, for example via a verify circuit (not shown), such as FIG. 6 of U.S. Pat. No. 7,952,958, all of which is incorporated by reference. The failure status of page buffer output bits  111 ,  113 , and  115  is stored in corresponding bit status/memory elements  121 ,  123 , and  125 . 
         [0071]    The counting status circuits  141 ,  143 , and  145  include respective counting status memory elements  151 ,  153 , and  155 . The counting status memory elements  151 ,  153 , and  155  respectively store the failed bit status counted or not counted  161 ,  163 , and  165 . The failed bit status counted or not counted  161 ,  163 , and  165  are initialized by respective failed bit status or passed bit status  131 ,  133 , and  135 . As the counting proceeds, each failed bit status not counted is changed to a failed bit status counted, and the count of page buffer output bits with failed bit status  176  is incremented by the counter  174 . After every failed bit status not counted has been changed to failed bit status counted, then the sequence of FBDUs, or counting status circuits, finishes counting. The overall process is managed by the control circuitry  172 . 
         [0072]      FIG. 5  is a simplified block diagram of a stage of the circuit series that counts the number of errors in page buffer output. 
         [0073]    The FBDU  180 , or counting status circuit  180 , has an input signal DETI  182 , and an output signal DETO  184 . The FBDU  180  stores the failed bit status counted (pass)/not counted (fail)  186 ; this bit is stored to the latch at the beginning of the detection phase. Multiple FBDUs are coupled in series, each FBDU corresponding to a particular page buffer output bit. The output signal DETO  184  of a preceding FBDU is coupled to the input signal DETI  182  of a following FBDU. The output signal DETO of the final DETO is signal DET. 
         [0074]    When the failed bit status is not counted (fail), then the switch is off, and the path through the series of FBDUs is cut off, indicating an uncounted fail bit, which results in incrementing the fail bit count by 1. When the failed bit status is counted (pass), then the switch is on, and the path through the series of FBDUs continues to the subsequent FBDU in the series of FBDUs. 
         [0075]      FIG. 6  is a simplified circuit diagram of a circuit coupled to the output of the last of the circuit series shown in  FIG. 5  that counts the number of errors in page buffer output. 
         [0076]    The output of the last FBDU in the series, such as the FBDU shown in  FIG. 5 , has an output signal DET which is an input to the NAND gate. Another input of the NAND gate is an enable EN signal. The output of the NAND gate is coupled to a latch. 
         [0077]      FIG. 7  is a truth table that shows the output of varied inputs of the stage of the circuit series shown in  FIG. 5 . 
         [0078]    Each detection operation includes two steps.  FIG. 7  shows the first step of the propagation of the DET signal. At this step, RESET signal is 0V and FBDU keeps the previous bit status. The second step is the FBDU reset step. At this step, the first FBDU with a failed bit status is reset. All other FBDUs remain their bit status. The DET signal changes and propagates again until reaching the second FBDU with failed bit status. 
         [0079]    For the FBDU storing the value of the passed bit status, the output signal DETO passes through the input signal DETI. For the FBDU storing the value of the failed bit status, output signal DETO=0 occurs at the first step. 
         [0080]      FIG. 8  shows the second step. After the RESET goes high, the first FBDU with failed bit status (DETI=1 in the first step) is reset, FAIL status is changed to PASS status for this FBDU, and the output signal DETO passes through the input signal DETI. For other FBDUs, the bit status is unchanged. 
         [0081]      FIG. 9  is a process flow of counting the number of errors in page buffer output, with the circuit of  FIG. 4 . 
         [0082]    In  188 , the failed bit status from the page buffer output is used to initialize the series of FBDU/counting status circuits. In  190 , the input of the first FBDU is set to 1. The DET signal chain will be stopped by any FBDU in the series of FBDU/counting status circuits stores a failed bit status not counted (fail). In  192 , the first FBDU in the series causes the DET (the output signal of the last FBDU in the series) to =0, and the process proceeds to  194 . In  194 , the counter of failed bits is incremented by one, followed by the input signal RESET=1  196 , and then the input signal RESET=0  198 . 
         [0083]    However, the DET signal chain is not stopped if any FBDU in the series of FBDU/counting status circuits stores a failed bit status counted (pass). In  192 , the first FBDU in the series causes the DET (the output signal of the last FBDU in the series) to =1, and the process proceeds to  200 , “Finish”. At  196 , at least one FBDU is reset by the reset signal and the fail count is incremented. The DET signal chain is transferred and stopped at the next FBDU with fail bit data. The procedure continues until DET (the output signal of the last FBDU in the series)=1. 
         [0084]    The present process flow is advantageous because of an accurate count of failed bits, a low total of two operations for counting each instance of a failed bit, and a low timing overhead for each failed bit. As a result, more failed bit can be counted in a given period of time during the program verify and erase verify operation. 
         [0085]      FIG. 10  is a schematic of different steps in a process of counting the number of errors in page buffer output, showing the contents of the memory elements in the multiple stages of the circuit series that counts the number of errors in page buffer output, and the output value of the last stage of the circuit series. 
         [0086]    A different FBDU with its own latch is represented by each of the columns  202 ,  204 ,  206 ,  208 ,  210 ,  212 ,  214 , and  216 . The failed bit status memory elements (such as latches) are initialized by corresponding page buffer output status bits. The first row  218  shows that the FBDUs of columns  202  and  212  are initialized to a failure status, and that the rest of the FBDUs are not. 
         [0087]    Rows  220 ,  222 ,  224 ,  226 ,  228 , and  230  are steps in multiple iterations of counting the number of FBDUs with a latch initialized to a failure status. The iterative process continues if DET=0, and stops if DET=1. 
         [0088]    In the first iteration  220 , the FBDU of column  202  receives the input of DETI=1, and send the output of DETO=0, which is passed through to the last output of the last FBDU in the series. Because the last output DET=0, the iterative process will continue. The contents of the FBDU of column  202  are reset, so in the following iteration  224 , the FBDU of column  202  no longer holds the failed bit status not counted, although the FBDU of column  212  still holds the failed bit status not counted. The counter of failure bits is incremented by one. 
         [0089]    In the second iteration  226 , the FBDU of column  202  receives the input of DETI=1, which is passed through to the FBDU of column  212 . The FBDU of column  212  send the output of DET=0, which is passed through to the last output of the last FBDU in the series. Because the last output DET=0, the iterative process will continue. The contents of the FBDU of column  212  are reset, so in the following iteration  228 , the FBDU of column  212  no longer holds the failed bit status not counted, and no FBDU holds the failed bit status not counted. The counter of failure bits is incremented by one. 
         [0090]    In the third and last iteration  230 , the FBDU of column  202  receives the input of DETI=1, which is passed through to the last output of the last FBDU in the series. Because the last output DET=1, the iterative process is over. The counter of failure bits is not incremented. 
         [0091]    Other embodiments have a different number of FBDU circuits coupled in series, typically but not necessarily a power of two or multiple of two. 
         [0092]      FIG. 11  is a more detailed circuit diagram of the simplified block diagram of  FIG. 5  for a stage of the circuit series that counts the number of errors in page buffer output. 
         [0093]    The corresponding output column of multiple page buffers can share a single FBDU. Multiple FBDUs are coupled in series. 
         [0094]    The fail bit detect unit generally includes three blocks: the pass gate  236 , the upper latch  238 , and the lower latch  246 . 
         [0095]    The main part is the pass gate  236 , which acts as the detecting gate of the contents of the upper latch  238 . If the detect result is fail, the pass gate  236  turns off, and transistor  237  passes a result of 0 to the nest stage  234 . If the detect result is pass, the pass gate  236  turns on, and the signal from the front stage  232  can be passed to the next stage  234 . 
         [0096]    If the last FBDU in the series has an output signal of 0, then the failed bit counter increments by one. After the detecting cycle, two input signals (trc  252 , trc_ 2   242 ) flip the contents of the two latches  238  and  246 . 
         [0097]    The upper latch  238  stores the pass/fail information from the page buffer which controls the on/off status of the pass gate  236 . 
         [0098]    If there was only the upper latch  238 , then the flip signal would causes not just the upper latch  238  of a particular FBDU, but the upper latch  238  of multiple FBDUs to flip. Accordingly, the lower latch  246  controls the FBDU which includes an upper latch  238  that flips. The lower latch  246  detects the signal from the front stage  232  before the pass gate  236 . If the delivery signal (trc  252 , trc — 2  242 ) arrives, the lower latch  246  flips first, and enables the flip path of the upper latch  238 . TRC  252  is in series with transistor  250  between the lower latch  246  and ground. Transistor  250  has a gate coupled to the front stage  232 . TRC  242  is in series with transistor  244  between the upper latch  238  and ground. Transistor  244  has a gate coupled to the lower latch  246 . Accordingly, the lower latch  246  addresses the problem of the upper latch  238  of several FBDUs flipping at the same time. RST_b transistors  240  and  246  respectively reset the upper latch  238  and the lower latch  246 . trc  252  and trc — 2  242  are two non-overlapping pulses such as  310  and  312  in  FIG. 14 . trc come first then trc — 2 comes next. 
         [0099]      FIG. 12  is an example two-stage circuit series with two instances  254  and  256  of the circuit shown in  FIG. 11  coupled in series to count the number of errors in page buffer output. The output of the prior stage is coupled to the input of the following stage. 
         [0100]      FIG. 13  is an example of contents of the memory elements in the two-stage circuit series shown in  FIG. 12 . FBDU  1  and FBDU  2  are respectively the first FBDU and the second FBDU in  FIG. 12 . 
         [0101]      FIG. 14  is a timing diagram of the signals versus time for the circuit in  FIG. 12 . 
         [0102]    The traces are: clk  302 , rst_b  304 , trc  310 , trc — 2  312 , det_in(L1)  314 , inter(R1,L2)  316 , det_out(R2), LAR1  320 , PASS1  322 , LAR2  324 , and PASS2  326 . The traces show the voltage vs. time at nodes shown in  FIG. 13 . 
         [0103]    The periods included are reset  328 , load  330 , and detect  332 . 
         [0104]    In the beginning of the detect stage, rst_b  304  resets the circuit and latch. 
         [0105]    Load  330  loads the pass/fail information by turning on fbit[0]  306 . Then the data (PASS1  322 ,PASS2  326 )=(pass,fail)=(vdd,vss). 
         [0106]    After loading the data, det_in  314  starts the detecting signal. In the first unit, the data value is pass, so the pass gate is open, and the DET signal passes through. 
         [0107]    In the second unit, the DET signal is blocked, because the pass gate is off; there is no output at det_out  318 . At the same time the latch flipping signal (trc  310 , trc — 2  312 ) starts to send a pulse every clock cycle. 
         [0108]    When the detect signal come to the second unit(inter  316 ) and the trc  310  signal comes, the lower latch flips. The switched lower latch and the trc — 2 signal  312  make the upper latch flip if the upper latch holds a “fail” value. The trc  310  and trc — 2  312  do not overlap, to prevent the upper latch of multiple FBDUs flipping at the same time. 
         [0109]    The counter increment depends on the det_out every clock cycle if there det_out=0. 
         [0110]    After the upper latch of the second FBDU flips (PASS2  326  goes high), the DET signal can be passed through the second FBDU to det_out  318 , and the fbit[0] detect is complete. 
         [0111]    Then the circuit resets and deals with fbit[1]  308 . The same operations follow in general. Because there are two fail bits in this fail bit detecting operation, the path is blocked twice—L1 to R1 in the first FBDU, L2 to R2 in the second FBDU. 
         [0112]    The arrow signs in the figure show that the latches are flipped after the trc and trc — 2 signals arrive. 
         [0113]      FIG. 15  is a more detailed circuit diagram of alternative to  FIG. 11  for the simplified block diagram of  FIG. 5  for a stage of the circuit series that counts the number of errors in page buffer output. 
         [0114]    LOAD transistor  346  initializes latch  344  with the failed bit status from the page buffer. LOAD transistor  346  is in series with a transistor having a gate coupled to the input signal DETI  340  and a RESET transistor  348 . Tri-state NAND gate  350  has transfer TR and transferbar TRB signals, as inputs the input signal DETI  340  and the latch  344 , and an output coupled to latch  352 . The latch  352  has an output provided as output signal DETO  342 . 
         [0115]      FIG. 16  is a timing diagram of the signals versus time for the circuit in  FIG. 15 . 
         [0116]    The traces are: TR  350 , TRB  352 , LAT  354 , LATB  356 , DETI  358 ,  360 ,  362 , and DETO  364 . The traces show the voltage vs. time at nodes shown in  FIG. 15 . Node  360  is RESET, node  362  is PASS. The operations are generally as described for other embodiments. 
         [0117]    Signal TRB  352  is the complement of signal TR  350 . Signal LATB  356  is the complement of signal LAT  354 . 
         [0118]    The operations are as follows: 
         [0119]    First transfer DET. The DET signal is transferred through FBDU. At this step, TR=1, LAT=0, and RESET=0. 
         [0120]    Second, latch DET. The DET signal is latched. LAT=1 first, then TR=0. 
         [0121]    Third, reset Fail FBDU. RESET=1 to reset the latch. Then RESET=0 and LAT=0. 
         [0122]      FIG. 17  is a detailed circuit diagram of an alternative to the pass gate in  FIG. 11 . 
         [0123]    Various embodiments rely on the control of series-coupled pass gates to selectively pass a signal depending on whether or not a particular page buffer fail status bit has been counted. Embodiments relying solely on the pass gate can result in slow circuit performance. Other embodiments have a buffer type core to replace the pass gate and the reset transistor. 
         [0124]    In the buffer type core embodiment of  FIG. 17 , pass transistor  370  is the gate, front stage transistor  368  catches the front stage signal, and transistor  372  P1 pulls up the next stage. Transistor  372  P1 is the buffer transistor improving performance. The structure of  FIG. 17  replaces the “pass gate” part of  FIG. 11 . The other parts remain the same. 
         [0125]    This buffer type includes two more transistors than the pass gate type. Combining the two types—pass gate and buffer type—improves the performance. In one example, 7 pass gate types as shown in  FIG. 11  and 1 buffer type as shown in  FIG. 17  are connected serially, and repeated. In one embodiment, 32 stages with an all pass gate structure cost 30 ns to deliver a signal from beginning to end. However, the structure with both buffer type and pass gate type with a 1:7 ratio, the transfer time reduces to 5 ns. The ratio can be varied in other embodiments. 
         [0126]    An all buffer type is faster but has larger area. 
         [0127]      FIG. 18  is a schematic diagram of an integrated circuit including a memory array with improved FBDUs, or counting status circuits. 
         [0128]    The integrated circuit line  975  includes a 3D memory array  960 , implemented as described herein. A row decoder  961  is coupled to a plurality of word lines  962 , and arranged along rows in the memory array  960 . Circuitry  963  includes a plane decoder and a column decoder. The column decoder is coupled to a plurality of bit lines  964  arranged along columns and planes in the memory array  960  for reading data from the memory cells in the array  960 . A plane decoder is coupled to a plurality of planes in the memory array  960  via CSL lines for programming data to the memory cells in the array  960 . Addresses are supplied on a bus to the plane decoder and the column decoder in circuitry  963  including an improved page buffer with FBDUs as disclosed herein, and row decoder  961 . Sense amplifiers and data-in structures in block  966  are coupled to the circuitry  963  in this example via data bus  967 . Data is supplied via the data-in line  971  from input/output ports on the integrated circuit  975  or from other data sources internal or external to the integrated circuit  975 , to the data-in structures in block  966 . In other embodiments, other circuitry is included on the integrated circuit  975 , such as a general purpose processor or special purpose application circuitry, or a combination of modules providing system-on-a-chip functionality supported by the memory cell array. Data is supplied via the data-out line  972  from the sense amplifiers in block  966  to input/output ports on the integrated circuit  975 , or to other data destinations internal or external to the integrated circuit  975 . 
         [0129]    A controller implemented in this example using bias arrangement state machine  969  controls the application of bias arrangement supply voltage generated or provided through the voltage supply or supplies in block  968 , such as read, erase, program, erase verify and program verify voltages. The controller can be implemented using special-purpose logic circuitry as known in the art. In alternative embodiments, the controller comprises a general-purpose processor, which may be implemented on the same integrated circuit, which executes a computer program to control the operations of the device. In yet other embodiments, a combination of special-purpose logic circuitry and a general-purpose processor may be utilized for implementation of the controller. 
         [0130]    Various embodiments are directed to a general bit detecting structure with a parallel output. 
         [0131]    While the present invention is disclosed by reference to the preferred embodiments and examples detailed above, it is to be understood that these examples are intended in an illustrative rather than in a limiting sense. It is contemplated that modifications and combinations will readily occur to those skilled in the art, which modifications and combinations will be within the spirit of the invention and the scope of the following claims.