Dynamic magnetic information storage or retrieval – General recording or reproducing – Signal switching
Reexamination Certificate
1997-09-22
2001-08-28
Mei, Xu (Department: 2644)
Dynamic magnetic information storage or retrieval
General recording or reproducing
Signal switching
C360S046000, C700S094000
Reexamination Certificate
active
06282042
ABSTRACT:
TECHNICAL FIELD
This invention relates to data processing apparatus and methods, and to electronic circuits for use in connection therewith. In particular, but not exclusively, the invention relates to apparatus and methods for retrieving data stored using a DDS Data Storage System. The invention also extends in general to apparatus and methods for processing data in one or more communications channels.
BACKGROUND ART
It is already known to provide reliable storage and retrieval of large volumes of digital data, such as computer data, in particular by means of the DDS (Digital Data Storage) format defined in ISO/IEC standard 12247.
In a DDS read/write mechanism using the above format, data are recorded on an elongate recording media, comprising a tape coated with a magnetic medium, by a rotating drum carrying one or more electro-magnetic heads. The tape is moved by a motor-driven capstan along a path extending between two spools or reels and wrapped partially around the drum. The plane of rotation of the heads of the drum is disposed at an angle to the plane of movement of the tape, so that each head traverses the tape along successive diagonal tracks extending across the width of the tape at an angle to its centre line. The mechanism includes appropriate circuitry for encoding data into signals suitable for recording onto tape, including error-detection and correction codes, and for conditioning of those signals into a form which is optimally matched to the characteristics of the recording media. For data retrieval, additional circuitry is provided for detecting magnetic field variations stored on the tape, deriving corresponding signals, conditioning those signals into a form suitable for subsequent processing, decoding the encoded data and detecting and correcting errors.
In a current format (DDS-2), data are recorded at a bit density of approximately 61 kilobits per inch (kbpi) (equivalent to approximately 24 kilobits per centimeter). At this bit density, a typical DDS tape cartridge can currently store up to approximately 8 gigabytes of data, using the longest practicable tape and techniques such as data compression to maximise the quantity of data the tape can accommodate. With the steadily increasing use of computer equipment and the volumes of data processed and stored by such equipment, it has become desirable to increase the capacity of a DDS tape cartridge still further.
The assignee of this invention is in the process of developing a new format (DDS-3) which further increases the storage capacity by doubling the linear recording density and increasing the proportion of a recorded track that is available for user data. Together, these improvements are estimated to provide about three times the data capacity of DDS-2, for a cartridge of given tape length. The DDS-3 format, when recorded on the longest practicable tape, is designed to provide a storage capacity of 12 gigabytes of uncompressed user data or typically 24 gigabytes of compressed user data.
Reference is directed to the commonly assigned, previously published International Patent Application WO95/15551 for further details of this scheme, the contents of the earlier Patent Application being incorporated herein by reference.
Because the linear bit density in DDS-3 is twice that of DDS-2, the bit spacing on the-tape is approximately one half of the gap of the preferred read head. This means that the output signal from the read head, instead of varying between two discrete levels (+1,−1) varies; between three levels (+2,0,−2), and as such, DDS-3 will be a 3-level system.
It is proposed to recover recorded data by means of a partial-response maximum-likelihood (PRML) data recovery channel.
“Partial Response” denotes a practicable Partial Response signalling scheme which only requires up to the Nyquist frequency bandwidth for data transmission, by enforcing deterministic intersymbol-interference at the detector input. An example is the PR-1 (or duobinary) Partial Response system (recording channel transfer function) which is described by the discrete time transfer function F(D)=D+1. Other examples such as class IV or PR-4 exist, and we do not exclude these possibilities.
“Maximum Likelihood” denotes a Maximum Likelihood Detection decoding scheme, implementing a Viterbi algorithm, which chooses the most likely sequence of output data, using a sequence of received samples, instead of just one received sample at a time.
In the read-mode of a typical proposed scheme for DDS-3, the approximately equalised signal is taken and is subjected to Automatic Gain Control to establish and stabilise the signal amplitudes, and then to full Adaptive Equalisation to a combined PR-1 target. In the Adaptive Equalisation step, an adaptive, sampled finite impulse response filter is used to provide a three-level PR-1 target transfer function. In one embodiment, after Adaptive Equalisation, the signal undergoes analogue to digital conversion, followed by three-level Viterbi (or Maximum Likelihood) detection. In order to do this, clock information is extracted from the input signal and used to synchronise the Adaptive Equaliser, the analogue to digital converter, and the Viterbi decoder. In another embodiment, the Adaptive Equalisation is, instead, be performed after analogue to digital conversion.
As in previous DDS formats, in the proposed DDS-3 format, data are stored in a series of tracks of alternate azimuth (referred to as the A track and B track respectively). Each end of each track is occupied by a margin region which is expendable, the front margin being followed by a preamble region, which is often indistinguishable from the margin. The preamble region is normally a plain sinusoidal tone and does not carry any data, but exists to enable the AGC loop and the clock recovery loop to achieve fast lock-on and also to identify the start of the main data region. A preamble detector controls the Adaptive Equaliser to ensure that the channels do not try to adapt the preamble or margin regions, because otherwise they will not be optimised for the data portion.
In this Specification, the term communications channel is used broadly to include channels of data retrieved from a recorded medium.
SUMMARY OF THE INVENTION
In DDS-3, we propose to use an adaptive filter which we refer to herein as a feed-forward equaliser (FFE). At the start of each track, the FFE is loaded with a set of initial coefficient values; as the read head transverses the track, the coefficient values adapt to a set of stable values (which can vary from track to track) to minimise the difference between the actual filter output and the ideal output, which in DDS-3 is one of the values +2, 0, −2. In a 3-level signal system as used in DDS-3, there are several possible stable sets of filter coefficient values, but only one of which is actually the desired set which produces a decodable data sequence.
Although it might be thought that a common set of FFE starting coefficients for both the A and B tracks would quickly adapt to the correct values, we have found that there is a significant difference between the spectral characteristics of the A and B tracks and we have found that, by storing separate sets of coefficients for each of the A and B tracks, we can provide a considerably improved adaption process.
Whilst we have discussed this with reference to DDS-3, it will be appreciated that the invention extends to other systems which process data certain of whose characteristics may be predictable. Also, this aspect of the invention also extends to other types of communication channel and not just to those derived from a recorded medium.
Accordingly, in one aspect, this invention provides a sampled time filter apparatus for processing a signal, said signal comprising a succession of streams of data of a first characteristic interspersed with streams of data of a second characteristic, said sampled time filter apparatus having means for storing a plurality of filter coefficients corresponding to streams of said first characteristic,
Hana Andrew
Langford Stephen Paul
Williams Christopher Huw
Hewlett--Packard Company
Mei Xu
LandOfFree
Data processing apparatus and methods does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data processing apparatus and methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing apparatus and methods will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2517343