940 research outputs found
Cancellation of linear intersymbol interference for two-dimensional storage systems
This paper discusses the cancellation of linear intersymbol interference (ISI) in two-dimensional (2-D) systems. It develops a theory for the error rate of receivers that use tentative decisions to cancel ISI. It also formulates precise conditions under which such ISI cancellation can be applied effectively. For many 2-D systems, these conditions are easily met, and therefore the application of ISI cancellation is of significant interest. The theory and the conditions are validated by simulation results for a 2-D channel model. Furthermore, results for an experimental 2-D optical storage system show that, for a single-layer disk with a capacity of 50 GB, a substantial performance improvement may be obtained by applying ISI cancellation
Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage
There is an increasing need for high density data storage devices driven by
the increased demand of consumer electronics. In this work, we consider a data
storage system that operates by encoding information as topographic profiles on
a polymer medium. A cantilever probe with a sharp tip (few nm radius) is used
to create and sense the presence of topographic profiles, resulting in a
density of few Tb per in.2. The prevalent mode of using the cantilever probe is
the static mode that is harsh on the probe and the media. In this article, the
high quality factor dynamic mode operation, that is less harsh on the media and
the probe, is analyzed. The read operation is modeled as a communication
channel which incorporates system memory due to inter-symbol interference and
the cantilever state. We demonstrate an appropriate level of abstraction of
this complex nanoscale system that obviates the need for an involved physical
model. Next, a solution to the maximum likelihood sequence detection problem
based on the Viterbi algorithm is devised. Experimental and simulation results
demonstrate that the performance of this detector is several orders of
magnitude better than the performance of other existing schemes.Comment: This paper is published in IEEE Trans. on communicatio
ON REDUCING THE DECODING COMPLEXITY OF SHINGLED MAGNETIC RECORDING SYSTEM
Shingled Magnetic Recording (SMR) has been recognised as one of the alternative technologies
to achieve an areal density beyond the limit of the perpendicular recording technique,
1 Tb/in2, which has an advantage of extending the use of the conventional method
media and read/write head.
This work presents SMR system subject to both Inter Symbol Interference (ISI) and Inter
Track Interference (ITI) and investigates different equalisation/detection techniques in order
to reduce the complexity of this system.
To investigate the ITI in shingled systems, one-track one-head system model has been extended
into two-track one-head system model to have two interfering tracks. Consequently,
six novel decoding techniques have been applied to the new system in order to find the Maximum
Likelihood (ML) sequence. The decoding complexity of the six techniques has been
investigated and then measured. The results show that the complexity is reduced by more
than three times with 0.5 dB loss in performance.
To measure this complexity practically, perpendicular recording system has been implemented
in hardware. Hardware architectures are designed for that system with successful
Quartus II fitter which are: Perpendicular Magnetic Recording (PMR) channel, digital
filter equaliser with and without Additive White Gaussian Noise (AWGN) and ideal
channel architectures. Two different hardware designs are implemented for Viterbi Algorithm
(VA), however, Quartus II fitter for both of them was unsuccessful. It is found that,
Simulink/Digital Signal Processing (DSP) Builder based designs are not efficient for complex
algorithms and the eligible solution for such designs is writing Hardware Description
Language (HDL) codes for those algorithms.The Iraqi Governmen
CHANNEL CODING TECHNIQUES FOR A MULTIPLE TRACK DIGITAL MAGNETIC RECORDING SYSTEM
In magnetic recording greater area) bit packing densities are achieved through increasing
track density by reducing space between and width of the recording tracks, and/or
reducing the wavelength of the recorded information. This leads to the requirement of
higher precision tape transport mechanisms and dedicated coding circuitry.
A TMS320 10 digital signal processor is applied to a standard low-cost, low precision,
multiple-track, compact cassette tape recording system. Advanced signal processing and
coding techniques are employed to maximise recording density and to compensate for
the mechanical deficiencies of this system. Parallel software encoding/decoding
algorithms have been developed for several Run-Length Limited modulation codes. The
results for a peak detection system show that Bi-Phase L code can be reliably employed
up to a data rate of 5kbits/second/track. Development of a second system employing a
TMS32025 and sampling detection permitted the utilisation of adaptive equalisation to
slim the readback pulse. Application of conventional read equalisation techniques, that
oppose inter-symbol interference, resulted in a 30% increase in performance.
Further investigation shows that greater linear recording densities can be achieved by
employing Partial Response signalling and Maximum Likelihood Detection. Partial
response signalling schemes use controlled inter-symbol interference to increase
recording density at the expense of a multi-level read back waveform which results in an
increased noise penalty. Maximum Likelihood Sequence detection employs soft
decisions on the readback waveform to recover this loss. The associated modulation
coding techniques required for optimised operation of such a system are discussed.
Two-dimensional run-length-limited (d, ky) modulation codes provide a further means of
increasing storage capacity in multi-track recording systems. For example the code rate
of a single track run length-limited code with constraints (1, 3), such as Miller code, can
be increased by over 25% when using a 4-track two-dimensional code with the same d
constraint and with the k constraint satisfied across a number of parallel channels. The k
constraint along an individual track, kx, can be increased without loss of clock
synchronisation since the clocking information derived by frequent signal transitions
can be sub-divided across a number of, y, parallel tracks in terms of a ky constraint. This
permits more code words to be generated for a given (d, k) constraint in two dimensions
than is possible in one dimension. This coding technique is furthered by development of
a reverse enumeration scheme based on the trellis description of the (d, ky) constraints.
The application of a two-dimensional code to a high linear density system employing
extended class IV partial response signalling and maximum likelihood detection is
proposed. Finally, additional coding constraints to improve spectral response and error
performance are discussed.Hewlett Packard, Computer Peripherals Division (Bristol
Minimum latency tracking of rapid variations in two-dimensional storage systems
The trend of increasing storage densities results in growing sensitivity of system performance to variations of storage channel parameters. To counteract these variations, more adaptivity is needed in the data receiver. Accurate tracking of rapid variations is limited by latencies in the adaptation loops. These latencies are largely governed by delays of the bit detector. In two-dimensional storage systems, data are packaged in a group of adjacent tracks or rows, and for some of the rows the detection delays can increase dramatically with respect to one-dimensional systems. As a result, the effective latencies in the adaptation loops preclude the tracking of rapid variations and really limit the performance of the system. In this paper, a scheme is proposed that overcomes this problem and that can be used for timing recovery, automatic gain control, and other adaptive circuits. Rapid variations for all the rows are tracked using control information from rows for which detector latency is smallest. This works properly if rapid variations are common across the rows as is the case, for example, for the two-dimensional optical storage (TwoDOS) system. Experimental results for TwoDOS confirm that the scheme yields improved performance with respect to conventional adaptation scheme
- …