An analysis of the truncated Viterbi algorithm for PRML channels

Author

Weathers, Anthony D.

Author_Institution

Overland Data Inc., San Diego, CA, USA

Volume

3

fYear

1999

fDate

1999

Firstpage

1951

Abstract

This paper presents a new method of characterizing error events that cause bit errors for a truncated Viterbi algorithm detector. The truncated Viterbi algorithm is a practical approximation of maximum likelihood sequence estimation. The approach is applicable to convolutional codes or partial response channels and results in tighter error bounds than previous approaches. The technique is applied to several partial response channels that are commonly used as equalization targets for digital storage channels

Keywords

Viterbi detection; channel coding; convolutional codes; digital storage; maximum likelihood sequence estimation; partial response channels; PRML channels; bit errors; convolutional codes; digital storage channels; equalization; error bounds; error events; maximum likelihood sequence estimation; partial response channels; truncated Viterbi algorithm detector; Algorithm design and analysis; Convolutional codes; Delay; Detectors; Event detection; Maximum likelihood detection; Maximum likelihood estimation; Partial response channels; Polynomials; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1999. ICC '99. 1999 IEEE International Conference on

Conference_Location

Vancouver, BC

Print_ISBN

0-7803-5284-X

Type

conf

DOI

10.1109/ICC.1999.765601

Filename

765601