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

Neele von Deetzen

dblp:02/1755 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

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

Computer networks · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 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
2 papers
Coding theory · 94% Graph algorithms and graph theory · 6%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
LDPC codes
0.222010
Design of bandwidth-efficient unequal error protection LDPC codes · IEEE Trans. Commun. 2010
On the UEP Capabilities of Several LDPC Construction Algorithms · IEEE Trans. Commun. 2010
Coding theory › error-correcting codes
unequal error protection
0.222010
Design of bandwidth-efficient unequal error protection LDPC codes · IEEE Trans. Commun. 2010
On the UEP Capabilities of Several LDPC Construction Algorithms · IEEE Trans. Commun. 2010
Physical-layer communications
modulation
0.012010
Design of bandwidth-efficient unequal error protection LDPC codes · IEEE Trans. Commun. 2010
Coding theory › error-correcting codes
code construction
0.012010
On the UEP Capabilities of Several LDPC Construction Algorithms · IEEE Trans. Commun. 2010
Graph algorithms and graph theory › network analysis › complex networks
degree distribution
0.012010
On the UEP Capabilities of Several LDPC Construction Algorithms · IEEE Trans. Commun. 2010

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

gaussian approximation · 0.2density evolution · 0.2
YearPublicationVenuePosition
2010 On the UEP Capabilities of Several LDPC Construction Algorithms
abstract
This paper analyzes construction algorithms for low-density parity-check (LDPC) codes with respect to their unequal error protection (UEP) capabilities. We show that the choice of code construction algorithm highly affects the performance and UEP properties of LDPC codes with identical degree distributions. Our results provide an explanation to disagreements in earlier research.
Neele von Deetzen, Sara Sandberg
IEEE Trans. Commun.1
2010 Design of bandwidth-efficient unequal error protection LDPC codes
abstract
This paper presents a strategy for the design of bandwidth-efficient LDPC codes with unequal error protection. Bandwidth efficiency is obtained by appropriately designing the codes for higher order constellations, assuming an AWGN channel. The irregularities of the LDPC code are designed, using the Gaussian approximation of the density evolution, to enhance the unequal error protection property of the code as well as account for the different bit error probabilities given by the higher order constellation. The proposed code design algorithm is flexible in terms of the number and proportions of protection classes. It also allows arbitrary modulation schemes. Our method combines the design of unequal error protection LDPC codes for the binary input AWGN channel with the code design for higher order constellations by dividing the variable node degree distribution into sub-degree distributions for each protection class and each level of protection from the modulation. The results show that appropriate code design for higher order constellations reduces the overall bit-error rate significantly. Furthermore, the unequal error protection capability of the code is increased, especially for high SNR.
Sara Sandberg, Neele von Deetzen
IEEE Trans. Commun.2
2008 Unequal error protection multilevel codes and hierarchical modulation for multimedia transmission
abstract
This paper presents the design of multilevel coding schemes optimized for the transport of multimedia data. The key feature is unequal error protection which allows for more protection for header information and essential data, accepting worse performance for less important payload. The approach is based on the information theoretical description of mutual information in multilevel coding schemes. We discuss the suitability and UEP capability of standard as well as non-uniform signal constellations. We investigate the flexibility of this method regarding the design freedom and verify the approach by an image transmission application.
Neele von Deetzen, Werner Henkel
ISIT1
2007 Design of Unequal Error Protection LDPC Codes for Higher Order Constellations
abstract
We present an optimization method for unequal error protection (UEP)-LDPC codes with higher order constellations. By modifying the density evolution algorithm under the Gaussian approximation, we propose a flexible code design algorithm for a variable number of protection classes and arbitrary modulation schemes with Gray mapping. Our results show that appropriate code design for higher order constellations reduces the overall bit-error rate. Furthermore, the influence on the UEP capability of the code, that is, the difference in bit-error rate between the protection classes, is investigated.
Neele von Deetzen, Sara Sandberg
ICC1
2006 Decoder Scheduling of Hybrid Turbo Codes
abstract
This paper describes the turbo decoding of hybrid concatenated codes with interleavers and presents a new analysis of the decoding process including information processing and convergence. From this analysis, the decoding can be scheduled with respect to optimization issues like computational complexity and convergence behavior
Neele von Deetzen, Werner Henkel
ISIT1