Disk drive correcting an error in a detected gray code

Information

  • Patent Grant
  • 9424871
  • Patent Number
    9,424,871
  • Date Filed
    Thursday, December 18, 2014
    9 years ago
  • Date Issued
    Tuesday, August 23, 2016
    8 years ago
Abstract
A disk drive is disclosed comprising a head actuated over a disk comprising a plurality of tracks defined by a plurality of servo sectors. An estimated track ID is generated and a plurality of proximate track IDs is generated having values proximate the estimated track ID. A set of Gray codes is generated each corresponding to the estimated track ID and the proximate track IDs, wherein each Gray code in the set of Gray codes comprises N bits, and M bits out of a high order of the N bits comprise the same value. A recorded Gray code is detected in a first servo sector to generate a detected Gray code, and an error in the detected Gray code is corrected by inverting at least one bit in the detected Gray code comprising a value that is different from the value of the corresponding bit in the M bits.
Description
BACKGROUND
Description of the Related Art

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 embedded servo sectors. The embedded servo sectors comprise head positioning information (e.g., a track ID) which is read by the head and processed by a servo controller to control the actuator arm as it seeks from track to track.



FIG. 1 shows a prior art format of a disk 2 comprising a plurality of concentric tracks 4 having embedded servo sectors 60-6N. Each servo sector (e.g., servo sector 64) comprises a preamble 8 for synchronizing gain control and timing recovery, a sync mark 10 for synchronizing to a data field 12 comprising the coarse head positioning information (such as a Gray coded track ID), and servo bursts 14 which provide fine head positioning information.


As the head passes over a servo sector, the head positioning information is processed to estimate the radial location of the head. The servo controller may comprise a state estimator which processes the detected head position to estimate various states of the head, such as its position, velocity, and acceleration. The estimated states may be compared to target values in a seek profile, wherein the error between the estimated states and target states is processed to generate a control signal applied to the VCM in order to move the head in a direction and velocity that reduces the error.


If the disk surface comprises defective servo sectors (which may be detected during a manufacturing procedure), the associated wedges of user data may be relocated to spare data sectors, or the entire data track may be relocated to a spare data track. However, relocating data wedges and/or data tracks is undesirable since it reduces the overall capacity of the disk and may also impact performance when seeking to the spare data wedges or spare data tracks. The state estimator in the servo controller will typically filter out miss-detected servo sectors during seek operations; however, if multiple sequential servo sectors are miss-detected during a seek, it may degrade performance by increasing the settle time. In addition, if the servo controller encounters a miss-detected servo sector while tracking the centerline of a data track during an access operation, the operation may be aborted and retried (particularly during write operations) which impacts performance due to the slipped revolutions.





BRIEF DESCRIPTION OF THE DRAWINGS


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



FIG. 2A shows a disk drive according to an embodiment of the present invention comprising a head actuated over a disk.



FIG. 2B is a flow diagram according to an embodiment of the present invention wherein a detected Gray code is corrected using a track ID estimator.



FIG. 2C shows an embodiment of the present invention wherein a servo sector comprises a high order Gray code and a low order track code decoded separately.



FIG. 3 shows an embodiment of the present invention wherein a track ID estimator is used to correct errors in the high order Gray code which is combined with the decoded low order track code.



FIG. 4A shows an embodiment of the present invention wherein the low order track code comprises Gray coded bits recorded at a lower density than the high order Gray code.



FIGS. 4B and 4C illustrate an embodiment of the present invention wherein the low order track code comprises redundancy bits such that at least one bit error is corrected when decoding the low order track code.



FIG. 5A shows an embodiment of the present invention for correcting errors in the high order Gray code using the track ID estimator.



FIGS. 5B-5D show examples of correcting errors in the detected high order Gray code using the track ID estimator according to an embodiment of the present invention.



FIG. 5E shows an embodiment of the present invention wherein M higher order bits of the high order Gray code are considered for correction.



FIG. 5F shows an embodiment of the present invention wherein a plurality of the lower order bits of the corrected high order Gray code are converted into a partial track ID which is combined with the estimated track ID to generate a detected track ID.



FIG. 6A illustrates an ambiguity that occurs when correcting the detected high order Gray code based on a radial location of the head derived from the servo bursts in a servo sector.



FIG. 6B illustrates how the ambiguity in FIG. 6A is resolved by overlapping at least the low order bit of the high order part of the track ID with the low order part of the track ID according to an embodiment of the present invention.



FIG. 6C shows an embodiment of the present invention wherein the overlapping bit in the high order part of the detected track ID is ignored when generating a final track ID.





DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION


FIG. 2A shows a disk drive according to an embodiment of the present invention comprising a head 16 actuated over a disk 18 comprising a plurality of tracks 20 defined by a plurality of servo sectors (220-22N). The disk drive further comprises control circuitry 24 operable to execute the flow diagram of FIG. 2B, wherein an estimated track ID is generated representing an estimated radial location of the head (block 26), and a plurality of proximate track IDs is generated having values proximate the estimated track ID (block 28). A set of Gray codes is generated each corresponding to the estimated track ID and the proximate track IDs (block 30), wherein each Gray code in the set of Gray codes comprises N bits, and M bits out of a high order of the N bits comprise the same value (FIG. 5E). A recorded Gray code is detected in a first servo sector to generate a detected Gray code (block 32), and an error in the detected Gray code is corrected by inverting at least one bit in the detected Gray code comprising a value that is different from the value of the corresponding bit in the M bits (block 34).


In one embodiment shown in FIG. 2C, a track ID is recorded in each servo sector by recording a high order Gray code and a low order track code. At least one bit error in the high order Gray code may be corrected based on the embodiment described above with reference to FIG. 2B, and at least one bit error in the low order track code may be corrected based on a technique disclosed below. In another embodiment, an ambiguity in the detected high order Gray code is resolved by overlapping at least the low order bit of the high order part of a track ID with a low order part of the track ID as described below with reference to FIG. 6B.


In the embodiment of FIG. 2A, the control circuitry 24 processes a read signal 40 emanating from the head 16 to demodulate the servo sectors 220-22N 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 16 radially over the disk in a direction that reduces the PES. The servo sectors 220-22N may comprise any suitable position information, such as a track address for coarse positioning and servo bursts for fine positioning.



FIG. 3 shows control circuitry according to an embodiment of the present invention including a read channel 48 that detects an estimated data sequence 50 from the read signal 40 generated as the head passes over a servo sector. The high order Gray code bits in the estimated data sequence 50 are corrected using a track ID estimator 52 to generate a corrected Gray code 54. A high order Gray code decoder 56 decodes the corrected Gray code 54 into a high order part of a detected track ID 58. A low order track code decoder 60 decodes the low order track code bits in the estimated data sequence 50 into a low order part of the detected track ID 62. The high order part of the detected track ID 58 is combined with the low order part of the detected track ID 62 to generate a final track ID 64 representing a detected radial location of the head. In one embodiment, during a seek operation a seek profile 68 is generated in response to a current track ID the head is over and a target track ID corresponding to an access command. The seek profile 68 comprises a reference state (e.g., position and/or velocity). A control signal generator 66 processes the reference state and the detected track ID 64 to generate the control signal 46 applied to the VCM 44. The track ID estimator 52 processes the VCM control signal 46 in order to generate the estimated track ID representing an expected radial location of the head based on known parameters of the VCM servo system.


In the embodiments of the present invention, the high order Gray code represents the most significant bits of the track ID in a servo sector, and the low order track code represents the least significant bits of the track ID. Accordingly, the high order Gray code bits change at a much slower frequency than the low order track code bits as the head moves radially over the disk during a seek operation. This attribute makes errors in the high order Gray code readily correctable using the track ID estimator while achieving a high density of the Gray coded bits, whereas errors in the low order track code are more likely miscorrected using the track ID estimator. Therefore, a more accurate technique is employed to correct the low order track code while accepting a reduction in format efficiency. In one embodiment, the low order track code represents only a few bits of a servo sector track ID and therefore there is a minimal reduction in overall format efficiency while achieving a more accurate track ID detection algorithm.



FIG. 4A illustrates an embodiment of the present invention wherein the high order Gray code comprises a plurality of bits recorded at a first linear density, and the low order track code comprises a plurality of Gray coded bits recorded at a second linear density lower than the first linear density. In the example shown in FIG. 4A, the Gray coded bits in the low order track code are recorded at half the linear density than the Gray coded bits in the high order Gray code. Reducing the linear density of the low order track code reduces errors in detecting the Gray coded bits (e.g., by reducing inter-symbol interference). In addition, there is a minimal reduction in format efficiency since only a few of the least significant bits (three in the example of FIG. 4A) are recorded at a lower density.


In an alternative embodiment, the low order track code comprises a plurality of redundancy bits such that at least one bit error is corrected when decoding the low order track code into the second part of the detected track ID. In one embodiment, the low order track code comprises codewords having sufficient distance to enable correction of one or more of the detected bits. FIG. 4B illustrates an example of this embodiment wherein the three least significant bits of a track ID are encoded into a Gray codeword, and then each bit of the Gray codeword is encoded such that a “0” bit encodes into “010” and a “1” bit encodes into “101”. When decoding the detected low order track code, any single bit error within every three bits is corrected as illustrated in FIG. 4C. The code rate in this example is 1/3, but the overall reduction in format efficiency is not significant since only a few of the least significant bits of the track ID are encoded into the low order track code (three bits in the example of FIG. 4B). The remaining most significant bits of the track ID are encoded into the high order Gray code having a code rate of 1/1, wherein errors are corrected by the track ID estimator.


In the examples of FIGS. 4A and 4B, the higher order Gray code bits and the low order track code bits are shown as written without any gap between the two. In an alternative embodiment (not shown), the high order Gray code bits may be written to the disk, followed by a gap, followed by the low order track code bits. The gap may optionally include synchronization information, such as a preamble and a sync mark for synchronizing to the low order track code bits.



FIG. 5A illustrates an example algorithm for implementing the track ID estimator, wherein after generating an estimated track ID 70 (represented in binary (BIN)), a plurality of proximate track IDs are generated having values proximate the estimated track ID (e.g., track_ID−1 72A and track_ID+1 72B). The estimated track ID and the proximate track IDs are encoded 74 into a set of Gray codes 76A, 76B, and 76C. At least one bit in the detected high order Gray code is then corrected in response to the set of Gray codes. For example, in one embodiment each Gray code in the set of Gray codes comprises N bits, and M bits out of the N bits comprise the same value 78. Errors in the high order Gray code are corrected by inverting at least one bit in the high order Gray code comprising a value that is different from the value of the corresponding bit in the M bits 80.


The algorithm described above with reference to FIG. 5A is illustrated in FIGS. 5B-5D. The first row of FIG. 5B illustrates an estimated track ID generated by the track ID estimator, and the next two rows show corresponding proximate track IDs. The fourth row shows a bit map of the common bits between the track IDs in the first three rows. The fifth row shows the estimated track ID with don't care bits representing the non-matching bits in the first three rows. The sixth row shows an example high order Gray code detected from the read signal, and the seventh row shows a bit in the detected high order Gray code that is different from the bits in row fifth row. The eighth row shows a bit map used to invert the different bit, and the ninth row shows the corresponding bit inverted in the detected high order Gray code (previously shown in the sixth row), thereby correcting the one bit error.



FIG. 5C illustrates a number of detected high order Gray codes having a single bit error, and the possible track IDs that are decoded before correcting the single bit error and after correcting the single bit error (last row). FIG. 5D illustrates a number of detected high order Gray codes having two bit errors, and the possible track IDs that are decoded before correcting the two bit errors and after correcting the two bit errors (last row). Although in the above examples the track ID estimator generates two proximate track IDs (track_ID+1 and track_ID−1), any suitable number of proximate track IDs may be generated, where increasing the number of proximate track IDs increases the number of don't care bits.



FIG. 5E illustrates an embodiment of the present invention wherein the track ID estimator generates significantly more than two proximate track IDs (16 proximate track IDs in the example shown). In order to reduced the correction time of the detected Gray code, the above described correction algorithm based on identifying the common bits in the estimated and proximate track IDs (block 78 of FIG. 5A) is modified so that only the M high order common bits are identified. In the example shown in FIG. 5E, the estimated track ID (522171) and 16 proximate track IDs are converted into their Gray code equivalent track ID each comprising N=19 bits. The M high order bits are common (M=12) and are used to correct the detected Gray code as described above, wherein the N−M lower order bits (N−M=7) are considered as don't care bits. The correction power of the above described algorithm is reduced since there are common low order bits (5th and 6th low order bits) that are not used (considered as don't care bits). However, the correction time of the algorithm is reduced since it takes less time to identify only the common M high order bits.


In one embodiment, the M high order common bits across the Gray code representation of the proximate track IDs is determined by comparing only the end cases. In the example shown in FIG. 5E, there are 16 proximate track IDs including eight (−1 to −8) preceding the estimated track ID and eight (+1 to +8) following the estimated track ID. The M high order common bits across all 16 proximate track IDs can be determined by comparing the Gray code representation of the −8 proximate track ID to the Gray code representation of the +8 proximate track ID. In general when the proximate track IDs extend from −L to +L, an embodiment of the present invention determines the M high order common bits across the extent by comparing the Gray coded representation of only the −L proximate track ID to the +L proximate track ID.


In one embodiment in order to reduce the time needed to decode the corrected Gray code, the high order bits of the corrected Gray code are not decoded into the binary equivalent. Instead, the high order bits of the estimated track ID 70 (FIG. 5A) are assumed to be correct so that only the low order bits of the corrected Gray code need to be decoded. Example control circuitry for decoding the low order bits of the corrected Gray code is shown in FIG. 5F, wherein in the example shown the corrected Gray code 1000000110001100110 corresponds to track ID 522171 (FIG. 5E) having a decoded binary value of 1111111011110111011. In this embodiment, it is assumed the higher order 12 bits of the estimated track ID are correct and therefore not decoded. The low order 7 bits of the corrected Gray code (1100110) are decoded by initializing a register 83 with the last bit of the high order 12 bits of the estimated track ID (i.e., the last bit of 111111101111). The output 85 of the register 83 is then XORed 87 with the low order 7 bits (1100110) of the corrected Gray code (in reverse order as shown in FIG. 5F) with the result of the XOR 87 being shifted into the register 83. After performing 7 XOR and shift operations, the resulting decoded binary value (0111011) representing the low order part of the detected track ID is combined with the high order bits (111111101111) of the estimated track ID to form the detected track ID (1111111011110111011). In the example shown in FIG. 5F, only the low order 7 bits of the corrected Gray code are decoded; however, any suitable number of low order bits may be decoded (i.e., more or less than 7 bits).



FIG. 6A illustrates an embodiment of the present invention wherein the track ID is recorded in each servo sector in two parts: a high order Gray code and a low order track code (FIG. 2C). The high order bits (17 bits) of the track ID are encoded into a first Gray code recorded to the servo sector. The low order bits (2 bits) of the track ID are encoded into a second Gray code recorded to the servo sector using any suitable technique, such as described above with reference to FIGS. 4A and 4B. In one embodiment, the position of the head as derived from reading the servo bursts of the servo sector may be used to correct the detected Gray code (both the high order and low order Gray code). The position of the head relative to the servo bursts is divided into zones (e.g., Z1-Z4) examples of which are shown in FIG. 6A. Consider an example where the head is over a track ID corresponding to zone Z2 as determined from reading the servo bursts (e.g., the head may be over track ID 522167 or 522171). Since the high order Gray code corresponding to the four consecutive track IDs 522167 to 522170 is the same, there is an ambiguity as to whether the head may be detected as over track ID 522167 as well as in zone Z2, or whether the head is detected as over track ID 522171 (with a one bit error) as well as in zone Z2. In the first case no correction is needed to the high order Gray code, whereas in the second case the high order Gray code should be incremented by one track ID in order to correct the one bit error.


In order to overcome the above-described ambiguity in the bit arrangement shown in FIG. 6A, in one embodiment at least the low order bit of the high order part of the detected track ID overlaps with the low order part of the detected track ID. This is illustrated in FIG. 6B wherein the track ID comprises 19 bits. When recording the track ID, the high order part of the track ID is selected as bits 19-2 and the low order part of the track ID is selected as bits 2-1 (so that bit 2 of the high order part overlaps with bit 2 of the low order part). As a result, the high order Gray code will be the same for every two tracks rather than for every four tracks as in FIG. 6A, which overcomes the above-described ambiguity in the bit arrangement shown in FIG. 6A. In the above described example, when the head is over zone Z2 as determined from reading the servo bursts there is no ambiguity between the Gray code for track ID 522167 and track ID 522170 due to the additional bit that overlaps with the low order Gray code. Therefore when the high order Gray code is detected as track ID 522170 or 522169, and the head is detected over zone Z2 as determined by the servo bursts, the high order Gray code is incremented to 522171 in order to correct for the one bit error (in one embodiment, the high order part of the track ID decoded from the detected high order Gray code is incremented instead of incrementing the detected high order Gray code).



FIG. 6C shows control circuitry according to an embodiment of the present invention for decoding the high order Gray code and the low order Gray code shown in the embodiment of FIG. 6B. The detected high order Gray code 82 is decoded using a Gray decoder 84 into a high order part of the track ID 86 which is shifted right by one bit at block 88 so that the low order bit of the high order part is ignored. The detected low order Gray code 92 is decoded using a Gray decoder 94 into a low order part of the track ID 96 which is combined with the shifted, high order part of the track ID 90 to generate a final track ID 98. In one embodiment, in the above-described correction algorithm based on the zone detected from the servo bursts, the correction (increment of decrement) is applied to the high part order part of the track ID 86 or 90 before or after the binary shift right 88.


Any suitable technique may be employed to write the track ID in the servo sectors of a disk drive. In one embodiment, an external servo writer or media writer may be employed to write the track ID in the servo sectors according to the embodiments of the present invention. Alternatively, the control circuitry within each production disk drive may write the track ID in the servo sectors during a self servo writing operation. In yet another embodiment, the track ID may be written in the servo sectors using a suitable stamping or patterning technique prior to inserting the disk into the disk drive.


Any suitable control circuitry may be employed to implement the flow diagrams in the embodiments of the present invention, 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.

Claims
  • 1. A disk drive comprising: a disk comprising a plurality of tracks defined by a plurality of servo sectors;a head actuated over the disk; andcontrol circuitry operable to: detect a high order Gray code in a first servo sector;decode the high order Gray code into a high order part of a detected track ID;detect a low order track code in the first servo sector;decode the low order track code into a low order part of the detected track ID, wherein the low order bit of the high order part of the detected track ID overlaps with the low order part of the detected track ID; andcorrect a single bit error in the detected high order Gray code based on the overlap,wherein: the detected track ID consists of N bits;the high order Gray code consists of N−1 bits;the low order track code consists of two bits; andthe high order Gray code is the same for every two consecutive tracks.
  • 2. The disk drive as recited in claim 1, wherein the control circuitry is further operable to combine the high order part and the low order part of the detected track ID to generate a final track ID.
  • 3. The disk drive as recited in claim 2, wherein the control circuitry is further operable to ignore the low order bit of the high order part of the detected track ID when combining the high order part and the low order part to generate the final track ID.
  • 4. The disk drive as recited in claim 1, wherein the control circuitry is further operable to: detect a position of the head over the disk; andcorrect the single bit error in the detected high order Gray code by performing one of an increment and a decrement on at least one of the detected high order Gray code and the high order part of the detected track ID, wherein the increment and the decrement are based on the detected position of the head.
  • 5. A method of operating a disk drive, the disk drive comprising a head actuated over a disk comprising a plurality of tracks defined by a plurality of servo sectors, the method comprising: detecting a high order Gray code in a first servo sector;decoding the high order Gray code into a high order part of a detected track ID;detecting a low order track code in the first servo sector;decoding the low order track code into a low order part of the detected track ID, wherein the low order bit of the high order part of the detected track ID overlaps with the low order part of the detected track ID; andcorrecting a single bit error in the detected high order Gray code based on the overlap,wherein: the detected track ID consists of N bits;the high order Gray code consists of N−1 bits;the low order track code consists of two bits; andthe high order Gray code is the same for every two consecutive tracks.
  • 6. The method as recited in claim 5, further comprising combining the high order part and the low order part to of the detected track ID generate a final track ID.
  • 7. The method as recited in claim 6, further comprising ignoring the low order bit of the high order part of the detected track ID when combining the high order part and the low order part to generate the final track ID.
  • 8. The method as recited in claim 5, further comprising detecting a position of the head over the disk, wherein: correcting the single bit error in the detected high order Gray code comprises performing one of an increment and a decrement on at least one of the detected high order Gray code and the high order part of the detected track ID; andthe increment and the decrement are based on the detected position of the head.
CROSS REFERENCE TO RELATED APPLICATION

This application is a divisional of U.S. patent application Ser. No. 13/614,894, filed on Sep. 13, 2012, which is hereby incorporated by reference in its entirety.

US Referenced Citations (369)
Number Name Date Kind
4949200 Weng Aug 1990 A
5091643 Okutani et al. Feb 1992 A
5459623 Blagaila et al. Oct 1995 A
5589998 Yu Dec 1996 A
5600499 Acosta et al. Feb 1997 A
5737142 Zook Apr 1998 A
5757567 Hetzler et al. May 1998 A
5784219 Genheimer Jul 1998 A
5852522 Lee Dec 1998 A
5909334 Barr et al. Jun 1999 A
5917439 Cowen Jun 1999 A
5982308 Bang Nov 1999 A
6005727 Behrens et al. Dec 1999 A
6014283 Codilian et al. Jan 2000 A
6038091 Reed et al. Mar 2000 A
6043946 Genheimer et al. Mar 2000 A
6052076 Patton, III et al. Apr 2000 A
6052250 Golowka et al. Apr 2000 A
6067206 Hull et al. May 2000 A
6075667 Kisaka et al. Jun 2000 A
6078453 Dziallo et al. Jun 2000 A
6091564 Codilian et al. Jul 2000 A
6094020 Goretzki et al. Jul 2000 A
6101065 Alfred et al. Aug 2000 A
6104153 Codilian et al. Aug 2000 A
6115198 Reed et al. Sep 2000 A
6118603 Wilson et al. Sep 2000 A
6122133 Nazarian et al. Sep 2000 A
6122135 Stich Sep 2000 A
6141175 Nazarian et al. Oct 2000 A
6160368 Plutowski Dec 2000 A
6181502 Hussein et al. Jan 2001 B1
6195222 Heminger et al. Feb 2001 B1
6198584 Codilian et al. Mar 2001 B1
6198590 Codilian et al. Mar 2001 B1
6201652 Rezzi et al. Mar 2001 B1
6204988 Codilian et al. Mar 2001 B1
6226138 Blaum et al. May 2001 B1
6233715 Kuki et al. May 2001 B1
6243223 Elliott et al. Jun 2001 B1
6281652 Ryan et al. Aug 2001 B1
6285521 Hussein Sep 2001 B1
6288861 Blaum et al. Sep 2001 B1
6292320 Mason et al. Sep 2001 B1
6304398 Gaub et al. Oct 2001 B1
6310742 Nazarian et al. Oct 2001 B1
6313963 Hsieh Nov 2001 B1
6320718 Bouwkamp et al. Nov 2001 B1
6342984 Hussein et al. Jan 2002 B1
6345021 Belser et al. Feb 2002 B1
6347018 Kadlec et al. Feb 2002 B1
6369972 Codilian et al. Apr 2002 B1
6369974 Asgari et al. Apr 2002 B1
6405342 Lee Jun 2002 B1
6434719 Livingston Aug 2002 B1
6462896 Codilian et al. Oct 2002 B1
6476996 Ryan Nov 2002 B1
6484577 Bennett Nov 2002 B1
6493169 Ferris et al. Dec 2002 B1
6496324 Golowka et al. Dec 2002 B1
6498698 Golowka et al. Dec 2002 B1
6507450 Elliott Jan 2003 B1
6534936 Messenger et al. Mar 2003 B2
6538839 Ryan Mar 2003 B1
6545835 Codilian et al. Apr 2003 B1
6549359 Bennett et al. Apr 2003 B1
6549361 Bennett et al. Apr 2003 B1
6560056 Ryan May 2003 B1
6568268 Bennett May 2003 B1
6574062 Bennett et al. Jun 2003 B1
6577465 Bennett et al. Jun 2003 B1
6604223 Belser et al. Aug 2003 B1
6614615 Ju et al. Sep 2003 B1
6614618 Sheh et al. Sep 2003 B1
6636377 Yu et al. Oct 2003 B1
6690536 Ryan Feb 2004 B1
6693764 Sheh et al. Feb 2004 B1
6707635 Codilian et al. Mar 2004 B1
6710953 Vallis et al. Mar 2004 B1
6710966 Codilian et al. Mar 2004 B1
6714371 Codilian Mar 2004 B1
6714372 Codilian et al. Mar 2004 B1
6724564 Codilian et al. Apr 2004 B1
6731450 Codilian et al. May 2004 B1
6735041 Codilian et al. May 2004 B1
6738205 Moran et al. May 2004 B1
6738220 Codilian May 2004 B1
6747837 Bennett Jun 2004 B1
6760186 Codilian et al. Jul 2004 B1
6788483 Ferris et al. Sep 2004 B1
6791785 Messenger et al. Sep 2004 B1
6795268 Ryan Sep 2004 B1
6819518 Melkote et al. Nov 2004 B1
6826006 Melkote et al. Nov 2004 B1
6826007 Patton, III Nov 2004 B1
6847502 Codilian Jan 2005 B1
6850383 Bennett Feb 2005 B1
6850384 Bennett Feb 2005 B1
6856480 Kuki et al. Feb 2005 B2
6867944 Ryan Mar 2005 B1
6876316 Wu Apr 2005 B1
6876508 Patton, III et al. Apr 2005 B1
6882496 Codilian et al. Apr 2005 B1
6885514 Codilian et al. Apr 2005 B1
6900958 Yi et al. May 2005 B1
6900959 Gardner et al. May 2005 B1
6903897 Wang et al. Jun 2005 B1
6914740 Tu et al. Jul 2005 B1
6914743 Narayana et al. Jul 2005 B1
6920004 Codilian et al. Jul 2005 B1
6924959 Melkote et al. Aug 2005 B1
6924960 Melkote et al. Aug 2005 B1
6924961 Melkote et al. Aug 2005 B1
6934114 Codilian et al. Aug 2005 B1
6934135 Ryan Aug 2005 B1
6937420 McNab et al. Aug 2005 B1
6937423 Ngo et al. Aug 2005 B1
6952322 Codilian et al. Oct 2005 B1
6954324 Tu et al. Oct 2005 B1
6958881 Codilian et al. Oct 2005 B1
6963465 Melkote et al. Nov 2005 B1
6965488 Bennett Nov 2005 B1
6967458 Bennett et al. Nov 2005 B1
6967811 Codilian et al. Nov 2005 B1
6970319 Bennett et al. Nov 2005 B1
6972539 Codilian et al. Dec 2005 B1
6972540 Wang et al. Dec 2005 B1
6972922 Subrahmanyam et al. Dec 2005 B1
6975480 Codilian et al. Dec 2005 B1
6977789 Cloke Dec 2005 B1
6980389 Kupferman Dec 2005 B1
6987636 Chue et al. Jan 2006 B1
6987639 Yu Jan 2006 B1
6989954 Lee et al. Jan 2006 B1
6992848 Agarwal et al. Jan 2006 B1
6992851 Cloke Jan 2006 B1
6992852 Ying et al. Jan 2006 B1
6995941 Miyamura et al. Feb 2006 B1
6999263 Melkote et al. Feb 2006 B1
6999267 Melkote et al. Feb 2006 B1
7006320 Bennett et al. Feb 2006 B1
7016134 Agarwal et al. Mar 2006 B1
7023637 Kupferman Apr 2006 B1
7023640 Codilian et al. Apr 2006 B1
7026965 Wu Apr 2006 B1
7027256 Subrahmanyam et al. Apr 2006 B1
7027257 Kupferman Apr 2006 B1
7035026 Codilian et al. Apr 2006 B2
7046472 Melkote et al. May 2006 B1
7047477 Tolhuizen et al. May 2006 B2
7050249 Chue et al. May 2006 B1
7050254 Yu et al. May 2006 B1
7050258 Codilian May 2006 B1
7054098 Yu et al. May 2006 B1
7061714 Yu Jun 2006 B1
7064918 Codilian et al. Jun 2006 B1
7068451 Wang et al. Jun 2006 B1
7068459 Cloke et al. Jun 2006 B1
7068461 Chue et al. Jun 2006 B1
7068463 Ji et al. Jun 2006 B1
7088547 Wang et al. Aug 2006 B1
7095579 Ryan et al. Aug 2006 B1
7099095 Subrahmanyam et al. Aug 2006 B1
7110208 Miyamura et al. Sep 2006 B1
7110214 Tu et al. Sep 2006 B1
7113362 Lee et al. Sep 2006 B1
7113365 Ryan et al. Sep 2006 B1
7116505 Kupferman Oct 2006 B1
7126775 Zook Oct 2006 B1
7126781 Bennett Oct 2006 B1
7158329 Ryan Jan 2007 B1
7180703 Subrahmanyam et al. Feb 2007 B1
7184230 Chue et al. Feb 2007 B1
7196864 Yi et al. Mar 2007 B1
7199966 Tu et al. Apr 2007 B1
7203021 Ryan et al. Apr 2007 B1
7206157 Ehrlich Apr 2007 B2
7209321 Bennett Apr 2007 B1
7212364 Lee May 2007 B1
7212374 Wang et al May 2007 B1
7215504 Bennett May 2007 B1
7224546 Orakcilar et al. May 2007 B1
7248426 Weerasooriya et al. Jul 2007 B1
7251098 Wang et al. Jul 2007 B1
7253582 Ding et al. Aug 2007 B1
7253989 Lau et al. Aug 2007 B1
7265933 Phan et al. Sep 2007 B1
7289288 Tu Oct 2007 B1
7298574 Melkote et al. Nov 2007 B1
7301717 Lee et al. Nov 2007 B1
7304819 Melkote et al. Dec 2007 B1
7307810 Kang Dec 2007 B1
7330019 Bennett Feb 2008 B1
7330327 Chue et al. Feb 2008 B1
7333280 Lifchits et al. Feb 2008 B1
7333290 Kupferman Feb 2008 B1
7339761 Tu et al. Mar 2008 B1
7365932 Bennett Apr 2008 B1
7369343 Yeo et al. May 2008 B1
7388728 Chen et al. Jun 2008 B1
7391583 Sheh et al. Jun 2008 B1
7391584 Sheh et al. Jun 2008 B1
7433143 Ying et al. Oct 2008 B1
7440210 Lee Oct 2008 B1
7440225 Chen et al. Oct 2008 B1
7450334 Wang et al. Nov 2008 B1
7450336 Wang et al. Nov 2008 B1
7453661 Jang et al. Nov 2008 B1
7457071 Sheh Nov 2008 B1
7466509 Chen et al. Dec 2008 B1
7468855 Weerasooriya et al. Dec 2008 B1
7477471 Nemshick et al. Jan 2009 B1
7480116 Bennett Jan 2009 B1
7489464 McNab et al. Feb 2009 B1
7492546 Miyamura Feb 2009 B1
7495857 Bennett Feb 2009 B1
7499236 Lee et al. Mar 2009 B1
7502192 Wang et al. Mar 2009 B1
7502195 Wu et al. Mar 2009 B1
7502197 Chue Mar 2009 B1
7505223 McCornack Mar 2009 B1
7542225 Ding et al. Jun 2009 B1
7548392 Desai et al. Jun 2009 B1
7551390 Wang et al. Jun 2009 B1
7558016 Le et al. Jul 2009 B1
7573670 Ryan et al. Aug 2009 B1
7576941 Chen et al. Aug 2009 B1
7580212 Li et al. Aug 2009 B1
7583470 Chen et al. Sep 2009 B1
7595954 Chen et al. Sep 2009 B1
7602575 Lifchits et al. Oct 2009 B1
7616399 Chen et al. Nov 2009 B1
7619844 Bennett Nov 2009 B1
7626782 Yu et al. Dec 2009 B1
7630162 Zhao et al. Dec 2009 B2
7639447 Yu et al. Dec 2009 B1
7656604 Liang et al. Feb 2010 B1
7656607 Bennett Feb 2010 B1
7660067 Ji et al. Feb 2010 B1
7663835 Yu et al. Feb 2010 B1
7675707 Liu et al. Mar 2010 B1
7679854 Narayana et al. Mar 2010 B1
7688534 McCornack Mar 2010 B1
7688538 Chen et al. Mar 2010 B1
7688539 Bryant et al. Mar 2010 B1
7697233 Bennett et al. Apr 2010 B1
7701661 Bennett Apr 2010 B1
7710676 Chue May 2010 B1
7715138 Kupferman May 2010 B1
7715140 Chu et al. May 2010 B2
7729079 Huber Jun 2010 B1
7733189 Bennett Jun 2010 B1
7746592 Liang et al. Jun 2010 B1
7746594 Guo et al. Jun 2010 B1
7746595 Guo et al. Jun 2010 B1
7760461 Bennett Jul 2010 B1
7800853 Guo et al. Sep 2010 B1
7800856 Bennett et al. Sep 2010 B1
7800857 Calaway et al. Sep 2010 B1
7839591 Weerasooriya et al. Nov 2010 B1
7839595 Chue et al. Nov 2010 B1
7839600 Babinski et al. Nov 2010 B1
7843662 Weerasooriya et al. Nov 2010 B1
7852588 Ferris et al. Dec 2010 B1
7852592 Liang et al. Dec 2010 B1
7864481 Kon et al. Jan 2011 B1
7864482 Babinski et al. Jan 2011 B1
7869155 Wong Jan 2011 B1
7876522 Calaway et al. Jan 2011 B1
7876523 Panyavoravaj et al. Jan 2011 B1
7916415 Chue Mar 2011 B1
7916416 Guo et al. Mar 2011 B1
7916420 McFadyen et al. Mar 2011 B1
7916422 Guo et al. Mar 2011 B1
7929238 Vasquez Apr 2011 B1
7961422 Chen et al. Jun 2011 B1
8000053 Anderson Aug 2011 B1
8031423 Tsai et al. Oct 2011 B1
8054022 Ryan et al. Nov 2011 B1
8059357 Knigge et al. Nov 2011 B1
8059360 Melkote et al. Nov 2011 B1
8072703 Calaway et al. Dec 2011 B1
8077428 Chen et al. Dec 2011 B1
8078901 Meyer et al. Dec 2011 B1
8081395 Ferris Dec 2011 B1
8085020 Bennett Dec 2011 B1
8116023 Kupferman Feb 2012 B1
8145934 Ferris et al. Mar 2012 B1
8179626 Ryan et al. May 2012 B1
8189286 Chen et al. May 2012 B1
8213106 Guo et al. Jul 2012 B1
8223449 Dunn Jul 2012 B2
8254222 Tang Aug 2012 B1
8300348 Liu et al. Oct 2012 B1
8315005 Zou et al. Nov 2012 B1
8320069 Knigge et al. Nov 2012 B1
8351174 Gardner et al. Jan 2013 B1
8358114 Ferris et al. Jan 2013 B1
8358145 Ferris et al. Jan 2013 B1
8390367 Bennett Mar 2013 B1
8432031 Agness et al. Apr 2013 B1
8432629 Rigney et al. Apr 2013 B1
8451697 Rigney et al. May 2013 B1
8482873 Chue et al. Jul 2013 B1
8498076 Sheh et al. Jul 2013 B1
8498172 Patton, III et al. Jul 2013 B1
8508881 Babinski et al. Aug 2013 B1
8531798 Xi et al. Sep 2013 B1
8537486 Liang et al. Sep 2013 B2
8542455 Huang et al. Sep 2013 B2
8553351 Narayana et al. Oct 2013 B1
8564899 Lou et al. Oct 2013 B2
8576506 Wang et al. Nov 2013 B1
8605382 Mallary et al. Dec 2013 B1
8605384 Liu et al. Dec 2013 B1
8610391 Yang et al. Dec 2013 B1
8611040 Xi et al. Dec 2013 B1
8619385 Guo et al. Dec 2013 B1
8630054 Bennett et al. Jan 2014 B2
8630059 Chen et al. Jan 2014 B1
8634154 Rigney et al. Jan 2014 B1
8634283 Rigney et al. Jan 2014 B1
8643976 Wang et al. Feb 2014 B1
8649121 Smith et al. Feb 2014 B1
8654466 Mcfadyen Feb 2014 B1
8654467 Wong et al. Feb 2014 B1
8665546 Zhao et al. Mar 2014 B1
8665551 Rigney et al. Mar 2014 B1
8670206 Liang et al. Mar 2014 B1
8687312 Liang Apr 2014 B1
8693123 Guo et al. Apr 2014 B1
8693134 Xi et al. Apr 2014 B1
8699173 Kang et al. Apr 2014 B1
8711027 Bennett Apr 2014 B1
8717696 Ryan et al. May 2014 B1
8717699 Ferris May 2014 B1
8717704 Yu et al. May 2014 B1
8724245 Smith et al. May 2014 B1
8724253 Liang et al. May 2014 B1
8724524 Urabe et al. May 2014 B2
8737008 Watanabe et al. May 2014 B1
8737013 Zhou et al. May 2014 B2
8743495 Chen et al. Jun 2014 B1
8743503 Tang et al. Jun 2014 B1
8743504 Bryant et al. Jun 2014 B1
8749904 Liang et al. Jun 2014 B1
8760796 Lou et al. Jun 2014 B1
8767332 Chahwan et al. Jul 2014 B1
8767343 Helmick et al. Jul 2014 B1
8767354 Ferris et al. Jul 2014 B1
8773787 Beker Jul 2014 B1
8779574 Agness et al. Jul 2014 B1
8780473 Zhao et al. Jul 2014 B1
8780477 Guo et al. Jul 2014 B1
8780479 Helmick et al. Jul 2014 B1
8780489 Gayaka et al. Jul 2014 B1
8792202 Wan et al. Jul 2014 B1
8797664 Guo et al. Aug 2014 B1
8804267 Huang et al. Aug 2014 B2
8824081 Guo et al. Sep 2014 B1
8824262 Liu et al. Sep 2014 B1
8917469 Guo et al. Dec 2014 B1
20030039047 Ottesen et al. Feb 2003 A1
20090168227 Blaum et al. Jul 2009 A1
20100035085 Jung et al. Feb 2010 A1
20120284493 Lou et al. Nov 2012 A1
20130120870 Zhou et al. May 2013 A1
20130148240 Ferris et al. Jun 2013 A1
20130250448 Ozturk et al. Sep 2013 A1
Foreign Referenced Citations (1)
Number Date Country
11232809 Aug 1999 JP
Non-Patent Literature Citations (5)
Entry
Hagenauer et al., “A Viterbi Algorithm with Soft-Decision Outputs and its Applications,” in Proc. IEEE Global Telecommunications Conference 1989, Dallas, Texas, Nov. 1989, pp. 1680-1686.
Vasic et al., “Coding and Signal Processing for Magnetic Recording Systems”, 2005, Chapter 29, CRC Press, Boca Raton, Florida, United States.
Notice of Allowance dated Aug. 19, 2014 from U.S. Appl. No. 13/614,894, 7 pages.
Office Action dated May 30, 2014 from U.S. Appl. No. 13/614,894, 5 pages.
Office Action dated Dec. 30, 2013 from U.S. Appl. No. 13/614,894, 5 pages.
Divisions (1)
Number Date Country
Parent 13614894 Sep 2012 US
Child 14576063 US