ScholarLens Back to search
1998•IEEE Communications LettersRequires access

Parallel trellis Viterbi algorithm for sparse channels

N.C. McGinty, Rodney A. Kennedy, P. Hocher

Open publisher page 42 citations

Abstract

The Viterbi algorithm (VA), which normally operates using a single trellis, can be optimally reformulated into a set of independent trellises for a special class of sparse intersymbol interference (ISI) channels. These independent trellises operate in parallel and have less overall complexity than a single trellis. This trellis decomposition can be applied to a more general class of sparse channels approximately resulting in a suboptimal reduced complexity equalizer.

About this research paper

What this paper is about

The Viterbi algorithm (VA), which normally operates using a single trellis, can be optimally reformulated into a set of independent trellises for a special class of sparse intersymbol interference (ISI) channels. These independent trellises operate in parallel and have less overall complexity than a single trellis. This trellis decomposition can be applied to a more general class of sparse channels approximately resulting in a suboptimal reduced complexity equalizer.

Why it matters

OpenAlex reports 42 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Viterbi algorithm (VA), which normally operates using a single trellis, can be optimally reformulated into a set of independent trellises for a special class of sparse intersymbol interference (ISI) channels. These independent trellises operate in parallel and have less overall complexity than a single trellis. This trellis decomposition can be applied to a more general class of sparse channels approximately resulting in a suboptimal reduced complexity equalizer.

Key concepts: Trellis (graph), Viterbi algorithm, Intersymbol interference, Algorithm, Soft output Viterbi algorithm, Computer science, Iterative Viterbi decoding, Viterbi decoder

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Parallel trellis Viterbi algorithm for sparse channels — Research Paper | ScholarLens