By Topic

Use of the list Viterbi algorithm to compute the distance spectrum of trellis codes and ISI channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Badri-Hoeher, S. ; Wireless Telecommun. & Multimedia Technol., Erlangen, Germany ; Hoeher, P.

We propose to compute the distance spectrum of arbitrary trellis codes (including convolutional codes, trellis-coded modulation, continuous phase modulation, etc.) and intersymbol-interference (ISI) channels by means of a modified list Viterbi algorithm (LVA). This search procedure is (i) computationally efficient, (ii) is applicable to linear as well as nonlinear codes, (iii) can be applied to arbitrary distance measures, (iv) can be used for MLSE as well as RSSE or related techniques, and (v) guarantees that an ordered list of the N nearest error paths is produced. A sample results illustrates the distance spectra of linear ISI channels, both for MLSE and ideal RSSE receivers

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference:

2000