In many systems, data is transmitted or retrieved asynchronously, i.e., without any additional timing reference. However, the receiver or detector in the system must eventually process the data synchronously. To do this, the receiver or detector must recover the timing information (e.g., the “clock”) from the data at the receive end.
Timing recovery is becoming a major challenge in data storage channels, such as in disk drive storage systems. As storage capacities and data rates increase, design tradeoffs may require that the storage channels operate in a noisier environment with higher raw error rates. However, more noise and more raw detection errors may make reliable timing recovery more difficult.
A storage channel, e.g., for a disk drive system, may asynchronously sample and buffer an entire sector and then process the buffered sector to recover timing information. The system may then re-sample the buffered sector using the recovered timing information.
The storage channel may include a read head to read an analog waveform including a number of sectors from a storage medium. A sampler may sample the waveform at the Nyquist rate.
The storage channel may operate in an open-loop and utilize an exhaustive search to determine timing parameters. A timing recovery module may determine coefficients in a polynomial modeling frequency characteristics of the signal. A decoder may decode the buffered sector using a plurality of sets of timing parameters obtained from the exhaustive search and to determine an optimal set of timing parameters. A re-sampling module may then re-sample the buffered sector using the optimal set of timing parameters. The re-sampling module may interpolate data points in the buffered sector in response to the timing information.
In an embodiment, a timing recovery module may process the buffered sector bi-directionally. The timing recovery module may determine a first phase offset using information in a pre-amble of the sector, determine a second phase offset using information in a post-amble of the sector, and then determine a frequency offset from the first phase offset and the second phase offset.
The storage channel may operate in a closed-loop, processing the sector once, and feeding back information obtained during decoding to a timing loop. The timing recovery module may launch the timing loop in a tracking mode using the determined frequency offset. The decoder may decode the re-sampled data points in the buffered sector, and provide timing information obtained from said decoding to the timing loop.
The data on the disk may be organized in sectors.
In an embodiment, the storage channel may buffer an entire sector in a buffer 106 (block 304). The buffered sector may be processed for timing information by a timing recovery module 108. A re-sampling module 110 may use the recovered clock to re-sample the buffered sector, which may then be processed by a Viterbi detector 112 to estimate the actual signal.
Timing recovery basically deals with two variables: frequency (f) and phase (φ). Once the initial phase offset and frequency offset values are decided, there is a deterministic relationship between the phase and frequency at any time, which is that the phase is the time-integration of the frequency, i.e.,
The initial phase offset can be any value between 0 and 1.0 T, where T is the length of one clock cycle. The initial frequency offset is usually very small, with typical values being smaller than+/−0.5%. Also, the frequency drift over the duration of one sector is either a very small value or virtually zero. Therefore, it can be assumed that with regard to the sampling frequency, the data frequency is either constant or a function of time that can be characterized by a low-order (e.g., third order or lower) polynomial.
Since there are only a few parameters to estimate regarding the timing recovery, an exhaustive search may be performed to find the optimal values of these parameters (block 306). The initial phase offset may be estimated using phase acquisition information provided in the preamble of the sector. For example, a Zero Phase Start (ZPS) technique may be utilized. ZPS information may be provided in the preamble at the beginning of a sector. ZPS is a technique that provides a way to quickly determine the sampling phase. A known portion of the signal, e.g., a sinusoidal waveform, may be sampled at four samples per cycle. With zero phase offset, the samples would be taken at the peak and zero crossing points on the waveform. The sampling phase may be determined by calculating the offset between the samples and the peak and zero crossing points.
The ZPS should provide an accurate estimate of the phase offset at the beginning of the sector. Even if exhaustive search is needed to estimate the initial phase offset, the search may be limited to a narrow range around the estimate produced by the ZPS operation and will not be dominant in deciding the complexity of computation. As described above, the frequency characteristics of the sector may be modeled by a low order polynomial (e.g., f(t)=f0+f1x+f2x2+f3x3). For the exhaustive search of the frequency parameters f0, f1, f2, f3, the zero-order term, f0, (i.e., the initial frequency offset) and the first-order term, f1, (i.e., the drifting rate of the frequency during a sector) will be the most important two terms to decide. Their range of search and accuracy will be the deciding factors for the computational complexity of the exhaustive search. The second- and third-order terms (f2 and f3) are likely to be insignificant. The limits, and step size(s), of the exhaustive searches may be predetermined, e.g., set by the disk drive manufacturer based on known tolerances.
A Maximum-likelihood (ML) criterion may be used to determine the optimal parameters. A re-sampled sequence may be generated using the timing decided by each combination of the phase and frequency parameters and loss-free interpolation (block 308). Viterbi detection may then be performed on the re-sampled sequence, and the likelihood of the detected sequence calculated (block 310). The likelihood may be indicated by a metric such as the mean square error (MSE), Euclidian distance, and/or their modified versions with non-linear pattern-dependent effects taken into account. The metric may be stored for each set of parameters (block 312). The optimal set of parameters is the one that gives the maximum likelihood (block 314). The parameters corresponding to the maximum likelihood decision may be provided to the re-sampling module 110 and the buffered sector re-sampled using the optimal set of parameters (block 316).
In the embodiment described above, timing recovery is operating in an open-loop (i.e., without a traditional timing loop). However, the exhaustive search techniques may require a significant amount of computational complexity, which translates into computation time and cost.
In an embodiment, timing recovery may be performed by processing the buffered sector only once (in a bi-directional process) in order to save computational resources.
The format 600 of the sector may be modified, as shown in
In alternative embodiments, combinations of the open-looped exhaustive search and the close-looped processing may be used. For example, the bi-directional sector format 600 shown in
A number of embodiments have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example, blocks in the flowcharts may be skipped or performed out of order and still produce desirable results. Accordingly, other embodiments are within the scope of the following claims.
This application claims priority to U.S. Provisional Application Ser. No. 60/505,602, filed on Sep. 23, 2003.
Number | Name | Date | Kind |
---|---|---|---|
5258933 | Johnson et al. | Nov 1993 | A |
5424881 | Behrens et al. | Jun 1995 | A |
5481568 | Yada | Jan 1996 | A |
5513209 | Holm | Apr 1996 | A |
5552942 | Ziperovich et al. | Sep 1996 | A |
5892632 | Behrens et al. | Apr 1999 | A |
6009549 | Bliss et al. | Dec 1999 | A |
6084924 | Melas | Jul 2000 | A |
6111710 | Feyh et al. | Aug 2000 | A |
6181505 | Sacks et al. | Jan 2001 | B1 |
6185518 | Chen | Feb 2001 | B1 |
6249395 | Conway | Jun 2001 | B1 |
6307696 | Bishop et al. | Oct 2001 | B1 |
6307900 | Choi | Oct 2001 | B1 |
6313961 | Armstrong et al. | Nov 2001 | B1 |
6487032 | Cloke et al. | Nov 2002 | B1 |
6487672 | Byrne et al. | Nov 2002 | B1 |
6493403 | Ashley et al. | Dec 2002 | B1 |
6566922 | Schell et al. | May 2003 | B1 |
6583942 | Seng et al. | Jun 2003 | B2 |
6714603 | Ashley et al. | Mar 2004 | B2 |
6801380 | Sutardja | Oct 2004 | B1 |
6810485 | McEwen et al. | Oct 2004 | B2 |
6973535 | Bruner et al. | Dec 2005 | B2 |
7054088 | Yamazaki et al. | May 2006 | B2 |
7110199 | Sugawara et al. | Sep 2006 | B2 |
7136244 | Rothberg | Nov 2006 | B1 |
7466782 | Patapoutian | Dec 2008 | B1 |
20020087910 | McEwen et al. | Jul 2002 | A1 |
20020163748 | Patapoutian et al. | Nov 2002 | A1 |
20030030930 | Sugawara et al. | Feb 2003 | A1 |
20030147168 | Galbraith et al. | Aug 2003 | A1 |
20040091073 | Liu et al. | May 2004 | A1 |
20040101040 | Agazzi | May 2004 | A1 |
20050111540 | Modrie et al. | May 2005 | A1 |
Number | Date | Country | |
---|---|---|---|
20070183073 A1 | Aug 2007 | US |
Number | Date | Country | |
---|---|---|---|
60505602 | Sep 2003 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10794733 | Mar 2004 | US |
Child | 11733728 | US |