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

Jihai Cao

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

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

Computer networks · 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
Information theory · 89% Algorithmic game theory and mechanism design · 11%
Computer networks
2 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity
capacity-achieving input distribution
0.422014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques · IEEE Trans. Commun. 2014
Information theory
channel capacity
0.422014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques · IEEE Trans. Commun. 2014
Information theory › communication channels › channel models › optical channel
poisson channel
0.422014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques · IEEE Trans. Commun. 2014
Information theory › communication channels › channel models
binary-input channel
0.212014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Information theory › communication channels › channel models
optical channel
0.212014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques · IEEE Trans. Commun. 2014
Algorithmic game theory and mechanism design › mechanism design › information design
optimal signaling
0.212014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Physical-layer communications
optical communication
0.122014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs · IEEE Trans. Commun. 2014
Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques · IEEE Trans. Commun. 2014

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

numerical simulation · 0.4numerical optimization · 0.4deterministic annealing · 0.4analytical derivation · 0.4
YearPublicationVenuePosition
2014 Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part I: General Properties and Numerical Techniques
abstract
Despite being an accepted model for a wide variety of optical channels, few general results on optimal signalling for discrete-time Poisson (DTP) channels are known. Among the most significant is that under simultaneous peak and average constraints, the capacity-achieving distributions are discrete with a finite number of mass points. In this paper, several fundamental properties of capacity-achieving distributions for DTP channels are established. In particular, we demonstrate that all capacity-achieving distributions of the DTP channel have zero as a mass point. In the case of only a peak constraint, it is further shown that the optimal distribution always has a mass point at the maximum amplitude. Finally, under solely an average power constraint, it is shown that a finite number of mass points are insufficient to achieve the capacity. In addition to these analytical results, a numerical algorithm based on deterministic annealing is presented which can efficiently compute both the channel capacity and the associated optimal input distribution under peak and average power constraints. Numerical lower bounds based on the envelope of information rates induced by the maxentropic distributions are also shown to be extremely close to the capacity, especially in the low power regime.
Jihai Cao, Steve Hranilovic, Jun Chen 0005
IEEE Trans. Commun.1
2014 Capacity-Achieving Distributions for the Discrete-Time Poisson Channel - Part II: Binary Inputs
abstract
Discrete-time Poisson (DTP) channels exist in many scenarios including space laser communication systems which operate over long distances and which can be corrupted by reflected and scattered light. Through simulation, binary-input distributions have been observed to be optimal in many cases, however, little analytical work exists on conditions for optimality or the form of optimal signalling. In this second part, the general properties of Part I are extended to the case of DTP channels where binary-inputs are optimal. Necessary and sufficient conditions on the optimality of binary (i.e. two mass point) distributions are presented by leveraging the general properties of DTP capacity-achieving distributions. Closed-form expressions of the capacity-achieving distributions are derived in several important special cases including zero dark current and for high dark current. Numerical results are presented to elucidate the developed analytical work.
Jihai Cao, Steve Hranilovic, Jun Chen 0005
IEEE Trans. Commun.1