Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

In the soft-input soft-output Viterbi algorithm (SOVA), the log-likelihood ratio (LLR) of each bit is determined by the minimum… Expand

Is this relevant?

2011

2011

We introduce an iterative two-dimensional (2-D) soft output Viterbi algorithm (SOVA) for patterned media storage. Patterned media… Expand

Is this relevant?

2009

2009

Process capability surrogate model-based tolerance synthesis for multi-station manufacturing systems

The main challenges in tolerance synthesis for complex assembly design currently are: (i) to produce a simplified deterministic… Expand

Is this relevant?

2003

2003

In concatenated codes, the performance of the outer decoder can be improved with a soft output from the inner decoder. Soft… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

From the Publisher:
Error Control Coding: From Theory to Practice provides a concise introduction to basic coding techniques and… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

This study sets out to test the assumption that concepts of leadership differ as a function of cultural differences in Europe and… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

The Viterbi algorithm (VA) is the maximum likelihood decoding algorithm for convolutionally encoded data. Improvements in the… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

For estimating the states or outputs of a Markov process, the symbol-by-symbol MAP algorithm is optimal. However, this algorithm… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Iterative decoding of two dimensional systematic convolutional codes has been termed "turbo"-(de)coding. It is shown that the… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

The Viterbi algorithm (VA) is modified to deliver the most likely path sequence in a finite-state Markov chain, as well as either… Expand

Is this relevant?