Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
1999-03-03
2001-04-10
Chung, Phung M. (Department: 2784)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S796000
Reexamination Certificate
active
06216249
ABSTRACT:
FIELD OF INVENTION
The present invention relates to the recording and reproduction of binary data in disk storage systems (magnetic and optical) for digital computers, particularly to a disk storage system employing a simplified branch metric calculator for reducing the cost of a trellis sequence detector by reducing the number of bits needed to calculate and store the branch metrics, which in turn reduces the add-compare-select circuitry for each state in the trellis.
CROSS REFERENCE TO RELATED APPLICATIONS AND PATENTS
This application is related to several U.S. patents, namely U.S. Pat. No. 5,291,499 entitled “METHOD AND APPARATUS FOR REDUCED-COMPLEXITY VITERBI-TYPE SEQUENCE DETECTORS,” U.S. Pat. No. 5,696,639 entitled “SAMPLED AMPLITUDE READ CHANNEL EMPLOYING INTERPOLATED TIMING RECOVERY,” and U.S. Pat. No. 5,424,881 entitled “SYNCHRONOUS READ CHANNEL.” All of the above-named patents are assigned to the same entity, and all are incorporated herein by reference.
BACKGROUND OF THE INVENTION
Computer systems typically comprise a disk storage device, for example a magnetic or optical disk drive, which provide an inexpensive means to store large amounts of digital data in a non-volatile manner. The disk storage device is essentially a communication system where the storage medium (magnetic or optical), transducer, and read/write electronics constitute the communication channel. Similar to other communication channels, the digital data in storage devices is “transmitted” through the channel by modulating an analog signal. In magnetic disk storage systems, for example, the digital data modulates the current in an inductive write coil in order to write a sequence of magnetic transitions onto the surface of a magnetic disk in concentric, radially spaced tracks. And in optical disk storage systems, the digital data may modulate the intensity of a laser beam in order to write a series of “pits” onto the surface of an optical disk in tracks that spiral inward toward the center of the disk.
During a read operation, a transducer or read head is positioned in close proximity to the surface of the disk, and while the disk spins under the read head, the read head senses the alterations (magnetic or optical) representing the digital data. The read head generates an analog read signal comprising pulses induced by the surface alterations. In magnetic recording, for example, the read head comprises a sensor that is responsive to the changes in the magnetic flux caused by the magnetic transitions representing the digital data. And in optical disk storage systems, the read head comprises a photodetector for measuring the intensity of a laser beam reflecting off the surface of the disk which changes as it passes over the pits representing the digital data.
As with other bandlimitted communication channels, the maximum capacity of a disk storage system is approximated by Shannon's equation for the capacity of an additive white Gaussian noise channel:
C
=
W
log
(
1
+
P
N
0
W
)
.
In the above equation, W is the channel bandwidth, N
0
is the noise power spectrum, and P is the signal power. The bandwidth W of a disk storage system is, for the most part, limited by the characteristics of the storage medium. Thus, once the storage medium is chosen, the maximum capacity of the storage system is essentially a function of the signal power P and the noise power N
0
(i.e., the signal-to-noise ratio or SNR). Certain characteristics of the storage medium also contribute to the noise power in the read signal, so designers generally choose the least expensive medium that will provide the highest bandwidth and SNR to attain maximum storage capacity.
In addition to innovations in the storage medium itself, attempts to increase storage capacity generally focus on improving the actual SNR through improvements to the transducer and drive electronics, as well as improving the effective SNR through the use of error correction codes (ECC), such as the Reed-Solomon ECC codes, and through the use of sophisticated signal processing techniques spawned by communication theory.
One such advancement in communication theory recently applied to disk storage systems that has provided significant gains in storage capacity is partial response (PR) signaling with maximum likelihood (ML) sequence detection. Partial response signaling refers to a particular method for transmitting symbols represented as analog pulses through a communication medium. The benefit is that at the signaling instances (baud rate) there is no intersymbol interference (ISI) from other pulses except for a controlled amount from immediately adjacent, overlapping pulses. Allowing the pulses to overlap in a controlled manner leads to an increase in the symbol rate (linear recording density) without sacrificing performance in terms of SNR. Stated differently, a partial response signal provides an increase in the effective SNR by making more efficient use of the channel bandwidth.
Partial response channels are characterized by the polynomials
(1−D)(1+D)
n
where D represents a delay of one symbol period and n is an integer. For n=1,2,3, the partial response channels are referred to as PR4, EPR4 and EEPR4, with their respective frequency responses shown in FIG.
1
A. The channel's dipulse response, the response to an isolated symbol, characterizes the transfer function of the system (the output for a given input). With a binary “1” bit modulating a positive dipulse response and a binary “0” bit modulating a negative dipulse response, the output of the channel y(t) is a linear combination of time shifted dipulse responses
y(t)=&Sgr;a
n
p(t−nT)
where an denotes the write current symbols +1 and −1 at time n and p(t) represents the channel's dipulse response shifted by nT (n symbol periods). The dipulse response for a PR4 channel (1−D
2
) is shown as a solid line in FIG.
1
B. Notice that at the symbol instances (baud rate), the dipulse response is zero except at times t=0 and t=2. Thus, the linear combination of time shifted PR4 dipulse responses will result in zero ISI at the symbol instances except where immediately adjacent pulses overlap.
It should be apparent that the linear combination of time shifted PR4 dipulse responses will result in a channel output of +2, 0, or −2 at the symbol instances (with the dipulse samples normalized to +1, 0, −1) depending on the binary input sequence. The output of the channel can therefore be characterized as a state machine driven by the binary input sequence, and conversely, the input sequence can be estimated or demodulated by running the signal samples at the output of the channel through an “inverse” state machine. Because noise will obfuscate the signal samples, the inverse state machine is actually implemented as a trellis sequence detector which computes a most likely input sequence associated with the signal samples. The algorithm for selecting a most likely sequence through a trellis was invented by a man named Viterbi, and thus the algorithm is commonly referred to as the Viterbi algorithm.
The Viterbi algorithm for a PR4 trellis sequence detector is understood from its state transition diagram shown in FIG.
2
A. Each state
2
is represented by the last two input symbols (in NRZ after preceding), and each branch from one state to another is labeled with the current input symbol in NRZ
4
and the corresponding sample value
6
it will produce during readback. The demodulation process of the PR4 sequence detector is understood by representing the state transition diagram of
FIG. 2A
as a trellis diagram shown in FIG.
2
B. The trellis diagram represents a time sequence of sample values and the possible recorded input sequences that could have produced the sample sequence. For each possible input sequence, an error metric is computed relative to a difference between the sequence of expected sample values that would have been generated in a noiseless system and the actual sample values output by
Bliss William G.
She Sian
Chung Phung M.
Cirrus Logic Inc.
Sheerin Howard H.
Shifrin Dan A.
LandOfFree
Simplified branch metric for reducing the cost of a trellis... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Simplified branch metric for reducing the cost of a trellis..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplified branch metric for reducing the cost of a trellis... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2459175