Share Email Print

Proceedings Paper

Realization complexity of a Viterbi decoder for a partial response equalized magnetic channel
Author(s): Jen-Shu Hsiao; Hao-Hsiang Ku; Chiu-Hsiung Chen; Tsai-Sheng Kao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 October 2011
PDF: 7 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828556 (1 October 2011); doi: 10.1117/12.913378
Show Author Affiliations
Jen-Shu Hsiao, Lee-Ming Institute of Technology (Taiwan)
Hao-Hsiang Ku, Hwa-Hsia Institute of Technology (Taiwan)
Chiu-Hsiung Chen, China Univ. of Technology (Taiwan)
Tsai-Sheng Kao, Hwa-Hsia Institute of Technology (Taiwan)

Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top