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

Alex Jäger

dblp:372/5825 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0002-6232-6546ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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 · 67% Optical networks · 33%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
interference cancellation
0.912025
Information Rates of Successive Interference Cancellation for Optical Fiber · IEEE J. Sel. Areas Commun. 2025
Optical networks
optical fiber communication
0.912025
Information Rates of Successive Interference Cancellation for Optical Fiber · IEEE J. Sel. Areas Commun. 2025
Physical-layer communications › interference cancellation
successive interference cancellation
0.912025
Information Rates of Successive Interference Cancellation for Optical Fiber · IEEE J. Sel. Areas Commun. 2025

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

information theory · 1.7gaussian message passing · 1.7factor graph · 1.7
YearPublicationVenuePosition
2026 Feedforward Phase Noise Compensation for Intersymbol Interference Channels
abstract
A non-iterative phase noise compensation method based on the sum-product algorithm (SPA) is applied to the outputs of intersymbol interference (ISI) channels. The outputs are modeled as independent Gaussian random variables, and the receiver applies mismatched processing with von Mises statistics. The performance is compared with that of linear minimum-mean-square-error filtering. The SPA achieves higher information rates at similar complexity for three channel types: ISI-free, standard single-mode fiber, and multipath channels with orthogonal frequency-division multiplexing.
Alex Jäger, Gerhard Kramer
ISIT1
2025 Information Rates of Successive Interference Cancellation for Optical Fiber
abstract
Joint detection and decoding (JDD) achieves rates based on information theory but is too complex to implement for many channels with memory or nonlinearities. Successive interference cancellation (SIC) at the receiver, combined with multistage encoding at the transmitter, is a method that lets one use coded modulation for memoryless channels to approach JDD rates. A SIC-based receiver is presented to compensate for inter-channel interference in long-haul optical fiber links. Simulations for 1000 km of standard single-mode fiber with ideal distributed Raman amplification, single-polarization transmission, and circularly symmetric complex Gaussian (CSCG) modulation show that SIC attains the achievable information rates (AIRs) of JDD using surrogate channel models with correlated phase and additive noise (CPAN). Moreover, the AIRs of ring constellations are compared to those of CSCG modulation. Simulations show that 32 rings, 16 SIC-stages, and Gaussian message passing on the factor graph of the CPAN surrogate model achieve the JDD rates of CSCG modulation. The computational complexity scales in proportion to the number of SIC-stages, where one stage has complexity similar to separate detection and decoding.
Alex Jäger, Gerhard Kramer
IEEE J. Sel. Areas Commun.1