Data storage device executing retry operation by buffering signal samples at different radial offsets

Information

  • Patent Grant
  • 9318137
  • Patent Number
    9,318,137
  • Date Filed
    Tuesday, July 14, 2015
    9 years ago
  • Date Issued
    Tuesday, April 19, 2016
    8 years ago
Abstract
A data storage device is disclosed comprising a head actuated over a disk. The head is positioned at a first radial location over the disk and at least part of a codeword on the disk is read to generate first signal samples. A first quality metric is generated for the first signal samples. The head is positioned at a second radial location over the disk different from the first radial location and at least part of the codeword is read to generate second signal samples. A second quality metric is generated for the second signal samples. A first subset of the first signal samples is combined with a second subset of the second signal samples based on the first and second quality metrics to generate a combined set of signal samples. An attempt is made to decode the codeword based on the combined set of signal samples.
Description
BACKGROUND

Data storage devices such as disk drives comprise a disk and a head connected to a distal end of an actuator arm which is rotated about a pivot by a voice coil motor (VCM) to position the head radially over the disk. The disk comprises a plurality of radially spaced, concentric tracks for recording user data sectors and servo sectors. The servo sectors comprise head positioning information (e.g., a track address) which is read by the head and processed by a servo control system to control the actuator arm as it seeks from track to track.



FIG. 1 shows a prior art disk format 2 as comprising a number of servo tracks 4 defined by servo sectors 60-6N recorded around the circumference of each servo track. Each servo sector 6i comprises a preamble 8 for storing a periodic pattern, which allows proper gain adjustment and timing synchronization of the read signal, and a sync mark 10 for storing a special pattern used to symbol synchronize to a servo data field 12. The servo data field 12 stores coarse head positioning information, such as a servo track address, used to position the head over a target data track during a seek operation. Each servo sector 6i further comprises groups of servo bursts 14 (e.g., N and Q servo bursts), which are recorded with a predetermined phase relative to one another and relative to the servo track centerlines. The phase based servo bursts 14 provide fine head position information used for centerline tracking while accessing a data track during write/read operations. A position error signal (PES) is generated by reading the servo bursts 14, wherein the PES represents a measured position of the head relative to a centerline of a target servo track. A servo controller processes the PES to generate a control signal applied to a head actuator (e.g., a voice coil motor) in order to actuate the head radially over the disk in a direction that reduces the PES.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a prior art disk format comprising a plurality of tracks defined by servo sectors.



FIG. 2A is a data storage device in the form of a disk drive according to an embodiment comprising a head actuated over a disk.



FIG. 2B is a flow diagram according to an embodiment wherein a codeword is read at multiple radial locations and the resulting signal samples merged to decode the codeword.



FIG. 3A illustrates an embodiment wherein at least part of a codeword is written off-track rendering it difficult to decode when read from a single radial location.



FIG. 3B illustrates a quality metric generated over the signal samples of the codeword when read at different radial locations.



FIGS. 4A-4D illustrate an embodiment wherein the codeword is read at multiple radial locations and the best subset of signal samples at each radial location are used to decode the codeword.



FIG. 5A shows control circuitry according to an embodiment wherein the quality metric is generated based on a branch metric of a trellis type sequence detector.



FIGS. 5B and 5C illustrate operation of a trellis type sequence detector according to an embodiment.





DETAILED DESCRIPTION


FIG. 2A shows a data storage device in the form of a disk drive according to an embodiment comprising a head 16 actuated over a disk 18. The disk drive further comprises control circuitry 20 configured to execute the flow diagram of FIG. 2B, wherein the head is positioned at a first radial location over the disk and at least part of a codeword on the disk is read to generate first signal samples (block 22). A first quality metric is generated for the first signal samples (block 24). The head is positioned at a second radial location over the disk different from the first radial location and at least part of the codeword is read to generate second signal samples (block 26). A second quality metric is generated for the second signal samples (block 28). A first subset of the first signal samples is combined with a second subset of the second signal samples based on the first and second quality metrics to generate a combined set of signal samples (block 30). An attempt is made to decode the codeword based on the combined set of signal samples (block 32).


In the embodiment of FIG. 2A, the disk 18 comprises a plurality of servo sectors 340-34N that define a plurality of servo tracks 36, wherein data tracks are defined relative to the servo tracks at the same or different radial density. The control circuitry 20 processes a read signal 38 emanating from the head 16 to demodulate the servo sectors 340-34N and generate a position error signal (PES) representing an error between the actual position of the head and a target position relative to a target track. A servo control system in the control circuitry 20 filters the PES using a suitable compensation filter to generate a control signal 40 applied to a voice coil motor (VCM) 42 which rotates an actuator arm 44 about a pivot in order to actuate the head 16 radially over the disk 18 in a direction that reduces the PES. The servo sectors 340-34N may comprise any suitable head position information, such as a track address for coarse positioning and servo bursts for fine positioning. The servo bursts may comprise any suitable pattern, such as an amplitude based servo pattern or a phase based servo pattern (FIG. 1).


In one embodiment, during a write operation the control circuitry 20 encodes the write data into a codeword that is written to a data track on the disk 18. Any suitable encoding technique may be employed, such as a suitable block code (e.g., Reed-Solomon) or an iterative code (e.g., low density parity check (LDPC)). As the codeword is being written to the disk 18, the head 16 may deviate from the centerline of the data track due, for example, to a vibration affecting the disk drive. As a result, at least part of the codeword may be written too far off-track to allow the codeword to be successfully decoded during a single revolution read operation (i.e., by reading the codeword at a single radial location). FIG. 3A shows an example codeword written to a data track, wherein the codeword comprises multiple segments (14 segments in this example), where each segment comprises any suitable size (e.g., a single bit, a byte, or several bytes). In the example of FIG. 3A, a vibration affecting the disk drive causes the head to deviate from the data track causing the first five segments to be written progressively further away from the centerline. Eventually the control circuitry may abort the current write operation (during the current revolution of the disk) and then later finish writing the remaining segments of the codeword after the vibration dissipates. When attempting to read the codeword shown in FIG. 3A, the control circuitry may initially read the centerline of the data track and attempt to decode the codeword. However, the signal samples generated over one or more of the first five segments may be too low a quality to enable the codeword to be successfully decoded.


When a codeword is not recoverable by reading the centerline of a data track, the prior art has attempted to recover the codeword by rereading the data track at a radial offset. Referring to the example of FIG. 3A, the prior art may attempt to reread the codeword with a radial offset toward the top of the codeword so that on average the quality of the signal samples generated over the entire codeword improves, thereby increasing the chance of a successful decode. However, in some cases the average quality of the signal samples may still be insufficient to render the codeword recoverable even when the head is positioned at the optimal radial location.



FIG. 3B illustrates a quality metric generated for each segment of the codeword shown in FIG. 3A (i.e., for the signal sample(s) corresponding to each segment of the codeword) when the head is positioned at different radial locations relative to a centerline of the data track. In this example, a lower number for the quality metric corresponds to a better quality (a quality metric of 255 represents the worst quality). In this example, the best average quality metric may be generated when reading the codeword at an offset of +5 or possibly at +10, but the codeword may still be unrecoverable if read at either of these offsets (i.e., using all of the signal samples read at a single radial offset). Accordingly, in one embodiment the codeword is read at multiple radial locations and a subset of the resulting signal samples at each radial location are merged based on the resulting quality metrics. The combined set of signal samples may have a sufficiently high quality to enable successful decoding of the codeword.



FIGS. 4A-4D illustrate an example embodiment wherein the signal sample(s) representing each segment of the codeword shown in FIG. 3A are progressively updated by reading the codeword at different radial locations until the combined set of signal samples enables the successful decoding of the codeword. FIG. 4A shows the quality metrics generated over each segment of the codeword when the head is positioned over the centerline of the data track. The quality metrics corresponding to the first five segments may be too poor to enable successful decoding, so the head is positioned at a radial offset of +5 to reread the codeword as illustrated in FIG. 4B. The resulting quality metrics generated for each segment are compared to the quality metrics generated in FIG. 4A. The signal sample(s) corresponding to the better comparable quality metrics are used to replace the corresponding signal sample(s) previously generated. This is illustrated by the highlighted segments shown in FIG. 4B wherein the signal sample(s) corresponding to segments 1-5 and 8 replace the signal samples generated during the previous read operation. A second attempt is then made to decode the codeword based on the combined set of signal samples. If the codeword is still unrecoverable, the process is repeated by rereading the codeword at a radial offset of +10 as shown in FIG. 4C. The signal samples corresponding to the better quality metrics replace the previously stored signal samples and another attempt is made to recover the codeword. If the codeword is still unrecoverable, the process is repeated by rereading the codeword at a radial offset of +15 as shown in FIG. 4D. The signal samples corresponding to the better quality metrics replace the previously stored signal samples and another attempt is made to recover the codeword. Eventually the combined set of signal samples may achieve a sufficiently high quality to enable the successful decoding of the codeword.


In one embodiment, the control circuitry may adjust the radial offset for the head in an arbitrary direction away from the centerline of the data track during the reread operations. The control circuitry may then evaluate the quality metrics for the signal samples to determine whether the quality metrics are improving. If the quality metrics are degrading, the control circuitry may reverse the direction of the radial offset before continuing with the iterations. Referring to the example of FIGS. 4A-4D, the control circuitry may initially offset the head toward the minus direction away from the centerline of the data track (e.g., starting at a radial offset of −5). As shown in FIG. 3B, the resulting quality metrics will eventually become worse than the previously generated quality metrics, and therefore the control circuitry may reverse the direction of offset before proceeding.


In one embodiment, the control circuitry may generate the combined set of signal samples by reading the codeword with both positive and negative offsets. Referring to the example of FIG. 3B, the control circuitry may first read the codeword with an offset of −5 and then replace the signal sample(s) corresponding to segments 9, 11 and 14 since the quality metric would improve from 40 to 20. The control circuitry may then read the codeword at an offset of −10 to determine that the quality metrics are not improving for any of the segments. The control circuitry may then reverse the direction of the offset to update the combined set of signal samples as described above with reference to FIGS. 4A-4D.


The control circuitry may generate any suitable metric when reading a codeword from the disk. FIG. 5A shows control circuitry according to an embodiment wherein the read signal 38 is sampled to generate signal samples 46. The signal samples 46 are filtered with an equalizer filter 48 which may, for example, operate to configure the transfer function of the recording channel into a suitable partial response (PR) recording channel (e.g., a PR4 recording channel). The equalized signal samples 50 corresponding to a codeword are stored in a samples buffer 52 and processed by a suitable trellis type sequence detector 54 (e.g., a Viterbi sequence detector). In one embodiment, the trellis type sequence detector 54 may provide preliminary decisions about the recorded data to facilitate timing recovery and gain control. In one embodiment, the trellis type sequence detector 54 may also generate the quality metrics 56 such as shown in FIG. 3B.


During an initial read of a codeword (e.g., at the data track centerline), the equalized signal samples 50 stored in the samples buffer 52 may be processed by a suitable iterative decoder 58, such as a LDPC decoder, or in another embodiment, a soft-output Viterbi algorithm (SOVA) detector in combination with an LDPC decoder. If the decoding fails, the control circuitry rereads the codeword at a radial offset and the trellis type sequence detector 54 generates the quality metrics 56 for the signal samples. At block 58 the control circuitry replaces the signal samples in the samples buffer 52 when the corresponding quality metric exceeds the previously generated quality metric as described above. The updated combined set of signal samples stored in the samples buffer 52 are again processed by the iterative decoder 58 and the process repeated until the codeword is recoverable (or deemed unrecoverable).



FIG. 5B shows a state transition diagram for a trellis type sequence detector matched to a PR4 target 1-D2. The branches connecting the states in the PR4 state transition diagram of FIG. 5B are labeled with y/x, where y represents the recorded binary data (NRZ encoded) and x represents the corresponding expected signal sample. FIG. 5C shows a trellis corresponding to the PR4 state transition diagram, wherein at any given state, a branch metric is computed (e.g., a Euclidean metric) representing a likelihood of the next recorded bit is a “0” or a “1” given the previous sequence of equalized signal samples. As the bits in the read signal are evaluated, a number of survivor sequences are tracked through the corresponding trellis which eventually merge into a most likely data sequence based on the accumulated branch metrics for each survivor sequence.


In one embodiment, the branch metric generated for each bit of the recorded sequence may represent the quality metric in the embodiment of FIG. 3B such that the stored sequence of signal samples may be updated at a bit resolution after reading a codeword at the different radial offsets. In another embodiment in order to reduce the computation memory, time, and complexity, a quality metric may be generated for a number of bits, or a number of bytes, for example, by averaging the branch metric generated for each bit over a number of the bits. That is, each quality metric shown in FIG. 3B may be generated over a segment of the codeword comprising a number of bits or a block of bytes. In yet another embodiment, the control circuitry may adjust the resolution for the quality metrics in order to increase the correction power during an heroic error recovery procedure. For example, the control circuitry may initially generate each quality metric over a relatively large block of bytes. If the error recovery procedure described above fails to recover the codeword, the control circuitry may re-execute the recovery procedure after increasing the resolution of the quality metrics (i.e., by generating each quality metric over a fewer number of bytes or bits).


Referring again to FIG. 5A, in one embodiment the trellis type sequence detector 54 may generate soft decisions for each bit of the recorded sequence, such as with a SOVA detector. The soft decisions output by the trellis detector 54 may be stored in the samples buffer 52 and processed by the iterative decoder 56. In this embodiment, the quality metrics shown in FIG. 3B may be used to update the soft decisions in the samples buffer 52 when reading the codeword at different radial locations. In other words, the phrase “signal samples” may in one embodiment mean the actual signal samples (or equalized signal samples) of the read signal, and in another embodiment the term may mean soft decisions (including log-likelihood ratios) that may be generated by the trellis type detector 54, the iterative decoder 56, or any other suitable soft decision detector/decoder.


Any suitable control circuitry may be employed to implement the flow diagrams in the above embodiments, such as any suitable integrated circuit or circuits. For example, the control circuitry may be implemented within a read channel integrated circuit, or in a component separate from the read channel, such as a disk controller, or certain operations described above may be performed by a read channel and others by a disk controller. In one embodiment, the read channel and disk controller are implemented as separate integrated circuits, and in an alternative embodiment they are fabricated into a single integrated circuit or system on a chip (SOC). In addition, the control circuitry may include a suitable preamp circuit implemented as a separate integrated circuit, integrated into the read channel or disk controller circuit, or integrated into a SOC.


In one embodiment, the control circuitry comprises a microprocessor executing instructions, the instructions being operable to cause the microprocessor to perform the flow diagrams described herein. The instructions may be stored in any computer-readable medium. In one embodiment, they may be stored on a non-volatile semiconductor memory external to the microprocessor, or integrated with the microprocessor in a SOC. In another embodiment, the instructions are stored on the disk and read into a volatile semiconductor memory when the disk drive is powered on. In yet another embodiment, the control circuitry comprises suitable logic circuitry, such as state machine circuitry.


In various embodiments, a disk drive may include a magnetic disk drive, an optical disk drive, etc. In addition, while the above examples concern a disk drive, the various embodiments are not limited to a disk drive and can be applied to other data storage devices and systems, such as magnetic tape drives, solid state drives, hybrid drives, etc. In addition, some embodiments may include electronic devices such as computing devices, data server devices, media content storage devices, etc. that comprise the storage media and/or control circuitry as described above.


The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method, event or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described tasks or events may be performed in an order other than that specifically disclosed, or multiple may be combined in a single block or state. The example tasks or events may be performed in serial, in parallel, or in some other manner. Tasks or events may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.


While certain example embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions disclosed herein. Thus, nothing in the foregoing description is intended to imply that any particular feature, characteristic, step, module, or block is necessary or indispensable. 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 spirit of the embodiments disclosed herein.

Claims
  • 1. A data storage device comprising: a disk;a head actuated over the disk; andcontrol circuitry configured to: position the head at a first radial location over the disk and read at least part of a codeword on the disk to generate first signal samples;generate a first quality metric for the first signal samples;position the head at a second radial location over the disk different from the first radial location and read at least part of the codeword to generate second signal samples;generate a second quality metric for the second signal samples;combine a first subset of the first signal samples with a second subset of the second signal samples based on the first and second quality metrics to generate a combined set of signal samples; andfirst attempt to decode the codeword based on the combined set of signal samples.
  • 2. The data storage device as recited in claim 1, wherein when the second quality metric indicates a better quality than the first quality metric, the control circuitry is further configured to generate the combined set of signal samples using at least part of the second signal samples corresponding to the second quality metric.
  • 3. The data storage device as recited in claim 1, wherein the control circuitry is further configured to: position the head at a third radial location over the disk different from the first and second radial locations and read at least part of the codeword to generate third signal samples;generate a third quality metric for the third signal samples;modify the combined set of signal samples using the third signal samples based on the third quality metric; andsecond attempt to decode the codeword based on the modified combined set of signal samples.
  • 4. The data storage device as recited in claim 3, wherein when the third quality metric indicates a better quality than the first and second quality metrics, the control circuitry is further configured to modify the combined set of signal samples using at least part of the third signal samples corresponding to the third quality metric.
  • 5. The data storage device as recited in claim 1, wherein the control circuitry is further configured to: generate the first quality metric over a first plurality of the first signal samples; andgenerate the second quality metric over a second plurality of the second signal samples.
  • 6. The data storage device as recited in claim 5, wherein the control circuitry is further configured to: generate the first quality metric based on a first difference between one of the first signal samples and an expected signal sample; andgenerate the second quality metric based on a second difference between one of the second signal samples and an expected signal sample.
  • 7. The data storage device as recited in claim 6, wherein the first difference corresponds to a branch metric of a trellis type sequence detector.
  • 8. The data storage device as recited in claim 7, wherein the control circuitry is further configured to generate the first quality metric based on a plurality of branch metrics generated by the trellis type sequence detector over a plurality of the first signal samples.
  • 9. The data storage device as recited in claim 1, wherein the control circuitry is further configured to: generate the first quality metric based on a first difference between one of the first signal samples and an expected signal sample; andgenerate the second quality metric based on a second difference between one of the second signal samples and an expected signal sample.
  • 10. The data storage device as recited in claim 9, wherein the first difference corresponds to a branch metric of a trellis type sequence detector.
  • 11. A method of operating a data storage device, the method comprising; positioning a head at a first radial location over a disk and reading at least part of a codeword on the disk to generate first signal samples;generating a first quality metric for the first signal samples;positioning the head at a second radial location over the disk different from the first radial location and reading at least part of the codeword to generate second signal samples;generating a second quality metric for the second signal samples;combining a first subset of the first signal samples with a second subset of the second signal samples based on the first and second quality metrics to generate a combined set of signal samples; andfirst attempting to decode the codeword based on the combined set of signal samples.
  • 12. The method as recited in claim 11, wherein when the second quality metric indicates a better quality than the first quality metric, further comprising generating the combined set of signal samples using at least part of the second signal samples corresponding to the second quality metric.
  • 13. The method as recited in claim 11, further comprising: positioning the head at a third radial location over the disk different from the first and second radial locations and reading at least part of the codeword to generate third signal samples;generating a third quality metric for the third signal samples;modifying the combined set of signal samples using the third signal samples based on the third quality metric; andsecond attempting to decode the codeword based on the modified combined set of signal samples.
  • 14. The method as recited in claim 13, wherein when the third quality metric indicates a better quality than the first and second quality metrics, further comprising modifying the combined set of signal samples using at least part of the third signal samples corresponding to the third quality metric.
  • 15. The method as recited in claim 11, further comprising: generating the first quality metric over a first plurality of the first signal samples; andgenerating the second quality metric over a second plurality of the second signal samples.
  • 16. The method as recited in claim 15, further comprising: generating the first quality metric based on a first difference between one of the first signal samples and an expected signal sample; andgenerating the second quality metric based on a second difference between one of the second signal samples and an expected signal sample.
  • 17. The method as recited in claim 16, wherein the first difference corresponds to a branch metric of a trellis type sequence detector.
  • 18. The method as recited in claim 17, further comprising generating the first quality metric based on a plurality of branch metrics generated by the trellis type sequence detector over a plurality of the first signal samples.
  • 19. The method as recited in claim 11, further comprising: generating the first quality metric based on a first difference between one of the first signal samples and an expected signal sample; andgenerating the second quality metric based on a second difference between one of the second signal samples and an expected signal sample.
  • 20. The method as recited in claim 19, wherein the first difference corresponds to a branch metric of a trellis type sequence detector.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to provisional U.S. Patent Application Ser. No. 62/133,105, filed on Mar. 13, 2015, which is hereby incorporated by reference in its entirety.

US Referenced Citations (468)
Number Name Date Kind
6018789 Sokolov et al. Jan 2000 A
6065095 Sokolov et al. May 2000 A
6078452 Kittilson et al. Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6092149 Hicken et al. Jul 2000 A
6092150 Sokolov et al. Jul 2000 A
6094707 Sokolov et al. Jul 2000 A
6105104 Guttmann et al. Aug 2000 A
6111717 Cloke et al. Aug 2000 A
6145052 Howe et al. Nov 2000 A
6175893 D'Souza et al. Jan 2001 B1
6178056 Cloke et al. Jan 2001 B1
6191909 Cloke et al. Feb 2001 B1
6195218 Guttmann et al. Feb 2001 B1
6205494 Williams Mar 2001 B1
6208477 Cloke et al. Mar 2001 B1
6223303 Billings et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6246346 Cloke et al. Jun 2001 B1
6249393 Billings et al. Jun 2001 B1
6256695 Williams Jul 2001 B1
6262857 Hull et al. Jul 2001 B1
6263459 Schibilla Jul 2001 B1
6272694 Weaver et al. Aug 2001 B1
6278568 Cloke et al. Aug 2001 B1
6279089 Schibilla et al. Aug 2001 B1
6289484 Rothberg et al. Sep 2001 B1
6292912 Cloke et al. Sep 2001 B1
6310740 Dunbar et al. Oct 2001 B1
6317850 Rothberg Nov 2001 B1
6327106 Rothberg Dec 2001 B1
6337778 Gagne Jan 2002 B1
6369969 Christiansen et al. Apr 2002 B1
6369974 Asgari et al. Apr 2002 B1
6384999 Schibilla May 2002 B1
6388833 Golowka et al. May 2002 B1
6405342 Lee Jun 2002 B1
6408357 Hanmann et al. Jun 2002 B1
6408406 Parris Jun 2002 B1
6411452 Cloke Jun 2002 B1
6411458 Billings et al. Jun 2002 B1
6412083 Rothberg et al. Jun 2002 B1
6415349 Hull et al. Jul 2002 B1
6425128 Krapf et al. Jul 2002 B1
6441981 Cloke et al. Aug 2002 B1
6442328 Elliott et al. Aug 2002 B1
6445524 Nazarian et al. Sep 2002 B1
6449767 Krapf et al. Sep 2002 B1
6453115 Boyle Sep 2002 B1
6470420 Hospodor Oct 2002 B1
6480020 Jung et al. Nov 2002 B1
6480349 Kim et al. Nov 2002 B1
6480932 Vallis et al. Nov 2002 B1
6483986 Krapf Nov 2002 B1
6487032 Cloke et al. Nov 2002 B1
6490635 Holmes Dec 2002 B1
6493173 Kim et al. Dec 2002 B1
6499083 Hamlin Dec 2002 B1
6519104 Cloke et al. Feb 2003 B1
6525892 Dunbar et al. Feb 2003 B1
6545830 Briggs et al. Apr 2003 B1
6546489 Frank, Jr. et al. Apr 2003 B1
6550021 Dalphy et al. Apr 2003 B1
6552880 Dunbar et al. Apr 2003 B1
6553457 Wilkins et al. Apr 2003 B1
6578106 Price Jun 2003 B1
6580573 Hull et al. Jun 2003 B1
6594183 Lofgren et al. Jul 2003 B1
6600620 Krounbi et al. Jul 2003 B1
6601137 Castro et al. Jul 2003 B1
6603622 Christiansen et al. Aug 2003 B1
6603625 Hospodor et al. Aug 2003 B1
6604220 Lee Aug 2003 B1
6606682 Dang et al. Aug 2003 B1
6606714 Thelin Aug 2003 B1
6606717 Yu et al. Aug 2003 B1
6611393 Nguyen et al. Aug 2003 B1
6615312 Hamlin et al. Sep 2003 B1
6639748 Christiansen et al. Oct 2003 B1
6647481 Luu et al. Nov 2003 B1
6654193 Thelin Nov 2003 B1
6657810 Kupferman Dec 2003 B1
6661591 Rothberg Dec 2003 B1
6665772 Hamlin Dec 2003 B1
6687073 Kupferman Feb 2004 B1
6687078 Kim Feb 2004 B1
6687850 Rothberg Feb 2004 B1
6690523 Nguyen et al. Feb 2004 B1
6690882 Hanmann et al. Feb 2004 B1
6691198 Hamlin Feb 2004 B1
6691213 Luu et al. Feb 2004 B1
6691255 Rothberg et al. Feb 2004 B1
6693760 Krounbi et al. Feb 2004 B1
6693764 Sheh et al. Feb 2004 B1
6694477 Lee Feb 2004 B1
6697914 Hospodor et al. Feb 2004 B1
6704153 Rothberg et al. Mar 2004 B1
6708251 Boyle et al. Mar 2004 B1
6710951 Cloke Mar 2004 B1
6711628 Thelin Mar 2004 B1
6711635 Wang Mar 2004 B1
6711660 Milne et al. Mar 2004 B1
6714371 Codilian Mar 2004 B1
6715044 Lofgren et al. Mar 2004 B2
6724982 Hamlin Apr 2004 B1
6725329 Ng et al. Apr 2004 B1
6735033 Codilian et al. May 2004 B1
6735650 Rothberg May 2004 B1
6735693 Hamlin May 2004 B1
6744772 Eneboe et al. Jun 2004 B1
6745283 Dang Jun 2004 B1
6751402 Elliott et al. Jun 2004 B1
6757481 Nazarian et al. Jun 2004 B1
6772281 Hamlin Aug 2004 B2
6781780 Codilian Aug 2004 B1
6781826 Goldstone et al. Aug 2004 B1
6782449 Codilian et al. Aug 2004 B1
6791779 Singh et al. Sep 2004 B1
6792486 Hanan et al. Sep 2004 B1
6799274 Hamlin Sep 2004 B1
6811427 Garrett et al. Nov 2004 B2
6826003 Subrahmanyam Nov 2004 B1
6826614 Hanmann et al. Nov 2004 B1
6832041 Boyle Dec 2004 B1
6832929 Garrett et al. Dec 2004 B2
6845405 Thelin Jan 2005 B1
6845427 Atai-Azimi Jan 2005 B1
6850443 Lofgren et al. Feb 2005 B2
6851055 Boyle et al. Feb 2005 B1
6851063 Boyle et al. Feb 2005 B1
6853731 Boyle et al. Feb 2005 B1
6854022 Thelin Feb 2005 B1
6862660 Wilkins et al. Mar 2005 B1
6880043 Castro et al. Apr 2005 B1
6882486 Kupferman Apr 2005 B1
6884085 Goldstone Apr 2005 B1
6888831 Hospodor et al. May 2005 B1
6892217 Hanmann et al. May 2005 B1
6892249 Codilian et al. May 2005 B1
6892313 Codilian et al. May 2005 B1
6895455 Rothberg May 2005 B1
6895500 Rothberg May 2005 B1
6898730 Hanan May 2005 B1
6910099 Wang et al. Jun 2005 B1
6928470 Hamlin Aug 2005 B1
6931439 Hanmann et al. Aug 2005 B1
6934104 Kupferman Aug 2005 B1
6934713 Schwartz et al. Aug 2005 B2
6940873 Boyle et al. Sep 2005 B2
6943978 Lee Sep 2005 B1
6948165 Luu et al. Sep 2005 B1
6950267 Liu et al. Sep 2005 B1
6954733 Ellis et al. Oct 2005 B1
6961814 Thelin et al. Nov 2005 B1
6965489 Lee et al. Nov 2005 B1
6965563 Hospodor et al. Nov 2005 B1
6965966 Rothberg et al. Nov 2005 B1
6967799 Lee Nov 2005 B1
6968422 Codilian et al. Nov 2005 B1
6968450 Rothberg et al. Nov 2005 B1
6973495 Milne et al. Dec 2005 B1
6973570 Hamlin Dec 2005 B1
6976190 Goldstone Dec 2005 B1
6983316 Milne et al. Jan 2006 B1
6986007 Procyk et al. Jan 2006 B1
6986154 Price et al. Jan 2006 B1
6995933 Codilian et al. Feb 2006 B1
6996501 Rothberg Feb 2006 B1
6996669 Dang et al. Feb 2006 B1
7002926 Eneboe et al. Feb 2006 B1
7003674 Hamlin Feb 2006 B1
7006316 Sargenti, Jr. et al. Feb 2006 B1
7009820 Hogg Mar 2006 B1
7023639 Kupferman Apr 2006 B1
7024491 Hanmann et al. Apr 2006 B1
7024549 Luu et al. Apr 2006 B1
7024614 Thelin et al. Apr 2006 B1
7027716 Boyle et al. Apr 2006 B1
7028174 Atai-Azimi et al. Apr 2006 B1
7031902 Catiller Apr 2006 B1
7046465 Kupferman May 2006 B1
7046488 Hogg May 2006 B1
7050252 Vallis May 2006 B1
7054937 Milne et al. May 2006 B1
7055000 Severtson May 2006 B1
7055167 Masters May 2006 B1
7057836 Kupferman Jun 2006 B1
7062398 Rothberg Jun 2006 B1
7075746 Kupferman Jul 2006 B1
7076604 Thelin Jul 2006 B1
7082494 Thelin et al. Jul 2006 B1
7088535 Kim et al. Aug 2006 B2
7088538 Codilian et al. Aug 2006 B1
7088545 Singh et al. Aug 2006 B1
7092186 Hogg Aug 2006 B1
7095577 Codilian et al. Aug 2006 B1
7099095 Subrahmanyam et al. Aug 2006 B1
7106537 Bennett Sep 2006 B1
7106947 Boyle et al. Sep 2006 B2
7110202 Vasquez Sep 2006 B1
7111116 Boyle et al. Sep 2006 B1
7114029 Thelin Sep 2006 B1
7120737 Thelin Oct 2006 B1
7120806 Codilian et al. Oct 2006 B1
7126776 Warren, Jr. et al. Oct 2006 B1
7129763 Bennett et al. Oct 2006 B1
7133600 Boyle Nov 2006 B1
7136244 Rothberg Nov 2006 B1
7146094 Boyle Dec 2006 B1
7149046 Coker et al. Dec 2006 B1
7150036 Milne et al. Dec 2006 B1
7155616 Hamlin Dec 2006 B1
7171108 Masters et al. Jan 2007 B1
7171110 Wilshire Jan 2007 B1
7194576 Boyle Mar 2007 B1
7200698 Rothberg Apr 2007 B1
7205805 Bennett Apr 2007 B1
7206497 Boyle et al. Apr 2007 B1
7206990 Su et al. Apr 2007 B2
7215496 Kupferman et al. May 2007 B1
7215771 Hamlin May 2007 B1
7237054 Cain et al. Jun 2007 B1
7240161 Boyle Jul 2007 B1
7249365 Price et al. Jul 2007 B1
7263709 Krapf Aug 2007 B1
7274639 Codilian et al. Sep 2007 B1
7274659 Hospodor Sep 2007 B2
7275116 Hanmann et al. Sep 2007 B1
7280302 Masiewicz Oct 2007 B1
7292774 Masters et al. Nov 2007 B1
7292775 Boyle et al. Nov 2007 B1
7296284 Price et al. Nov 2007 B1
7302501 Cain et al. Nov 2007 B1
7302579 Cain et al. Nov 2007 B1
7318088 Mann Jan 2008 B1
7319806 Willner et al. Jan 2008 B1
7325244 Boyle et al. Jan 2008 B2
7330323 Singh et al. Feb 2008 B1
7346790 Klein Mar 2008 B1
7366641 Masiewicz et al. Apr 2008 B1
7369340 Dang et al. May 2008 B1
7369343 Yeo et al. May 2008 B1
7372650 Kupferman May 2008 B1
7380147 Sun May 2008 B1
7392340 Dang et al. Jun 2008 B1
7404013 Masiewicz Jul 2008 B1
7406545 Rothberg et al. Jul 2008 B1
7415571 Hanan Aug 2008 B1
7436610 Thelin Oct 2008 B1
7437502 Coker Oct 2008 B1
7440214 Ell et al. Oct 2008 B1
7451344 Rothberg Nov 2008 B1
7471483 Ferris et al. Dec 2008 B1
7471486 Coker et al. Dec 2008 B1
7486060 Bennett Feb 2009 B1
7496493 Stevens Feb 2009 B1
7518819 Yu et al. Apr 2009 B1
7526184 Parkinen et al. Apr 2009 B1
7539924 Vasquez et al. May 2009 B1
7543117 Hanan Jun 2009 B1
7551383 Kupferman Jun 2009 B1
7562282 Rothberg Jul 2009 B1
7577973 Kapner, III et al. Aug 2009 B1
7596797 Kapner, III et al. Sep 2009 B1
7599139 Bombet et al. Oct 2009 B1
7602576 Yoshida Oct 2009 B2
7602863 Kovintavewat et al. Oct 2009 B2
7619841 Kupferman Nov 2009 B1
7647544 Masiewicz Jan 2010 B1
7649704 Bombet et al. Jan 2010 B1
7653927 Kapner, III et al. Jan 2010 B1
7656603 Xing Feb 2010 B1
7656763 Jin et al. Feb 2010 B1
7657149 Boyle Feb 2010 B2
7672072 Boyle et al. Mar 2010 B1
7673075 Masiewicz Mar 2010 B1
7688540 Mei et al. Mar 2010 B1
7724461 McFadyen et al. May 2010 B1
7725584 Hanmann et al. May 2010 B1
7730295 Lee Jun 2010 B1
7760458 Trinh Jul 2010 B1
7768776 Szeremeta et al. Aug 2010 B1
7804657 Hogg et al. Sep 2010 B1
7813954 Price et al. Oct 2010 B1
7827320 Stevens Nov 2010 B1
7839588 Dang et al. Nov 2010 B1
7843660 Yeo Nov 2010 B1
7852596 Boyle et al. Dec 2010 B2
7859782 Lee Dec 2010 B1
7872822 Rothberg Jan 2011 B1
7898756 Wang Mar 2011 B1
7898762 Guo et al. Mar 2011 B1
7900037 Fallone et al. Mar 2011 B1
7907364 Boyle et al. Mar 2011 B2
7929234 Boyle et al. Apr 2011 B1
7933087 Tsai et al. Apr 2011 B1
7933090 Jung et al. Apr 2011 B1
7934030 Sargenti, Jr. et al. Apr 2011 B1
7940491 Szeremeta et al. May 2011 B2
7944639 Wang May 2011 B1
7945727 Rothberg et al. May 2011 B2
7949564 Hughes et al. May 2011 B1
7974029 Tsai et al. Jul 2011 B2
7974039 Xu et al. Jul 2011 B1
7978428 Cho et al. Jul 2011 B2
7982993 Tsai et al. Jul 2011 B1
7984200 Bombet et al. Jul 2011 B1
7990648 Wang Aug 2011 B1
7992179 Kapner, III et al. Aug 2011 B1
8004785 Tsai et al. Aug 2011 B1
8006027 Stevens et al. Aug 2011 B1
8014094 Jin Sep 2011 B1
8014977 Masiewicz et al. Sep 2011 B1
8019914 Vasquez et al. Sep 2011 B1
8040625 Boyle et al. Oct 2011 B1
8078943 Lee Dec 2011 B1
8079045 Krapf et al. Dec 2011 B2
8082433 Fallone et al. Dec 2011 B1
8085487 Jung et al. Dec 2011 B1
8089719 Dakroub Jan 2012 B1
8090902 Bennett et al. Jan 2012 B1
8090906 Blaha et al. Jan 2012 B1
8091112 Elliott et al. Jan 2012 B1
8094396 Zhang et al. Jan 2012 B1
8094401 Peng et al. Jan 2012 B1
8116020 Lee Feb 2012 B1
8116025 Chan et al. Feb 2012 B1
8134793 Vasquez et al. Mar 2012 B1
8134798 Thelin et al. Mar 2012 B1
8139301 Li et al. Mar 2012 B1
8139310 Hogg Mar 2012 B1
8144419 Liu Mar 2012 B1
8145452 Masiewicz et al. Mar 2012 B1
8149528 Suratman et al. Apr 2012 B1
8154812 Boyle et al. Apr 2012 B1
8159768 Miyamura Apr 2012 B1
8161328 Wilshire Apr 2012 B1
8164849 Szeremeta et al. Apr 2012 B1
8174780 Tsai et al. May 2012 B1
8190575 Ong et al. May 2012 B1
8194338 Zhang Jun 2012 B1
8194340 Boyle et al. Jun 2012 B1
8194341 Boyle Jun 2012 B1
8201066 Wang Jun 2012 B1
8271692 Dinh et al. Sep 2012 B1
8279550 Hogg Oct 2012 B1
8281218 Ybarra et al. Oct 2012 B1
8285923 Stevens Oct 2012 B2
8289656 Huber Oct 2012 B1
8305705 Roohr Nov 2012 B1
8307156 Codilian et al. Nov 2012 B1
8310775 Boguslawski et al. Nov 2012 B1
8315006 Chahwan et al. Nov 2012 B1
8316263 Gough et al. Nov 2012 B1
8320067 Tsai et al. Nov 2012 B1
8324974 Bennett Dec 2012 B1
8332695 Dalphy et al. Dec 2012 B2
8339919 Lee Dec 2012 B1
8341337 Ong et al. Dec 2012 B1
8350628 Bennett Jan 2013 B1
8356184 Meyer et al. Jan 2013 B1
8370683 Ryan et al. Feb 2013 B1
8375225 Ybarra Feb 2013 B1
8375274 Bonke Feb 2013 B1
8380922 Deforest et al. Feb 2013 B1
8390948 Hogg Mar 2013 B2
8390952 Szeremeta Mar 2013 B1
8392689 Lott Mar 2013 B1
8407393 Yolar et al. Mar 2013 B1
8413010 Vasquez et al. Apr 2013 B1
8417566 Price et al. Apr 2013 B2
8421663 Bennett Apr 2013 B1
8422172 Dakroub et al. Apr 2013 B1
8427770 O'Dell et al. Apr 2013 B1
8427771 Tsai Apr 2013 B1
8429343 Tsai Apr 2013 B1
8433937 Wheelock et al. Apr 2013 B1
8433977 Vasquez et al. Apr 2013 B1
8441909 Thayamballi et al. May 2013 B1
8456980 Thayamballi Jun 2013 B1
8458526 Dalphy et al. Jun 2013 B2
8462466 Huber Jun 2013 B2
8467151 Huber Jun 2013 B1
8483027 Mak et al. Jul 2013 B1
8489841 Strecke et al. Jul 2013 B1
8493679 Boguslawski et al. Jul 2013 B1
8499198 Messenger et al. Jul 2013 B1
8514506 Li et al. Aug 2013 B1
8554741 Malina Oct 2013 B1
8560759 Boyle et al. Oct 2013 B1
8576509 Hogg Nov 2013 B1
8576511 Coker et al. Nov 2013 B1
8578100 Huynh et al. Nov 2013 B1
8578242 Burton et al. Nov 2013 B1
8582223 Garani et al. Nov 2013 B1
8582231 Kermiche et al. Nov 2013 B1
8589773 Wang et al. Nov 2013 B1
8593753 Anderson Nov 2013 B1
8599512 Hogg Dec 2013 B2
8605379 Sun Dec 2013 B1
8611031 Tan et al. Dec 2013 B1
8611032 Champion et al. Dec 2013 B2
8612798 Tsai Dec 2013 B1
8619383 Jung et al. Dec 2013 B1
8619508 Krichevsky et al. Dec 2013 B1
8619529 Liew et al. Dec 2013 B1
8621115 Bombet et al. Dec 2013 B1
8621133 Boyle Dec 2013 B1
8625224 Lin et al. Jan 2014 B1
8625225 Wang Jan 2014 B1
8626463 Stevens et al. Jan 2014 B2
8630052 Jung et al. Jan 2014 B1
8631188 Heath et al. Jan 2014 B1
8635412 Wilshire Jan 2014 B1
8661193 Cobos et al. Feb 2014 B1
8665547 Yeo et al. Mar 2014 B1
8667248 Neppalli Mar 2014 B1
8670205 Malina et al. Mar 2014 B1
8671250 Lee Mar 2014 B2
8681442 Hogg Mar 2014 B2
8681445 Kermiche et al. Mar 2014 B1
8683295 Syu et al. Mar 2014 B1
8687306 Coker et al. Apr 2014 B1
8687307 Patton, III Apr 2014 B1
8687313 Selvaraj Apr 2014 B2
8693133 Lee et al. Apr 2014 B1
8698492 Mak et al. Apr 2014 B1
8699171 Boyle Apr 2014 B1
8699172 Gunderson et al. Apr 2014 B1
8711500 Fong et al. Apr 2014 B1
8711506 Giovenzana et al. Apr 2014 B1
8711665 Hamid Apr 2014 B1
8717694 Liew et al. May 2014 B1
8717695 Lin et al. May 2014 B1
8730612 Haralson May 2014 B1
8743502 Bonke et al. Jun 2014 B1
8749911 Sun et al. Jun 2014 B1
8753146 Szeremeta et al. Jun 2014 B1
8755136 Ng et al. Jun 2014 B1
8756361 Carlson et al. Jun 2014 B1
8760782 Garani et al. Jun 2014 B1
8760792 Tam Jun 2014 B1
8769593 Schwartz et al. Jul 2014 B1
8773793 McFadyen Jul 2014 B1
8773802 Anderson et al. Jul 2014 B1
8773807 Chia et al. Jul 2014 B1
8773957 Champion et al. Jul 2014 B1
8780470 Wang et al. Jul 2014 B1
8782334 Boyle et al. Jul 2014 B1
8786976 Kang et al. Jul 2014 B1
8787125 Lee Jul 2014 B1
8792196 Lee Jul 2014 B1
8792200 Tam et al. Jul 2014 B1
8797667 Barlow et al. Aug 2014 B1
8799977 Kapner, III et al. Aug 2014 B1
8810940 Jin et al. Aug 2014 B2
8817413 Knigge et al. Aug 2014 B1
8817584 Selvaraj Aug 2014 B1
8825976 Jones Sep 2014 B1
8825977 Syu et al. Sep 2014 B1
8922931 Ji et al. Dec 2014 B1
20090113702 Hogg May 2009 A1
20100306551 Meyer et al. Dec 2010 A1
20110226729 Hogg Sep 2011 A1
20120159042 Lott et al. Jun 2012 A1
20120275050 Wilson et al. Nov 2012 A1
20120281963 Krapf et al. Nov 2012 A1
20120324980 Nguyen et al. Dec 2012 A1
Provisional Applications (1)
Number Date Country
62133105 Mar 2015 US