This disclosure relates to data storage systems. More particularly, the disclosure relates to systems and methods for generating log-likelihood ratios for data storage systems.
Soft-decision low-density parity-check code (LDPC) error code correction (ECC) can improve the reliability of a data storage system and reduce the number of data errors. Log-likelihood ratios (LLRs) are commonly used as the inputs for soft-decision LDPC engines. Data storage systems that use flash memories (e.g., NAND) as data storage media can use LLR calculations for reading memory cells when LDPC based on single-read input is insufficient to decode the originally-stored data.
Various embodiments are depicted in the accompanying drawings for illustrative purposes, and should in no way be interpreted as limiting the scope of the inventions. In addition, various features of different disclosed embodiments can be combined to form additional embodiments, which are part of this disclosure. Throughout the drawings, reference numbers may be reused to indicate correspondence between reference elements.
While certain embodiments are described, these embodiments are presented by way of example only, and are not intended to limit the scope of protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the scope of protection.
Data storage cells in solid state drives (SSD), such as multi-level-per-cell (MLC) flash memory, may have distinct threshold voltage distribution (Vt) levels, corresponding to different memory states. For example, in an MLC implementation, different memory states in an SSD may correspond to a distribution of voltage levels ranging between voltage read levels; when the charge of a memory cell falls within a particular range, one or more reads of the page may reveal the corresponding memory state of the cell. The term “read” is used herein with respect to voltage reads of SSDs according to its broad and ordinary meaning, and may refer to read operations on a page, including a plurality of cells (e.g., thousands of cells), or may be used with respect to a voltage charge level of a single memory cell.
Voltage read levels can advantageously be set to values in the margins between memory states. According to their charge level, memory cells store different binary data representing user data. For example, based on its charge level, each cell generally falls into one of the memory states, represented by associated data bits. Performing cell reads at the various read levels can provide 1-bit input data for identifying the memory states with which certain cells are associated when the distributions for different states are tightly clustered and there is no overlap between them.
Over time, and as a result of various physical conditions and wear from repeated program/erase (P/E) cycles, the margins between the various distribution levels may be reduced, so that voltage distributions overlap to some extent. Such reduction in read margin may be due to a number of factors, such as loss of charge due to flash cell oxide degradation, over-programming caused by erratic program steps, programming of adjacent erased cells due to heavy reads or writes in the locality of the cell (or write disturbs), and/or other factors. When voltage distributions overlap, single-read inputs may not provide enough information to decode the original data.
Soft-decision inputs, such as log-likelihood ratios (LLRs), can enhance the probability of successful decoding in certain situations. However, in certain embodiments, SSDs are not configured to provide soft-decision data. For example, an SSD may present a binary interface, wherein the SSD returns binary data based on reads of the SSD at various voltage threshold levels. Such voltage threshold levels utilized by the SSD may be adjustable or configurable in certain configurations. In order to provide more reliable data input, it may be desirable for an SSD controller to generate soft-decision data based on binary return values provided by SSDs. Certain embodiments disclosed herein provide for soft-decision input generation for a decoding module, such as a low-density parity check (LDPC) decoder, using a multiple-read technique. Certain embodiments further provide systems and methods for SSD channel estimation, as well as optimal Vt tracking for SSDs to improve utilization of the decoder correction capability.
“Page,” or “E-page,” as used herein may refer to the unit of data correction of embodiments disclosed herein. For example, error correction/calibration operations may be performed on a page-by-page basis. A page of data may be any suitable size. For example, a page may comprise 1 k, 2 k, 4 k, or more bytes of data. Furthermore, the term “location,” or “memory location” is used herein according to its broad and ordinary meaning and may refer to any suitable partition of memory cells within one or more data storage devices. A memory location may comprise a contiguous array of memory cells or addresses (e.g., a page).
As used in this application, “non-volatile solid-state memory” may refer to solid-state memory such as NAND flash. However, the systems and methods of this disclosure may also be useful in more conventional hard drives and hybrid drives including both solid-state and hard drive components. Solid-state memory may comprise a wide variety of technologies, such as flash integrated circuits, Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NAND memory, NOR memory, EEPROM, Ferroelectric Memory (FeRAM), MRAM, or other discrete NVM (non-volatile solid-state memory) chips. The non-volatile solid-state memory arrays or storage devices may be physically divided into planes, blocks, pages, and sectors, as is known in the art. Other forms of storage (e.g., battery backed-up volatile DRAM or SRAM devices, magnetic disk drives, etc.) may additionally or alternatively be used.
In certain embodiments, the controller 130 is configured to receive memory access commands from a storage interface (e.g., driver) 112 residing on a host system 110. The controller 130 is configured to execute commands in response to such host-issued memory commands in the non-volatile solid-state memory arrays 150. Data may be accessed/transferred based on such commands. In one embodiment, the storage device 120 may be a hybrid disk drive that additionally includes magnetic memory storage (not shown). In such case one or more controllers 130 would control the magnetic memory storage and the non-volatile solid-state memory array(s) 150.
The error management module 140B includes a calibration module 144 as well as one or more indexes for storing look-up tables (LUTs) containing possible soft-decision input values. The error management module 140B may further include a module (not shown) for tracking voltage threshold levels for determining relative optimal voltage threshold levels. For example, the voltage threshold tracking module may report one or more E-page reads having minimum bit-flip error counts from among a plurality of E-page reads associated with different voltage read levels. For example, a page A may be read three times at different voltage read levels, resulting in three read copies A1, A2, and A3 and the tracking module may find that A1 results in the fewest bit-flip error as compared the decoded page A.
The error management module 140B may be configured to perform soft-decision calibration using the calibration module 144, wherein possible LLR values are stored by the calibration module 144 in one or more local and/or remotely-stored LUTs, which can be used by the error management module 140B for decoding target data as needed. When a target page cannot be decoded using hard-decision input, the appropriate LUT may be provided to the soft-decision input generator with the target data. Calibration may be performed periodically using a background process, and may be performed on a per-block, or per-die basis. For example, a calibration can be performed based on a reference page within each of blocks B1, B2, BN. If a read on a page (the target page) in block B3 encounters an error, then the soft-decision data based on calibration on the reference page within B3 can be used to help decode that target page in block B3. For example, calibration may performed according to a firmware-based schedule, which may dictate calibration on a daily, weekly, monthly, or other basis.
The calibration module 144 is configured to generate possible LLR values based on one or more reads of a reference memory location and comparison of such read values with known reference values stored in the reference memory location. The calibration module 144 may further populate one or more LUTs 148 with the generated LLR values. The LLR values stored in the LUT(s) may be used by the error management module 140B as inputs to the decoder 149 in association with the decoding of target memory locations related to the reference location. In addition to the index 148, one or more indexes/LUTs may be stored externally to the error management module 140B. For example, multiple LUTs, each associated with different reference locations may be stored externally. When the error management is tasked with decoding a particular target location, the LUT associated with the corresponding reference location may be accessed and used by the error management module 140B to provide soft-input values to the decoder 149. LUTs may be any suitable size. For example, in certain embodiments, LUTs have dimensions of n×m, wherein n may correspond to the maximum number of multi-reads supported+1 and m may correspond to the bit width of the LLR, which in one embodiment is equal to the decoder's internal precision. In one embodiment, the dimension used is 8×8.
The calibration module 144 may include functionality for performing certain statistical analysis for 1-read and/or multiple-read decoding operations. For example, such statistical analysis may include determining one or more of the following: total bit-error count, 1-to-0 flip count, and 0-to-1 flip count, wherein total bit-error count is the sum of 1-to-0 and 0-to-1 flip counts. The calibration module 144 may make such determinations based at least in part on LLR input values stored in the index 148, as well as information from the decoder 149. In certain embodiments, the calibration module 144 determines which among a plurality of voltage level reads of a location has the minimum total bit-error count. The corresponding voltage read level may be considered the optimal read level for the location.
The horizontal axis depicted in
Over time, and as a result of various physical conditions and wear, for example from being subjected to repeated P/E cycles, the read margins between the various distribution levels may be reduced, resulting in both data retention problems and higher read errors beyond certain limits. Such reduction in read margin may be due to a number of factors, such as loss of charge due to flash cell oxide degradation, over-programming caused by erratic program steps, programming of adjacent erased cells due to heavy reads or writes in the locality of the cell (or write disturbs), and/or other factors.
While the diagram of
With further reference to
Single-read soft-decision input generation may not provide sufficient or desirable information for certain purposes. Therefore, certain embodiments disclosed herein provide a soft-decision input generator that is configured to generate soft-decision inputs based on multiple reads of a memory location, thereby providing multiple bits of data from which to generate soft-decision inputs.
In the multiple-read scheme illustrated in
The process 500A includes determining correct reference data at block 502, while the process 500B includes determining a known reference bit stream recorded in a reference memory location at block 512. Such reference data may provide a basis for calibration of the soft-decision input generator 142 of
Determining the correct reference data may include determining a bit stream stored in the reference memory location for reference during calibration of the soft-decision input generator 142. Any suitable or desirable mechanism for determining the correct value of the reference bit stream may be used. For example, the reference memory location may be assigned by the system prior to calibration of the soft-decision input generator 142, and may be pre-programmed with a known bit stream.
Alternatively, in certain embodiments, the reference location does not contain a pre-programmed known bit stream. Instead, the reference bit stream may be determined by decoding the data in the reference location during calibration, as will be further explained below with respect to
With further reference to
Once the multiple reads are completed, the process 500A includes calculating LLR values based determining the bit flip counts of each of the multiple reads through comparisons of the multiple-read values to the correct reference data at block 506. For example, each of the reads of the reference location can be compared to the known reference data to determine how many of the cells are flipped from ‘0’ to ‘1,’ and vice versa. Table A shows example bit streams obtained through reads of a reference memory location at three different read voltage levels (R0, R1, R2). The top row of bits reflects the correct data stored in the reference memory location. The three voltage read levels may illustratively correspond to those shown in
While the table shows 6-bit bit streams in each of the rows, such bit stream size is provided for illustration purposes only, and a given memory location of interest may be significantly larger, comprising thousands of bits or more, for example. Furthermore, more than three reads may be used, or two reads may be used. Calibrating the soft-decision input generator using the data of Table A may include determining the following bit flip counts with respect to the correct reference data: (1) the 0-to-1 bit flip count at R0; (2) the 1-to-0 bit flip count at R0; (3) the 0-to-1 bit flip count at R1; (4) the 1-to-0 bit flip count at R1; (5) the 0-to-1 bit flip count at R2; and (6) the 1-to-0 bit flip count at R2. With respect to the 6-bit example shown in Table A, the values of each of the six calculated data point would be: (1)=0, i.e., no bits flipped from ‘0’ to ‘1’ for R0; (2)=1 (bit five is flipped from ‘1’ to ‘0’ for R0); (3)=2 (bits three and four are flipped from ‘0’ to ‘1’ for R1); (4)=0; (5)=3 (bits one, three and four are flipped from ‘0’ to ‘1’ for R2); and (6)=0. In embodiments including more or fewer reads, the number of bit flip counts calculated may be different. Generally, the number of data points calculated is approximately equal to 2×M, where M is the number of reads at different voltage levels.
Certain embodiments disclosed herein provide for probability data (e.g., LLR) calculation based on calculated 1-to-0 and 0-to-1 bit flip counts. This may correspond to in block 506 in
With reference to
The LLR (Log Likelihood Ratio) may be defined as
where P(0) is the probability that a transmitted bit is a ‘0’ value, while P(1) is the probability that the transmitted bit has a value of ‘1.’ It may therefore be convenient to use bit counts directly since the relevant probabilities are proportional to the count number. Based on Bayes' theorem, P(0)=Pr(ci=0|y0(i), y1(i), . . . ym−1(i))=Pr(y0(i), y1(i), . . . ym−1(i))|ci=0)*Pr(ci=0)/Pr(y0(i), y1(i), . . . ym−1(i))=K*Pr(y0(i), y1(i), . . . ym−1(i) ci=0).
With respect to the distribution graph of
In a multiple-read scheme, the LLR calculations may be somewhat more complex.
Where p1(x) and p0(x) are possibility density functions. Furthermore, it holds true that:
1=∫+∞V
And 1=∫−∞V
Although
LLR(0000000)=C*log2((1−0_p6)/1_p6);
LLR(0000001)=C*log2((0_p6−0_p5)/(1_p5−1_p6));
LLR(0000011)=C*log2((0_p5−0_p4)/(1_p4−1_p5));
LLR(0000111)=C*log2((0_p4−0_p3)/(1_p3−1_p4));
LLR(0001111)=C*log2((0_p3−0_p2)/(1_p2−1_p3));
LLR(0011111)=C*log2((0_p2−0_p1)/(1_p1−1_p2));
LLR(0111111)=C*log2((0_p1−0_p0)/(1_p0−1_p1));
LLR(1111111)=C*log2((0_p0)/(1−1_p0));
C is a constant, which may be used to convert the log2(x) to 1 n(x) and/or other scaling purposes. These values may serve as the content of the associated LLR LUT(s). The thresholds of VT are arranged from low to high. If the VT order is changed, the order of bit value representations (e.g., 0000000, 0000001, 0000011, etc.) may have to be changed as well.
These calculated possible LLR values may be used to populate one or more LUTs, as described above. Furthermore, the system may be configured to dynamically update LUT entries based on ongoing calibration/decoding operations. In certain MLC embodiments, memory cells comprise upper and lower pages of data, wherein separate LUTs are generated for upper and lower page values. When reading upper page values, the controller 130 (
With further reference to
and three reads of a target page with the following bits returned, LLR value will be selected by matching each bit pattern to the lookup table. For example, the first bit pattern is “000” (three reads of the first cell of the page) which returns the LLR value of V1. The pattern “010” may be considered an illegal state and is mapped one of the values of the lookup table.
Similarly in
Lower page 1-to-0 and 0-to-1 bit flip counts may be interpolated and/or extrapolated using a cumulative distribution function (CDF).
Therefore, an extrapolated flipped bit count value yx can be determined based on the line equation above.
The interpolation point yz may be derived according to similar principles. Therefore, given two or more 1-to-0 or 0-to-1 bit flip count data points, it may be possible to estimate the 1-to-0 or 0-to-1 count corresponding to an interpolated or extrapolated data point.
Upper page 1-to-0 and 0-to-1 counts may be derived the same way as above, except that each count is split into two data. For example, one count may correspond to the ‘0’ cell value for the lower page, and the other may correspond to the ‘1’ cell value for the lower page.
In certain embodiments, once the system has interpolated and/or extrapolated additional virtual voltage reading threshold values, the calibration logic may be directed to calculate LUT values in a similar way as regular LUT calibration, discussed above. Such LUTs may be used in a similar manner to those discussed above.
The read levels, states, and coding schemes associated with voltage level distributions described herein, as well as variables and designations used to represent the same, are used for convenience only. As used in this application, “non-volatile solid-state memory” typically refers to solid-state memory such as, but not limited to, NAND flash. However, the systems and methods of this disclosure may also be useful in more conventional hard drives and hybrid hard drives including both solid-state and hard drive components. The solid-state storage devices (e.g., dies) may be physically divided into planes, blocks, pages, and sectors, as is known in the art. Other forms of storage (e.g., battery backed-up volatile DRAM or SRAM devices, magnetic disk drives, etc.) may additionally or alternatively be used.
Those skilled in the art will appreciate that in some embodiments, other types of data storage systems and/or data retention monitoring can be implemented. In addition, the actual steps taken in the processes shown in
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection. For example, the various components illustrated in the figures may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware. Also, the features and attributes of the specific embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure. Although the present disclosure provides certain preferred embodiments and applications, other embodiments that are apparent to those of ordinary skill in the art, including embodiments which do not provide all of the features and advantages set forth herein, are also within the scope of this disclosure. Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims.
This application is a continuation application of application Ser. No. 14/584,326, filed on Dec. 29, 2014, now U.S. Pat. No. 10,545,879, which is a continuation application of application Ser. No. 13/797,923, filed on Mar. 12, 2013, now U.S. Pat. No. 8,924,824, the disclosure of each of which is hereby incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5299162 | Kim et al. | Mar 1994 | A |
6385111 | Tran | May 2002 | B2 |
6856556 | Hajeck | Feb 2005 | B1 |
7126857 | Hajeck | Oct 2006 | B2 |
7430136 | Merry, Jr. et al. | Sep 2008 | B2 |
7447807 | Merry, Jr. et al. | Nov 2008 | B1 |
7502256 | Merry, Jr. et al. | Mar 2009 | B2 |
7509441 | Merry, Jr. et al. | Mar 2009 | B1 |
7558109 | Brandman et al. | Jul 2009 | B2 |
7596643 | Merry, Jr. et al. | Sep 2009 | B2 |
7653778 | Merry, Jr. et al. | Jan 2010 | B2 |
7685337 | Merry, Jr. et al. | Mar 2010 | B2 |
7685338 | Merry, Jr. et al. | Mar 2010 | B2 |
7685374 | Diggs et al. | Mar 2010 | B2 |
7733712 | Walston et al. | Jun 2010 | B1 |
7765373 | Merry, Jr. et al. | Jul 2010 | B1 |
7805663 | Brandman et al. | Sep 2010 | B2 |
7898855 | Merry, Jr. et al. | Mar 2011 | B2 |
7904793 | Mokhlesi | Mar 2011 | B2 |
7912991 | Merry, Jr. et al. | Mar 2011 | B1 |
7936603 | Merry, Jr. et al. | May 2011 | B2 |
7962792 | Diggs et al. | Jun 2011 | B2 |
8078918 | Diggs et al. | Dec 2011 | B2 |
8090899 | Syu | Jan 2012 | B1 |
8095851 | Diggs et al. | Jan 2012 | B2 |
8108692 | Merry, Jr. et al. | Jan 2012 | B1 |
8122185 | Merry, Jr. et al. | Feb 2012 | B2 |
8127048 | Merry, Jr. et al. | Feb 2012 | B1 |
8135903 | Kan | Mar 2012 | B1 |
8151020 | Merry, Jr. et al. | Apr 2012 | B2 |
8156398 | Sommer | Apr 2012 | B2 |
8156403 | Shalvi | Apr 2012 | B2 |
8161227 | Diggs et al. | Apr 2012 | B1 |
8166245 | Diggs et al. | Apr 2012 | B2 |
8243514 | Kang | Aug 2012 | B2 |
8243525 | Kan | Aug 2012 | B1 |
8254172 | Kan | Aug 2012 | B1 |
8261012 | Kan | Sep 2012 | B2 |
8296625 | Diggs et al. | Oct 2012 | B2 |
8312207 | Merry, Jr. et al. | Nov 2012 | B2 |
8312669 | Thomas | Nov 2012 | B2 |
8316176 | Phan et al. | Nov 2012 | B1 |
8341339 | Boyle et al. | Dec 2012 | B1 |
8375151 | Kan | Feb 2013 | B1 |
8392635 | Booth et al. | Mar 2013 | B2 |
8397107 | Syu et al. | Mar 2013 | B1 |
8407449 | Colon et al. | Mar 2013 | B1 |
8423722 | Deforest et al. | Apr 2013 | B1 |
8433858 | Diggs et al. | Apr 2013 | B1 |
8443167 | Fallone et al. | May 2013 | B1 |
8447920 | Syu | May 2013 | B1 |
8458435 | Rainey, III et al. | Jun 2013 | B1 |
8478930 | Syu | Jul 2013 | B1 |
8489854 | Colon et al. | Jul 2013 | B1 |
8503237 | Horn | Aug 2013 | B1 |
8521972 | Boyle et al. | Aug 2013 | B1 |
8549236 | Diggs et al. | Oct 2013 | B2 |
8583835 | Kan | Nov 2013 | B1 |
8601311 | Horn | Dec 2013 | B2 |
8601313 | Horn | Dec 2013 | B1 |
8612804 | Kang et al. | Dec 2013 | B1 |
8615681 | Horn | Dec 2013 | B2 |
8638602 | Horn | Jan 2014 | B1 |
8639872 | Boyle et al. | Jan 2014 | B1 |
8683113 | Abasto et al. | Mar 2014 | B2 |
8700834 | Horn et al. | Apr 2014 | B2 |
8700950 | Syu | Apr 2014 | B1 |
8700951 | Call et al. | Apr 2014 | B1 |
8706985 | Boyle et al. | Apr 2014 | B1 |
8707104 | Jean | Apr 2014 | B1 |
8713066 | Lo et al. | Apr 2014 | B1 |
8713357 | Jean et al. | Apr 2014 | B1 |
8719531 | Strange et al. | May 2014 | B2 |
8724422 | Agness et al. | May 2014 | B1 |
8725931 | Kang | May 2014 | B1 |
8745277 | Kan | Jun 2014 | B2 |
8751728 | Syu et al. | Jun 2014 | B1 |
8769190 | Syu et al. | Jul 2014 | B1 |
8769232 | Suryabudi et al. | Jul 2014 | B2 |
8775720 | Meyer et al. | Jul 2014 | B1 |
8782327 | Kang et al. | Jul 2014 | B1 |
8788778 | Boyle | Jul 2014 | B1 |
8788779 | Horn | Jul 2014 | B1 |
8788880 | Gosla et al. | Jul 2014 | B1 |
8793429 | Call et al. | Jul 2014 | B1 |
8924824 | Lu | Dec 2014 | B1 |
10545819 | Lu | Jan 2020 | B1 |
20040175021 | Porter | Sep 2004 | A1 |
20060045169 | Kim | Mar 2006 | A1 |
20080052594 | Yedidia | Feb 2008 | A1 |
20080222346 | Raciborsi | Sep 2008 | A1 |
20080250300 | Mokhlesi | Oct 2008 | A1 |
20090019335 | Boyer | Jan 2009 | A1 |
20100014352 | Aritome | Jan 2010 | A1 |
20100017684 | Yang | Jan 2010 | A1 |
20100034319 | Ludvigsen | Feb 2010 | A1 |
20100169746 | Karabed | Jul 2010 | A1 |
20100174849 | Walston et al. | Jul 2010 | A1 |
20100205363 | Hwang | Aug 2010 | A1 |
20100250793 | Syu | Sep 2010 | A1 |
20100287328 | Feldman | Nov 2010 | A1 |
20110099323 | Syu | Apr 2011 | A1 |
20110191652 | Dave et al. | Aug 2011 | A1 |
20110283049 | Kang | Nov 2011 | A1 |
20120008386 | Chilappagari | Jan 2012 | A1 |
20120063227 | Weingarten et al. | Mar 2012 | A1 |
20120079354 | Uchikawa et al. | Mar 2012 | A1 |
20120159278 | Jen | Jun 2012 | A1 |
20120236638 | Weingarten et al. | Sep 2012 | A1 |
20120260020 | Suryabudi et al. | Oct 2012 | A1 |
20120278531 | Horn | Nov 2012 | A1 |
20120284460 | Guda | Nov 2012 | A1 |
20120324191 | Strange et al. | Dec 2012 | A1 |
20130007559 | Motwani | Jan 2013 | A1 |
20130132638 | Horn et al. | May 2013 | A1 |
20130145106 | Kan | Jun 2013 | A1 |
20130163328 | Karakulak | Jun 2013 | A1 |
20130290793 | Booth et al. | Oct 2013 | A1 |
20140056064 | Kim et al. | Feb 2014 | A1 |
20140059405 | Syu et al. | Feb 2014 | A1 |
20140068382 | Desireddi et al. | Mar 2014 | A1 |
20140101369 | Tomlin et al. | Apr 2014 | A1 |
20140115427 | Lu | Apr 2014 | A1 |
20140133220 | Danilak et al. | May 2014 | A1 |
20140136753 | Tomlin et al. | May 2014 | A1 |
20140149826 | Lu et al. | May 2014 | A1 |
20140157078 | Danilak et al. | Jun 2014 | A1 |
20140181432 | Horn | Jun 2014 | A1 |
20140223255 | Lu et al. | Aug 2014 | A1 |
20140223263 | Sakurada et al. | Aug 2014 | A1 |
Entry |
---|
Notice of Allowance dated Aug. 28, 2014 from U.S. Appl. No. 13/797,923, 8 pages. |
Number | Date | Country | |
---|---|---|---|
20200117536 A1 | Apr 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14584326 | Dec 2014 | US |
Child | 16716378 | US | |
Parent | 13797923 | Mar 2013 | US |
Child | 14584326 | US |