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.

Mohammad Farsi 0001

dblp:227/4716-1 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-2727-7002ORCID · verified

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

Computer networks · 1 · 1 first-author · 1 since 2021Theory of computation · 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
2 papers
Physical-layer communications · 71% Optical networks · 29%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.912025
On the Capacity of Correlated Phase-Noise Channels: An Electro-Optic Frequency Comb Example · IEEE Trans. Inf. Theory 2025
Information theory › channel capacity
phase-noise channel
0.912025
On the Capacity of Correlated Phase-Noise Channels: An Electro-Optic Frequency Comb Example · IEEE Trans. Inf. Theory 2025
Physical-layer communications › information theory › capacity analysis
channel capacity
0.612022
Capacity Bounds Under Imperfect Polarization Tracking · IEEE Trans. Commun. 2022
Physical-layer communications
channel estimation
0.612022
Capacity Bounds Under Imperfect Polarization Tracking · IEEE Trans. Commun. 2022
Optical networks
optical fiber communication
0.612022
Capacity Bounds Under Imperfect Polarization Tracking · IEEE Trans. Commun. 2022
Physical-layer communications
optical communication
0.312025
On the Capacity of Correlated Phase-Noise Channels: An Electro-Optic Frequency Comb Example · IEEE Trans. Inf. Theory 2025

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

capacity bounds · 1.7achievable information rates · 1.7monte carlo simulation · 0.6least-squares estimation · 0.6kabsch algorithm · 0.6
YearPublicationVenuePosition
2025 On the Capacity of Correlated Phase-Noise Channels: An Electro-Optic Frequency Comb Example
abstract
The capacity of a discrete-time channel with correlated phase noises is investigated. In particular, the electro-optic frequency comb system is considered, where the phase noise of each subchannel is a combination of two independent Wiener phase-noise sources. Capacity upper and lower bounds are derived for this channel and are compared with lower bounds obtained by numerically evaluating the achievable information rates using quadrature amplitude modulation constellations. Capacity upper and lower bounds are provided for the high signal-to-noise ratio (SNR) regime. The multiplexing gain (pre-log) is shown to beM− 1, whereMrepresents the number of subchannels. A constant gap between the asymptotic upper and lower bounds is observed, which depends on the number of subchannelsM. For the specific case ofM= 2, capacity is characterized up to a term that vanishes as the SNR grows large.
Mohammad Farsi 0001, Hamdi Joudeh, Gabriele Liga, Alex Alvarado, Magnus Karlsson 0001, Erik Agrell
IEEE Trans. Inf. Theory1
2022 Capacity Bounds Under Imperfect Polarization Tracking
abstract
In optical fiber communication, due to the random variation of the environment, the state of polarization (SOP) fluctuates randomly with time leading to distortion and performance degradation. The memory-less SOP fluctuations can be regarded as a two-by-two random unitary matrix. In this paper, for what we believe to be the first time, the capacity of the polarization drift channel under an average power constraint with imperfect channel knowledge is characterized. An achievable information rate (AIR) is derived when imperfect channel knowledge is available and is shown to be highly dependent on the channel estimation technique. It is also shown that a tighter lower bound can be achieved when a unitary estimation of the channel is available. However, the conventional estimation algorithms do not guarantee a unitary channel estimation. Therefore, by considering the unitary constraint of the channel, a data-aided channel estimator based on the Kabsch algorithm is proposed, and its performance is numerically evaluated in terms of AIR. Monte Carlo simulations show that Kabsch outperforms the least-square error algorithm. In particular, with complex, Gaussian inputs and eight pilot symbols per block, Kabsch improves the AIR by 0.20 to 0.30 bits/symbol throughout the range of studied signal-to-noise ratios.
Mohammad Farsi 0001, Magnus Karlsson 0001, Erik Agrell
IEEE Trans. Commun.1