A digital magnetic recording system is viewed in this paper as a linear system that inherently includes a correlative level encoder. This encoder can be regarded aas linear finite-state machine like a convolutional encoder. The maximum likelihood decoding method recently devised by Viterbi to decode convolutional codes is then applietdo digital magnetic recording systems. The decoding algorithm and its implementation are discussed in detail.
Expressions for the decoding error probability are obtained and confirmed by computer simulations. It is shown that a significant improvement in the performance with respect to other methods is achievable by the maximum likelihood decoding method. For example, under the Gaussian noise assumption the proposed technique can reduce raw error ratehse in 10-3 to 10-4 range by a factor of 50 to 300. These results indicate that the maximum likelihood decoding method gains as much as 2.5 dB in signal-to-noise ratio over the conventional bit-by-bit detection method.
[1]
Andrew J. Viterbi,et al.
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
,
1967,
IEEE Trans. Inf. Theory.
[2]
Hisashi Kobayashi,et al.
Application of partial-response channel coding to magnetic recording systems
,
1970
.
[3]
J. Omura,et al.
On the Viterbi decoding algorithm
,
1969,
IEEE Trans. Inf. Theory.
[4]
Hisashi Kobayashi,et al.
Correlative level coding and maximum-likelihood decoding
,
1971,
IEEE Trans. Inf. Theory.
[5]
Adam Lender.
Correlative level coding for binary-data transmission
,
1966,
IEEE Spectrum.