1 October 2011 Realization complexity of a Viterbi decoder for a partial response equalized magnetic channel
Author Affiliations +
Proceedings Volume 8285, International Conference on Graphic and Image Processing (ICGIP 2011); 828556 (2011); doi: 10.1117/12.913378
Event: 2011 International Conference on Graphic and Image Processing, 2011, Cairo, Egypt
Abstract
To retrieve information of magnetic storage, a detector is usually designed for processing the received signal.However, the nonlinear effects arise and limit the performance of the detector at a higher recording density. Fortunately,several models have been proposed to describe the nonlinear effects; and a partial response maximum sequence likelihood (PRML) detector, often realized by the Viterbi algorithm, can be applied for data detection. The realization complexities of a Viterbi decoder for different channel models are analyzed. The realization complexity of the Viterbi detector for the new representation is comparable to those of the simple partial erasure model (SPEM) and linearized model.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jen-Shu Hsiao, Hao-Hsiang Ku, Chiu-Hsiung Chen, Tsai-Sheng Kao, "Realization complexity of a Viterbi decoder for a partial response equalized magnetic channel", Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828556 (1 October 2011); doi: 10.1117/12.913378; https://doi.org/10.1117/12.913378
PROCEEDINGS
7 PAGES


SHARE
KEYWORDS
Sensors

Magnetism

Magnetic sensors

Data modeling

Performance modeling

Signal processing

Signal detection

RELATED CONTENT


Back to Top