A reduced complexity EPR4 post-processor

Author

Fitzpatrick, Kelly Knudson

Author_Institution

Quantum Corp., Miltptas, CA., USA

Volume

34

Issue

1

fYear

1998

fDate

1/1/1998 12:00:00 AM

Firstpage

135

Lastpage

140

Abstract

A reduced-complexity Extended Partial Response Class 4 (EPR4) detector implemented as a post-processor following a Partial Response Class 4 (PR4) Viterbi detector is described. Previous work showed that a post-processor architecture eliminates the speed bottleneck associated with an EPR4 Viterbi detector while providing comparable performance. The post-processor uses EPR4 metrics to detect and correct minimum distance EPR4 error-events in the binary sequence at the output of a PR4 Viterbi detector. In the new approach, the complexity is greatly reduced without sacrificing performance by considering only those EPR4 error-events deemed most-likely based on their PR4 metrics

Keywords

Viterbi detection; binary sequences; computational complexity; error correction; error detection; magnetic recording; maximum likelihood detection; partial response channels; PR4 metrics; binary sequence; maximum likelihood sequence estimation; minimum distance EPR4 error-events; partial response class 4 Viterbi detector; post-processor; reduced-complexity extended partial response class 4 detector; saturation magnetic recording; Binary sequences; Delay; Detectors; Error correction; Magnetic memory; Pulse shaping methods; Signal detection; Signal processing; Space vector pulse width modulation; Viterbi algorithm;

fLanguage

English

Journal_Title

Magnetics, IEEE Transactions on

Publisher

ieee

ISSN

0018-9464

Type

jour

DOI

10.1109/20.663501

Filename

663501