Realization Complexity of a Viterbi Decoder for a Partial Response Equalized Magnetic Channel
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.
magnetic recording partial response maximum sequence likelihood Viterbi detector
Jen-Shu Hsiao Chiu-Hsiung Chen Tsai-Sheng Kao
General Education Center Lee-Ming Institute of Technology Hao-Hsiang Ku Department of Computer Scien Department of Computer Science and Information Engineering China University of Technology Hsinchu, T Department of Electronic Engineering Hwa-Hsia Institute of Technology Taipei, Taiwan, R.O.C
国际会议
2010 International Conference on Signal and Information Processing(2010年IEEE信号与信息处理国际会议 ICSIP2010)
长沙
英文
602-605
2010-12-14(万方平台首次上网日期,不代表论文的发表时间)