Hans Dieterich

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

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

Computer networks · 1

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 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications › modulation
coded modulation
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications › channel coding › error control coding
concatenated codes
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications › modulation › coded modulation
trellis-coded modulation
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications › modulation
continuous phase modulation
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications
modulation
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998
Physical-layer communications › modulation › continuous phase modulation
tamed frequency modulation
0.011998
Generalized concatenation of encoded tamed frequency modulation · IEEE Trans. Commun. 1998

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

viterbi algorithm · 0.0soft-output demodulation · 0.0multistep decoding · 0.0
YearPublicationVenuePosition
1998 Generalized concatenation of encoded tamed frequency modulation
abstract
A novel construction for encoded tamed frequency modulation (TFM) is introduced which is based on the principles of generalized concatenation. The inner TFM is partitioned into nested subsystems which increases the free Euclidean distances. In order to obtain a large distance among the nested TFM subsystems, the scrambler matrices have to be computed which transfer the original TFM into the equivalent TFM with better partitioning properties. Then outer convolutional codes with different error-correcting capabilities are used to protect the partitioning. The new concatenated and generalized concatenated constructions were simulated in an additive white Gaussian noise channel. A multistep decoding algorithm based on soft-output demodulation was used. We present various simulation results which show a significant coding gain in comparison with the best known trellis codes having the same trellis state complexity.
Martin Bossert, Sergo Shavgulidze, Armin Häutle, Hans Dieterich
IEEE Trans. Commun.4