Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christiane Nill

dblp:119/4676 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes
concatenated codes
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes
convolutional codes
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › decoding
iterative decoding
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › decoding › trellis decoding › viterbi algorithm
soft-output viterbi algorithm
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011995
List and soft symbol output Viterbi algorithms: extensions and comparisons · IEEE Trans. Commun. 1995

Methods — techniques the papers use, named apart from their topics

soft-output decoding · 0.0maximum-likelihood decoding · 0.0list decoding · 0.0
YearPublicationVenuePosition
1995 List and soft symbol output Viterbi algorithms: extensions and comparisons
abstract
The Viterbi algorithm (VA) is the maximum likelihood decoding algorithm for convolutionally encoded data. Improvements in the performance of a concatenated coding system that uses VA decoding (inner decoder) can be obtained when, in addition to the standard VA output, an indicator of the reliability of the VA decision is delivered to the outer stage of processing. Two different approaches of extending the VA are considered. In the first approach, the VA is extended with a soft output (SOVA) unit that calculates reliability values for each of the decoded output information symbols. In the second approach, coding gains are obtained by delivering a list of the L best estimates of the transmitted data sequence, namely the list Viterbi decoding algorithm (LVA). Our main interest is to evaluate the LVA and the SOVA in comparison with each other, determine suitable applications for both algorithms and to construct extended versions of the LVA and the SOVA with low complexity that perform the task of the other algorithm. We define a list output VA using the output symbol reliability information of the SOVA to generate a list of size L and that also has a lower complexity than the regular LVA for a long list size. We evaluate the list-SOVA in comparison to the LVA. Further, we introduce a low complexity soft symbol output viterbi algorithm that accepts the (short) list output of the LVA and calculates for each of the decoded information bits a reliability value. The complexity and the performance of the soft-LVA (LVA and soft decoding unit) is a function of the list size L. The performance of the soft-LVA and the SOVA are compared in a concatenated coding system. A new software implementation of the iterative serial version of the LVA is also included.>
Christiane Nill, Carl-Erik W. Sundberg
IEEE Trans. Commun.1