Content deleted Content added
Roger Wood (talk | contribs) Added two sections: IBM HDD and Precomp. |
Roger Wood (talk | contribs) Added references for 'Further Developments' |
||
Line 8:
'''Partial-response''' was first proposed by Adam Lender in 1963.<ref>[https://ieeexplore.ieee.org/abstract/document/6373379 A. Lender, "The duobinary technique for high-speed data transmission", Trans. AIEE, Part I: Communication and Electronics, Vol. 82 , No. 2 , pp. 214-218, May 1963]</ref> The method was generalized by Kretzmer in 1966. Kretzmer also classified the several different possible responses,<ref>[https://ieeexplore.ieee.org/document/1089288 E. Kretzmer, "Generalization of a Techinque for Binary Data Communication", IEEE Trans. Comm., Vol. 14, No. 1, pp. 67-68 Feb. 1966]</ref> for example, PR1 is duobinary and PR4 is the response used in the classical PRML. In 1970, Kobayashi and Tang recognized the value of PR4 for the [[magnetic recording]] channel.<ref>[https://ieeexplore.ieee.org/document/5391640 H. Kobayashi and D. Tang, "Application of Partial-response Channel Coding to Magnetic Recording Systems", IBM J. Res. Dev., Vol, 14, No. 4, pp. 368-375, July 1970]</ref> <br>
'''[[Maximum-likelihood]]''' decoding using the eponymous [[Viterbi algorithm]] was proposed in 1967 by [[Andrew Viterbi]] as a means of decoding [[convolutional codes]].<ref>[https://ieeexplore.ieee.org/document/1054010 A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm", IEEE Trans. Info. Theory, Vol. 13, No. 2, pp. 260-269, Apr. 1967]</ref> <br>
By 1971, [[Hisashi Kobayashi]] at [[IBM]] had recognized that the Viterbi Algorithm could be applied to analog channels with inter-symbol interference and particularly to the use of PR4 in the context of Magnetic Recording<ref>[https://ieeexplore.ieee.org/document/1054689 H. Kobayashi, ”Correlative level coding and maximum-likelihood decoding", IEEE Trans. Inform. Theory, vol. IT-17, PP. 586-594, Sept. 1971]</ref> (later called PRML). (The wide range of applications of the Viterbi algorithm is well described in a review paper by [[Dave Forney]].<ref>[https://www2.isye.gatech.edu/~yxie77/ece587/viterbi_algorithm.pdf
== Implementation in Products ==
Line 30:
== Further Developments ==
Generalized PRML<ref>[https://ieeexplore.ieee.org/document/1065230 H.Thapar, A.Patel, "A Class of Partial Response Systems for Increasing Storage Density in Magnetic Recording", IEEE Trans. Magn., vol. 23, No. 5, pp.3666-3668 Sept. 1987]</ref>. Minimum-phase whitened matched filter<ref>[https://ieeexplore.ieee.org/document/1054829 D. Forney, "Maximum Likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol Interference", IEEE Trans. Info. Theory, vol. IT-18, pp. 363-378, May 1972.]</ref>
Post-processor architecture<ref>[https://ieeexplore.ieee.org/document/281375 R. Wood, "Turbo-PRML, A Compromise EPRML Detector", IEEE Trans. Magn., Vol. MAG-29, No. 6, pp. 4018-4020, Nov. 1993]</ref><ref>[https://www.researchgate.net/publication/328870436 M. Despotovic, V. Senk, "Data Detection", Chapter 32 in ''Coding and Signal Processing for Magnetic Recording Systems'' edited by B. Vasic, E. Kurtas, CRC Press 2004]</ref>
Pattern-dependent noise prediction (PDNP)<ref>[https://ieeexplore.ieee.org/abstract/document/920181 J. Moon, J. Park, “Pattern-dependent noise prediction in signal dependent noise,” IEEE J. Sel. Areas Commun., vol. 19, no. 4, pp. 730–743, Apr. 2001]</ref>.
[[noise-predictive maximum-likelihood detection]] (NPML)<ref>[https://ieeexplore.ieee.org/document/539233 E. Eleftheriou, W. Hirt, "Improving Performance of PRML/EPRML through Noise Prediction". IEEE Trans. Magn. Vol. 32, No. 5, pp. 3968–3970, Sept. 1996]</ref>
== See also ==
Line 49 ⟶ 51:
[[Category:Computer storage devices]]
{{compu-stub}}
| |||