Michael Kerner

dblp:75/8707 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory of computation · 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.

Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009
Physical-layer communications › channel coding › decoding algorithms
iterative decoding
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009
Physical-layer communications › signal detection › sequence estimation
maximum-likelihood sequence estimation
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009
Physical-layer communications
signal detection
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009
Physical-layer communications › channel coding › error control coding › concatenated codes
turbo codes
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009
Physical-layer communications › signal detection › sequence estimation
viterbi algorithm
0.112009
Iterative decoding using optimum soft input - hard output module · IEEE Trans. Commun. 2009

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

soft input hard output decoding · 0.1
YearPublicationVenuePosition
2009 Iterative decoding using optimum soft input - hard output module
abstract
Maximum likelihood sequence estimation (MLSE) in the shape of the Viterbi algorithm, although a strictly hard-output approach, is utilized for iterative decoding of turbo codes. It is a practical alternative when decoding complexity and speed may be traded for performance.
Michael Kerner, Ofer Amrani
IEEE Trans. Commun.1
2005 Viterbi algorithm motives in turbo decoding
abstract
This work addresses the problem of decoding turbo convolutional codes. In particular, it is concerned with the question of how maximum likelihood sequence estimation (MLSE), in the shape of the Viterbi algorithm (VA), can be utilized in the framework of turbo decoding. It is shown that the conventional VA, which is a soft-input hard-output decoder, can be used for iterative decoding of turbo codes. Moreover, it is demonstrated how the VA can be used for obtaining accurate BER estimation as well as an effective stopping criterion.
Michael Kerner, Ofer Amrani
ITW1