Data storage device using branch metric from adjacent track to compensate for inter-track interference

Information

  • Patent Grant
  • 9025267
  • Patent Number
    9,025,267
  • Date Filed
    Monday, June 9, 2014
    9 years ago
  • Date Issued
    Tuesday, May 5, 2015
    9 years ago
Abstract
A data storage device is disclosed comprising a disk comprising a plurality of data tracks, and a head comprising a first read element and a second read element. A first data track is read using the first read element to generate a first read signal, and the first read signal is sampled to generate first signal samples. A first branch metric is generated in a first trellis sequence detector when detecting a first data sequence based on one of the first signal samples. A second data track adjacent the first data track is read using the second read element to generate a second read signal, and the second read signal is sampled to generate second signal samples. A second branch metric is generated in a second trellis sequence detector when detecting a second data sequence based on one of the second signal samples and the first branch metric.
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.


Data is typically written to data sectors within a data track by modulating the write current of a write element, for example, using a non-return to zero (NRZ) signal, thereby writing magnetic transitions onto the disk surface. A read element (e.g., a magnetoresistive (MR) element) is then used to transduce the magnetic transitions into a read signal that is demodulated by a read channel. The recording and reproduction process may be considered a communication channel, wherein communication demodulation techniques may be employed to demodulate the read signal.


When reading data from the disk, a read channel typically samples the read signal to generate signal samples that are equalized according to a target response (e.g., a partial response). A sequence detector (e.g., a Viterbi detector) detects an estimated data sequence from the equalized samples, and errors in the estimated data sequence are corrected, for example, using a Reed-Solomon error correction code (ECC) or using a Low Density Parity Check (LDPC) code.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a prior art disk format comprising servo tracks defined by servo sectors.



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



FIG. 2B shows an embodiment wherein the head comprises a first read element positioned over a first data track and a second read element positioned over a second data track.



FIG. 2C is a flow diagram according to an embodiment wherein a second branch metric in a second trellis sequence detector is generated when detecting a second data sequence based on second signal samples and a first branch metric generated by a first trellis sequence detector.



FIG. 3A shows an example state transition diagram for a sixteen state trellis sequence detector according to an embodiment.



FIG. 3B illustrates an embodiment for generating the branch metrics for the branch transitions of two states of a second trellis sequence detector based on an expected sample corresponding to a branch selected by a first trellis sequence detector.



FIG. 4A illustrates an embodiment wherein the signal samples are equalized using a two-dimensional (2D) equalizer, and the equalized samples processed by respective trellis sequence detectors.



FIG. 4B illustrates an embodiment wherein when generating the branch metrics, each trellis sequence detector iterates based on the branch selected by the other trellis sequence detector.



FIG. 5 shows an embodiment wherein the head comprises three read elements for generating a read signal from three adjacent data tracks, and three trellis sequence detectors that iterate based on the branches selected in the adjacent trellis sequence detectors.





DETAILED DESCRIPTION


FIG. 2A shows a data storage device in the form of a disk drive according to an embodiment comprising a disk 16 comprising a plurality of data tracks 18, and a head 20 actuated over the disk 16, the head 20 comprising a plurality of read elements including a first read element 22A and a second read element 22B (FIG. 2B). The disk drive further comprises control circuitry 24 configured to execute the flow diagram of FIG. 2C, wherein a first data track (FIG. 2B) is read using the first read element to generate a first read signal (block 26), and the first read signal is sampled to generate first signal samples (block 28). A first branch metric is generated in a first trellis sequence detector when detecting a first data sequence based on one of the first signal samples (block 30). A second data track adjacent the first data track (FIG. 2B) is read using the second read element to generate a second read signal (block 32), and the second read signal is sampled to generate second signal samples (block 34). A second branch metric is generated in a second trellis sequence detector when detecting a second data sequence based on one of the second signal samples and the first branch metric (block 36).


In the embodiment of FIG. 2A, a plurality of concentric servo tracks are defined by embedded servo sectors 380-38N, wherein the data tracks 18 are defined relative to the servo tracks at the same or different radial density. The control circuitry 24 processes at least one read signal 40 emanating from the head 20 to demodulate the servo sectors 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. The control circuitry 24 filters the PES using a suitable compensation filter to generate a control signal 42 applied to a voice coil motor (VCM) 44 which rotates an actuator arm 46 about a pivot in order to actuate the head 20 radially over the disk 16 in a direction that reduces the PES. The control circuitry 24 may also generate a control signal applied to a microactuator (not shown) in order to actuate the head 20 over the disk 16 in fine movements. Any suitable microactuator may be employed, such as a piezoelectric actuator. In addition, the microactuator may actuate the head 20 over the disk 16 in any suitable manner, such as by actuating a suspension relative to the actuator arm, or actuating a slider relative to the suspension. The servo sectors 380-38N 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.


The data is typically recorded in a data track using partial response signaling meaning that the waveform response of each recorded bit overlaps with the waveform response of one or more of the linear adjacent bits resulting in a controlled amount of downtrack interference (DTI) in the read signal (also referred to as intersymbol interference (ISI)). Demodulating the read signal involves sampling the read signal and estimating a data sequence based on the likelihood that the signal samples correspond to the expected samples of a possible data sequences. To facilitate this demodulation, a trellis type sequence detector is typically employed comprising a state machine that corresponds to the possible data sequences based on the length of the DTI (number of bits affected). FIG. 3A shows an example state transition diagram for a sixteen state trellis that corresponds to a DTI length of four bits. At any given state, a branch metric is computed (e.g., a Euclidean metric) representing a likelihood of the next downtrack bit being a “0” or a “1”. 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.


As the data tracks 20 are squeezed closer together in an attempt to increase the capacity of the disk 16, the data bits recorded in the first data track may induce an intertrack interference (ITI) in the read signal of the second data track (and vise versa). Accordingly, in one embodiment a trellis type sequence detector is employed that takes into account the intertrack interference caused by the data sequence recorded in at least one adjacent data track. FIG. 3B illustrates an example embodiment wherein a second branch metric (BM) computed for each state of the state transition diagram of a second trellis sequence detector is computed based on an expected sample corresponding to a first branch selected by a first trellis sequence detector. In this example, the second branch metric (BM2) is computed as a Euclidean metric:

BM2=∥2(k)−d2−αd12

where y2(k) represents a second signal sample generated by sampling a second read signal, d2 represents a second expected sample corresponding to a second branch of the second trellis sequence detector, d1 represents a first expected sample corresponding to a first branch selected by the first trellis sequence detector based on a first branch metric when detecting a first data sequence, and α is a scalar. In an embodiment described below, the second branch metric (BM2) may also be computed based on an expected sample corresponding to a third branch of a third trellis detector configured to detect a third data sequence in a third data track adjacent the second data track.


In the above Euclidean metric equation, the expected sample d1 of the adjacent data track is scaled by a scalar α to account for the degree the ITI affects the read signal sample of the second data track as determined by the radial spacing of the first data track relative to the second data track. That is, the scalar α increases as the spacing between the data tracks decreases. In one embodiment, the scalar α may be calibrated during a manufacturing procedure, and/or tuned during normal read operations such as during retry operations. For example, the scalar α may be tuned relative to a suitable quality metric, such as a bit error rate of the sequence detector. In one embodiment, the spacing of the data tracks may vary over the radius of the disk, and/or the spacing between the read elements may change as the skew angle of the head changes, and therefore the scalar α may be calibrated and then configured during normal read operations based on the radial location of the head.



FIG. 4A shows control circuitry according to an embodiment wherein the first signal samples 48A of the first read signal and the second signal samples 48B of the second read signal are equalized by a two-dimensional (2D) equalizer 50 to generate first equalized samples 52A and second equalized samples 52B. A first trellis sequence detector 54A processes the first equalized samples 52A to detect a first data sequence 56A, and a second trellis sequence detector 54B processes the second equalized samples 52B to detect a second data sequence 56B. During the sequence detection process when each trellis sequence detector reaches a particular point in the trellis corresponding to a particular signal sample y(k) of each data track, the trellis sequence detectors 54A and 54B pass an expected sample d to the other trellis sequence detector, where the expected sample d corresponds to a branch that would be selected by the other trellis sequence detector. In one embodiment, the trellis sequence detectors 54A and 54B may iterate on the expected samples d until both trellis sequence detectors converge to a final answer for the branch metrics.



FIG. 4B illustrates an example of this embodiment wherein the first trellis sequence detector 54A processes a signal sample y1(k) to select a first branch metric BM1 based on an expected sample d1 corresponding to each branch (e.g., selects one of two branches based on the minimum branch metric). The expected sample d1 corresponding to the first branch metric BM1 is passed to the second trellis sequence detector 54B which processes a signal sample y2(k) to select a second branch metric BM2 based on an expected sample d2 corresponding to each branch as well as the expected sample d1 received from the first trellis sequence detector 54A. The expected sample d2 corresponding to the second branch metric BM2 is passed to the second trellis sequence detector 54B which updates the computations of the first branch metric for each branch as illustrated in FIG. 4B. After updating the branch metrics based on the expected sample d2 received from the second trellis sequence detector 54B, the first trellis sequence detector 54A may select a different branch corresponding to a different branch metric BM1 and corresponding different expected sample d1. The updated expected sample d1 is then passed to the second trellis sequence detector 54B which updates its branch metrics accordingly. This process may be iterated any number of times, for example, until both trellis sequence detectors 54A and 54B converge to a final answer for the best branch to select.



FIG. 2C illustrates an embodiment wherein the first read element 24A may be offset from the second read element 24B by a downtrack spacing as well as a cross-track spacing. Accordingly, in one embodiment the control circuitry may compensate for the downtrack spacing by time aligning (through a delay) the signal samples of the first and second read signals prior to, or as part of, the 2D equalizer 50 shown in FIG. 4A. In one embodiment, the signal samples from one or both read signals may be buffered to facilitate the time aligning of the signals.


In one embodiment, buffering the signal samples may also compensate for the latency of the trellis sequence detectors 54A and 54B due to the iterations when computing the branch metrics as described above. In one embodiment, the number of iterations allowed for each signal sample may also be limited based on the free space available in the signal samples buffer. That is, as the free space decreases due to the latency of the trellis sequence detectors 54A and 54B, the number of iterations allowed at each signal sample may be reduced. In yet another embodiment, the number of iterations may range from zero to N based on a confidence metric associated with each branch metric selected. For example, if the difference between the branch metrics for two branches is significant, indicating a high confidence in the minimum branch metric, then to reduce the latency the trellis sequence detectors 54A and 54B may skip the step of updating the branch metrics based on expected samples passed between the trellis sequence detectors as described above.



FIG. 5 shows an embodiment wherein head 20 comprises a third read element and the control circuitry 24 is further configured to read a third data track using the third read element to generate a third read signal, and sample the third read signal to generate third signal samples 48C. A third branch metric is generated in a third trellis sequence detector 54C when detecting a third data sequence 56C based on one of the third signal samples 48C. The second branch metric is generated in the second trellis sequence detector 54B when detecting the second data sequence 56B based on one of the second signal samples 48B, the first branch metric, and the third branch metric. In one embodiment, the second trellis sequence detector 54B is configured to generate the second branch metric when detecting the second data sequence 56B based on a third expected sample d3 corresponding to a third branch selected by the third trellis sequence detector 54C based on the third branch metric when detecting the third data sequence 56C. Similarly, the third trellis sequence detector 54C may be configured to generate the third branch metric when detecting the third data sequence 56B based on the second expected sample d2 corresponding to the second branch selected by the second trellis sequence detector 54B based on the second branch metric when detecting the second data sequence 56B. In one embodiment, the three trellis sequence detectors 54A-54C shown in FIG. 5 may iterate any suitable number of times as described above with reference to FIG. 4B.


In one embodiment, the 2D equalizer 50 shown in the examples of FIGS. 4A and 5 may equalize the signal samples to generate one-dimensional (1D) equalized samples processed by 1D trellis sequence detectors. That is, the 2D equalizer 50 may perform 2D-to-1D equalization, and the trellis sequence detectors may perform 1D sequence detection based on a single stream of equalized samples corresponding to a single data track. In another embodiment, the 2D equalizer 50 may comprise a 2D-to-2D equalizer that equalizes the signal samples to generate 2D equalized samples processed by 2D trellis sequence detectors. That is, the trellis sequence detectors may perform 2D sequence detection based on multiple (e.g., two or three) streams of equalized samples corresponding to multiple data tracks.


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.


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 comprising a plurality of data tracks;a head actuated over the disk, the head comprising a plurality of read elements including a first read element and a second read element; andcontrol circuitry configured to: read a first data track using the first read element to generate a first read signal;sample the first read signal to generate first signal samples;generate a first branch metric in a first trellis sequence detector when detecting a first data sequence based on one of the first signal samples;read a second data track adjacent the first data track using the second read element to generate a second read signal;sample the second read signal to generate second signal samples; andwhen detecting a second data sequence, generate a second branch metric in a second trellis sequence detector based on one of the second signal samples and the first branch metric.
  • 2. The data storage device as recited in claim 1, wherein the control circuitry is further operable to generate the second branch metric based on: BM2=∥y2(k)−d2−αd1∥2 where:d1 represents a first expected sample corresponding to a first branch selected by the first trellis sequence detector based on the first branch metric when detecting the first data sequence;α is a scalar;y2(k) represents one of the second signal samples;d2 represents a second expected sample corresponding to a second branch of the second trellis sequence detector; andBM2 represents the second branch metric.
  • 3. The data storage device as recited in claim 1, wherein the first trellis sequence detector is configured to generate the first branch metric when detecting the first data sequence based on one of the first signal samples and the second branch metric.
  • 4. The data storage device as recited in claim 3, wherein the first trellis sequence detector is configured to generate the first branch metric when detecting the first data sequence based on a second expected sample corresponding to a second branch selected by the second trellis sequence detector based on the second branch metric when detecting the second data sequence.
  • 5. The data storage device as recited in claim 3, wherein the control circuitry is further configured to iterate the generating the first branch metric and the second branch metric at least twice.
  • 6. The data storage device as recited in claim 1, wherein the head comprises a third read element and the control circuitry is further configured to: read a third data track using the third read element to generate a third read signal;sample the third read signal to generate third signal samples;generate a third branch metric in a third trellis sequence detector when detecting a third data sequence based on one of the third signal samples; andgenerate the second branch metric in the second trellis sequence detector when detecting the second data sequence based on one of the second signal samples, the first branch metric, and the third branch metric.
  • 7. The data storage device as recited in claim 6, wherein the second trellis sequence detector is configured to generate the second branch metric when detecting the second data sequence based on a third expected sample corresponding to a third branch selected by the third trellis sequence detector based on the third branch metric when detecting the third data sequence.
  • 8. A method of operating a data storage device, the method comprising: reading a first data track on a disk using a first read element of a head to generate a first read signal;sampling the first read signal to generate first signal samples;generating a first branch metric in a first trellis sequence detector when detecting a first data sequence based on one of the first signal samples;reading a second data track adjacent the first data track using a second read element of the head to generate a second read signal;sampling the second read signal to generate second signal samples; andwhen detecting a second data sequence, generating a second branch metric in a second trellis sequence detector based on one of the second signal samples and the first branch metric.
  • 9. The method as recited in claim 8, further comprising generating the second branch metric based on: BM2=∥y2(k)−d2−αd1∥2 where:d1 represents a first expected sample corresponding to a first branch selected by the first trellis sequence detector based on the first branch metric when detecting the first data sequence;α is a scalar;y2(k) represents one of the second signal samples;d2 represents a second expected sample corresponding to a second branch of the second trellis sequence detector; andBM2 represents the second branch metric.
  • 10. The method as recited in claim 8, further comprising the first trellis sequence detector generating the first branch metric when detecting the first data sequence based on one of the first signal samples and the second branch metric.
  • 11. The method as recited in claim 10, further comprising the first trellis sequence detector generating the first branch metric when detecting the first data sequence based on a second expected sample corresponding to a second branch selected by the second trellis sequence detector based on the second branch metric when detecting the second data sequence.
  • 12. The method as recited in claim 10, further comprising iterating the generating the first branch metric and the second branch metric at least twice.
  • 13. The method as recited in claim 8, further comprising: reading a third data track using a third read element of the head to generate a third read signal;sampling the third read signal to generate third signal samples;generating a third branch metric in a third trellis sequence detector when detecting a third data sequence based on one of the third signal samples; andgenerating the second branch metric in the second trellis sequence detector when detecting the second data sequence based on one of the second signal samples, the first branch metric, and the third branch metric.
  • 14. The method as recited in claim 13, further comprising the second trellis sequence detector generating the second branch metric when detecting the second data sequence based on a third expected sample corresponding to a third branch selected by the third trellis sequence detector based on the third branch metric when detecting the third data sequence.
US Referenced Citations (483)
Number Name Date Kind
5229901 Mallary Jul 1993 A
5661760 Patapoutian et al. Aug 1997 A
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
6104765 Fredrickson Aug 2000 A
6105104 Guttmann et al. Aug 2000 A
6111717 Cloke et al. Aug 2000 A
6145052 Howe et al. Nov 2000 A
6154335 Smith et al. Nov 2000 A
6157510 Schreck et al. Dec 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
6345074 Turk et al. Feb 2002 B1
6369969 Christiansen 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
6449110 DeGroat 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
6545836 Ioannou 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
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
6715044 Lofgren et al. Mar 2004 B2
6724982 Hamlin Apr 2004 B1
6725329 Ng et al. Apr 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
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
6826140 Brommer et al. Nov 2004 B2
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
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
7106549 Asakura Sep 2006 B2
7106947 Boyle et al. Sep 2006 B2
7110202 Vasquez Sep 2006 B1
7111116 Boyle et al. Sep 2006 B1
7111225 Coene et al. Sep 2006 B2
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
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
7259927 Harris Aug 2007 B2
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
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
7738202 Zheng et al. 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
7872823 Liu et al. Jan 2011 B2
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
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
8300339 Nangare et al. 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
8441750 Nangare et al. May 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
8578253 Yang et al. Nov 2013 B2
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
8599508 Burd Dec 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
8638513 Burd Jan 2014 B1
8659846 Kumar et al. Feb 2014 B2
8661193 Cobos et al. Feb 2014 B1
8665543 Bellorado et al. Mar 2014 B2
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 Abdul 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
8780472 Okubo et al. Jul 2014 B2
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
8804260 Mathew 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
8830613 Lund et al. Sep 2014 B2
20010030822 Boutaghou et al. Oct 2001 A1
20030026020 Buckingham Feb 2003 A1
20070085709 Coene et al. Apr 2007 A1
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
Non-Patent Literature Citations (7)
Entry
K. S. Chan , R. Radhakrishnan , K. Eason , R. M. Elidrissi1 , J. Miles , B. Vasic and A. R. Krishnan, “Channel models and detectors for two-dimensional magnetic recording (TDMR),” IEEE Trans. Magn., vol. 46, No. 3, Mar. 2010.
T. Losuwan, C. Warisarn, P. Supnithi, and P. Kovintavewat, “A Study of 2D detection for Two-Dimensional Magnetic Recording,” in Proc. of ITC-CSCC 2012, Jul. 15-18, 2012, Sapporo, Japan.
S. Nabavi, B. V. K. V. Kumar, “Two-Dimensional Generalized Partial Response Equalizer for Bit-Patterned Media,” IEEE Trans. Magn., vol. 44, No. 11, pp. 3789-3792, Nov. 2008.
Yunxiang Wu, Joseph A. O'Sullivan, Naveen Singla, and Ronald S. Indeck, “Iterative Detection and Decoding for Separable Two-Dimensional Intersymbol Interference,” IEEE Transactions on Magnetics, vol. 39, No. 4, Jul. 2003.
Alvin J. Wang, et al., U.S. Appl. No. 14/089,912, filed Nov. 26, 2013, 19 pages.
Alvin J. Wang, et al., U.S. Appl. No. 14/178,155, filed Feb. 11, 2014, 25 pages.
Yiming Chen, et al., U.S. Appl. No. 13/968,323, filed Aug. 15, 2013, 19 pages.