Disk drive correcting an error in a detected gray code

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.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
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.

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; and
control 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; and correct 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; and the 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; and
correct 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; and
correcting 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; and the 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; and
the increment and the decrement are based on the detected position of the head.
Referenced Cited
U.S. Patent Documents
4949200 August 14, 1990 Weng
5091643 February 25, 1992 Okutani et al.
5459623 October 17, 1995 Blagaila et al.
5589998 December 31, 1996 Yu
5600499 February 4, 1997 Acosta et al.
5737142 April 7, 1998 Zook
5757567 May 26, 1998 Hetzler et al.
5784219 July 21, 1998 Genheimer
5852522 December 22, 1998 Lee
5909334 June 1, 1999 Barr et al.
5917439 June 29, 1999 Cowen
5982308 November 9, 1999 Bang
6005727 December 21, 1999 Behrens et al.
6014283 January 11, 2000 Codilian et al.
6038091 March 14, 2000 Reed et al.
6043946 March 28, 2000 Genheimer et al.
6052076 April 18, 2000 Patton, III et al.
6052250 April 18, 2000 Golowka et al.
6067206 May 23, 2000 Hull et al.
6075667 June 13, 2000 Kisaka et al.
6078453 June 20, 2000 Dziallo et al.
6091564 July 18, 2000 Codilian et al.
6094020 July 25, 2000 Goretzki et al.
6101065 August 8, 2000 Alfred et al.
6104153 August 15, 2000 Codilian et al.
6115198 September 5, 2000 Reed et al.
6118603 September 12, 2000 Wilson et al.
6122133 September 19, 2000 Nazarian et al.
6122135 September 19, 2000 Stich
6141175 October 31, 2000 Nazarian et al.
6160368 December 12, 2000 Plutowski
6181502 January 30, 2001 Hussein et al.
6195222 February 27, 2001 Heminger et al.
6198584 March 6, 2001 Codilian et al.
6198590 March 6, 2001 Codilian et al.
6201652 March 13, 2001 Rezzi et al.
6204988 March 20, 2001 Codilian et al.
6226138 May 1, 2001 Blaum et al.
6233715 May 15, 2001 Kuki et al.
6243223 June 5, 2001 Elliott et al.
6281652 August 28, 2001 Ryan et al.
6285521 September 4, 2001 Hussein
6288861 September 11, 2001 Blaum et al.
6292320 September 18, 2001 Mason et al.
6304398 October 16, 2001 Gaub et al.
6310742 October 30, 2001 Nazarian et al.
6313963 November 6, 2001 Hsieh
6320718 November 20, 2001 Bouwkamp et al.
6342984 January 29, 2002 Hussein et al.
6345021 February 5, 2002 Belser et al.
6347018 February 12, 2002 Kadlec et al.
6369972 April 9, 2002 Codilian et al.
6369974 April 9, 2002 Asgari et al.
6405342 June 11, 2002 Lee
6434719 August 13, 2002 Livingston
6462896 October 8, 2002 Codilian et al.
6476996 November 5, 2002 Ryan
6484577 November 26, 2002 Bennett
6493169 December 10, 2002 Ferris et al.
6496324 December 17, 2002 Golowka et al.
6498698 December 24, 2002 Golowka et al.
6507450 January 14, 2003 Elliott
6534936 March 18, 2003 Messenger et al.
6538839 March 25, 2003 Ryan
6545835 April 8, 2003 Codilian et al.
6549359 April 15, 2003 Bennett et al.
6549361 April 15, 2003 Bennett et al.
6560056 May 6, 2003 Ryan
6568268 May 27, 2003 Bennett
6574062 June 3, 2003 Bennett et al.
6577465 June 10, 2003 Bennett et al.
6604223 August 5, 2003 Belser et al.
6614615 September 2, 2003 Ju et al.
6614618 September 2, 2003 Sheh et al.
6636377 October 21, 2003 Yu et al.
6690536 February 10, 2004 Ryan
6693764 February 17, 2004 Sheh et al.
6707635 March 16, 2004 Codilian et al.
6710953 March 23, 2004 Vallis et al.
6710966 March 23, 2004 Codilian et al.
6714371 March 30, 2004 Codilian
6714372 March 30, 2004 Codilian et al.
6724564 April 20, 2004 Codilian et al.
6731450 May 4, 2004 Codilian et al.
6735041 May 11, 2004 Codilian et al.
6738205 May 18, 2004 Moran et al.
6738220 May 18, 2004 Codilian
6747837 June 8, 2004 Bennett
6760186 July 6, 2004 Codilian et al.
6788483 September 7, 2004 Ferris et al.
6791785 September 14, 2004 Messenger et al.
6795268 September 21, 2004 Ryan
6819518 November 16, 2004 Melkote et al.
6826006 November 30, 2004 Melkote et al.
6826007 November 30, 2004 Patton, III
6847502 January 25, 2005 Codilian
6850383 February 1, 2005 Bennett
6850384 February 1, 2005 Bennett
6856480 February 15, 2005 Kuki et al.
6867944 March 15, 2005 Ryan
6876316 April 5, 2005 Wu
6876508 April 5, 2005 Patton, III et al.
6882496 April 19, 2005 Codilian et al.
6885514 April 26, 2005 Codilian et al.
6900958 May 31, 2005 Yi et al.
6900959 May 31, 2005 Gardner et al.
6903897 June 7, 2005 Wang et al.
6914740 July 5, 2005 Tu et al.
6914743 July 5, 2005 Narayana et al.
6920004 July 19, 2005 Codilian et al.
6924959 August 2, 2005 Melkote et al.
6924960 August 2, 2005 Melkote et al.
6924961 August 2, 2005 Melkote et al.
6934114 August 23, 2005 Codilian et al.
6934135 August 23, 2005 Ryan
6937420 August 30, 2005 McNab et al.
6937423 August 30, 2005 Ngo et al.
6952322 October 4, 2005 Codilian et al.
6954324 October 11, 2005 Tu et al.
6958881 October 25, 2005 Codilian et al.
6963465 November 8, 2005 Melkote et al.
6965488 November 15, 2005 Bennett
6967458 November 22, 2005 Bennett et al.
6967811 November 22, 2005 Codilian et al.
6970319 November 29, 2005 Bennett et al.
6972539 December 6, 2005 Codilian et al.
6972540 December 6, 2005 Wang et al.
6972922 December 6, 2005 Subrahmanyam et al.
6975480 December 13, 2005 Codilian et al.
6977789 December 20, 2005 Cloke
6980389 December 27, 2005 Kupferman
6987636 January 17, 2006 Chue et al.
6987639 January 17, 2006 Yu
6989954 January 24, 2006 Lee et al.
6992848 January 31, 2006 Agarwal et al.
6992851 January 31, 2006 Cloke
6992852 January 31, 2006 Ying et al.
6995941 February 7, 2006 Miyamura et al.
6999263 February 14, 2006 Melkote et al.
6999267 February 14, 2006 Melkote et al.
7006320 February 28, 2006 Bennett et al.
7016134 March 21, 2006 Agarwal et al.
7023637 April 4, 2006 Kupferman
7023640 April 4, 2006 Codilian et al.
7026965 April 11, 2006 Wu
7027256 April 11, 2006 Subrahmanyam et al.
7027257 April 11, 2006 Kupferman
7035026 April 25, 2006 Codilian et al.
7046472 May 16, 2006 Melkote et al.
7047477 May 16, 2006 Tolhuizen et al.
7050249 May 23, 2006 Chue et al.
7050254 May 23, 2006 Yu et al.
7050258 May 23, 2006 Codilian
7054098 May 30, 2006 Yu et al.
7061714 June 13, 2006 Yu
7064918 June 20, 2006 Codilian et al.
7068451 June 27, 2006 Wang et al.
7068459 June 27, 2006 Cloke et al.
7068461 June 27, 2006 Chue et al.
7068463 June 27, 2006 Ji et al.
7088547 August 8, 2006 Wang et al.
7095579 August 22, 2006 Ryan et al.
7099095 August 29, 2006 Subrahmanyam et al.
7110208 September 19, 2006 Miyamura et al.
7110214 September 19, 2006 Tu et al.
7113362 September 26, 2006 Lee et al.
7113365 September 26, 2006 Ryan et al.
7116505 October 3, 2006 Kupferman
7126775 October 24, 2006 Zook
7126781 October 24, 2006 Bennett
7158329 January 2, 2007 Ryan
7180703 February 20, 2007 Subrahmanyam et al.
7184230 February 27, 2007 Chue et al.
7196864 March 27, 2007 Yi et al.
7199966 April 3, 2007 Tu et al.
7203021 April 10, 2007 Ryan et al.
7206157 April 17, 2007 Ehrlich
7209321 April 24, 2007 Bennett
7212364 May 1, 2007 Lee
7212374 May 1, 2007 Wang et al
7215504 May 8, 2007 Bennett
7224546 May 29, 2007 Orakcilar et al.
7248426 July 24, 2007 Weerasooriya et al.
7251098 July 31, 2007 Wang et al.
7253582 August 7, 2007 Ding et al.
7253989 August 7, 2007 Lau et al.
7265933 September 4, 2007 Phan et al.
7289288 October 30, 2007 Tu
7298574 November 20, 2007 Melkote et al.
7301717 November 27, 2007 Lee et al.
7304819 December 4, 2007 Melkote et al.
7307810 December 11, 2007 Kang
7330019 February 12, 2008 Bennett
7330327 February 12, 2008 Chue et al.
7333280 February 19, 2008 Lifchits et al.
7333290 February 19, 2008 Kupferman
7339761 March 4, 2008 Tu et al.
7365932 April 29, 2008 Bennett
7369343 May 6, 2008 Yeo et al.
7388728 June 17, 2008 Chen et al.
7391583 June 24, 2008 Sheh et al.
7391584 June 24, 2008 Sheh et al.
7433143 October 7, 2008 Ying et al.
7440210 October 21, 2008 Lee
7440225 October 21, 2008 Chen et al.
7450334 November 11, 2008 Wang et al.
7450336 November 11, 2008 Wang et al.
7453661 November 18, 2008 Jang et al.
7457071 November 25, 2008 Sheh
7466509 December 16, 2008 Chen et al.
7468855 December 23, 2008 Weerasooriya et al.
7477471 January 13, 2009 Nemshick et al.
7480116 January 20, 2009 Bennett
7489464 February 10, 2009 McNab et al.
7492546 February 17, 2009 Miyamura
7495857 February 24, 2009 Bennett
7499236 March 3, 2009 Lee et al.
7502192 March 10, 2009 Wang et al.
7502195 March 10, 2009 Wu et al.
7502197 March 10, 2009 Chue
7505223 March 17, 2009 McCornack
7542225 June 2, 2009 Ding et al.
7548392 June 16, 2009 Desai et al.
7551390 June 23, 2009 Wang et al.
7558016 July 7, 2009 Le et al.
7573670 August 11, 2009 Ryan et al.
7576941 August 18, 2009 Chen et al.
7580212 August 25, 2009 Li et al.
7583470 September 1, 2009 Chen et al.
7595954 September 29, 2009 Chen et al.
7602575 October 13, 2009 Lifchits et al.
7616399 November 10, 2009 Chen et al.
7619844 November 17, 2009 Bennett
7626782 December 1, 2009 Yu et al.
7630162 December 8, 2009 Zhao et al.
7639447 December 29, 2009 Yu et al.
7656604 February 2, 2010 Liang et al.
7656607 February 2, 2010 Bennett
7660067 February 9, 2010 Ji et al.
7663835 February 16, 2010 Yu et al.
7675707 March 9, 2010 Liu et al.
7679854 March 16, 2010 Narayana et al.
7688534 March 30, 2010 McCornack
7688538 March 30, 2010 Chen et al.
7688539 March 30, 2010 Bryant et al.
7697233 April 13, 2010 Bennett et al.
7701661 April 20, 2010 Bennett
7710676 May 4, 2010 Chue
7715138 May 11, 2010 Kupferman
7715140 May 11, 2010 Chu et al.
7729079 June 1, 2010 Huber
7733189 June 8, 2010 Bennett
7746592 June 29, 2010 Liang et al.
7746594 June 29, 2010 Guo et al.
7746595 June 29, 2010 Guo et al.
7760461 July 20, 2010 Bennett
7800853 September 21, 2010 Guo et al.
7800856 September 21, 2010 Bennett et al.
7800857 September 21, 2010 Calaway et al.
7839591 November 23, 2010 Weerasooriya et al.
7839595 November 23, 2010 Chue et al.
7839600 November 23, 2010 Babinski et al.
7843662 November 30, 2010 Weerasooriya et al.
7852588 December 14, 2010 Ferris et al.
7852592 December 14, 2010 Liang et al.
7864481 January 4, 2011 Kon et al.
7864482 January 4, 2011 Babinski et al.
7869155 January 11, 2011 Wong
7876522 January 25, 2011 Calaway et al.
7876523 January 25, 2011 Panyavoravaj et al.
7916415 March 29, 2011 Chue
7916416 March 29, 2011 Guo et al.
7916420 March 29, 2011 McFadyen et al.
7916422 March 29, 2011 Guo et al.
7929238 April 19, 2011 Vasquez
7961422 June 14, 2011 Chen et al.
8000053 August 16, 2011 Anderson
8031423 October 4, 2011 Tsai et al.
8054022 November 8, 2011 Ryan et al.
8059357 November 15, 2011 Knigge et al.
8059360 November 15, 2011 Melkote et al.
8072703 December 6, 2011 Calaway et al.
8077428 December 13, 2011 Chen et al.
8078901 December 13, 2011 Meyer et al.
8081395 December 20, 2011 Ferris
8085020 December 27, 2011 Bennett
8116023 February 14, 2012 Kupferman
8145934 March 27, 2012 Ferris et al.
8179626 May 15, 2012 Ryan et al.
8189286 May 29, 2012 Chen et al.
8213106 July 3, 2012 Guo et al.
8223449 July 17, 2012 Dunn
8254222 August 28, 2012 Tang
8300348 October 30, 2012 Liu et al.
8315005 November 20, 2012 Zou et al.
8320069 November 27, 2012 Knigge et al.
8351174 January 8, 2013 Gardner et al.
8358114 January 22, 2013 Ferris et al.
8358145 January 22, 2013 Ferris et al.
8390367 March 5, 2013 Bennett
8432031 April 30, 2013 Agness et al.
8432629 April 30, 2013 Rigney et al.
8451697 May 28, 2013 Rigney et al.
8482873 July 9, 2013 Chue et al.
8498076 July 30, 2013 Sheh et al.
8498172 July 30, 2013 Patton, III et al.
8508881 August 13, 2013 Babinski et al.
8531798 September 10, 2013 Xi et al.
8537486 September 17, 2013 Liang et al.
8542455 September 24, 2013 Huang et al.
8553351 October 8, 2013 Narayana et al.
8564899 October 22, 2013 Lou et al.
8576506 November 5, 2013 Wang et al.
8605382 December 10, 2013 Mallary et al.
8605384 December 10, 2013 Liu et al.
8610391 December 17, 2013 Yang et al.
8611040 December 17, 2013 Xi et al.
8619385 December 31, 2013 Guo et al.
8630054 January 14, 2014 Bennett et al.
8630059 January 14, 2014 Chen et al.
8634154 January 21, 2014 Rigney et al.
8634283 January 21, 2014 Rigney et al.
8643976 February 4, 2014 Wang et al.
8649121 February 11, 2014 Smith et al.
8654466 February 18, 2014 Mcfadyen
8654467 February 18, 2014 Wong et al.
8665546 March 4, 2014 Zhao et al.
8665551 March 4, 2014 Rigney et al.
8670206 March 11, 2014 Liang et al.
8687312 April 1, 2014 Liang
8693123 April 8, 2014 Guo et al.
8693134 April 8, 2014 Xi et al.
8699173 April 15, 2014 Kang et al.
8711027 April 29, 2014 Bennett
8717696 May 6, 2014 Ryan et al.
8717699 May 6, 2014 Ferris
8717704 May 6, 2014 Yu et al.
8724245 May 13, 2014 Smith et al.
8724253 May 13, 2014 Liang et al.
8724524 May 13, 2014 Urabe et al.
8737008 May 27, 2014 Watanabe et al.
8737013 May 27, 2014 Zhou et al.
8743495 June 3, 2014 Chen et al.
8743503 June 3, 2014 Tang et al.
8743504 June 3, 2014 Bryant et al.
8749904 June 10, 2014 Liang et al.
8760796 June 24, 2014 Lou et al.
8767332 July 1, 2014 Chahwan et al.
8767343 July 1, 2014 Helmick et al.
8767354 July 1, 2014 Ferris et al.
8773787 July 8, 2014 Beker
8779574 July 15, 2014 Agness et al.
8780473 July 15, 2014 Zhao et al.
8780477 July 15, 2014 Guo et al.
8780479 July 15, 2014 Helmick et al.
8780489 July 15, 2014 Gayaka et al.
8792202 July 29, 2014 Wan et al.
8797664 August 5, 2014 Guo et al.
8804267 August 12, 2014 Huang et al.
8824081 September 2, 2014 Guo et al.
8824262 September 2, 2014 Liu et al.
8917469 December 23, 2014 Guo et al.
20030039047 February 27, 2003 Ottesen et al.
20090168227 July 2, 2009 Blaum et al.
20100035085 February 11, 2010 Jung et al.
20120284493 November 8, 2012 Lou et al.
20130120870 May 16, 2013 Zhou et al.
20130148240 June 13, 2013 Ferris et al.
20130250448 September 26, 2013 Ozturk et al.
Foreign Patent Documents
11232809 August 1999 JP
Other references
  • 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.
Patent History
Patent number: 9424871
Type: Grant
Filed: Dec 18, 2014
Date of Patent: Aug 23, 2016
Assignee: Western Digital Technologies, Inc. (Irvine, CA)
Inventors: Guoxiao Guo (Irvine, CA), Donald Brunnett (Pleasanton, CA), Jianguo Zhou (Foothill Ranch, CA), Wai Ee Wong (Singapore)
Primary Examiner: Daniell L Negron
Application Number: 14/576,063
Classifications
Current U.S. Class: Responsive To Recorded Address (360/72.2)
International Classification: G11B 5/596 (20060101); G11B 20/10 (20060101);