2014
DOI: 10.1109/tcomm.2013.112513.130143
|View full text |Cite
|
Sign up to set email alerts
|

Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part II: Binary Inputs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
18
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(19 citation statements)
references
References 10 publications
1
18
0
Order By: Relevance
“…Comparing the mean and variance [c.f. (16) and (17), respectively] of n s with the results given in (7)(8), it is seen that for T < τ << 1 λ , the finite-rate sampling essentially increases the equivalent dead time from τ to τ + T /2, while the sub-Poisson distribution can still well describe photon-counting process based on rising edge detection.…”
Section: Corollarymentioning
confidence: 73%
“…Comparing the mean and variance [c.f. (16) and (17), respectively] of n s with the results given in (7)(8), it is seen that for T < τ << 1 λ , the finite-rate sampling essentially increases the equivalent dead time from τ to τ + T /2, while the sub-Poisson distribution can still well describe photon-counting process based on rising edge detection.…”
Section: Corollarymentioning
confidence: 73%
“…NLOS UV scattering communication has been extensively investigated from both theoretic and experimental perspectives recently, which can be characterized by Poisson channel. The capacities of continuous-time and discrete-time Poisson channel have been studied in [3], [4] and [5], [6], respectively. Moreover, the capacities of MISO and MIMO communication have been investigated in [7] and [8], respectively.…”
Section: Introductionsmentioning
confidence: 99%
“…. , p N ] with p i = 2 µ 1 −c i +µ 2 s i , where µ 1 and µ 2 are chosen such that p satisfies the constraints in (12). Then p uniquely solves (12).…”
Section: Entropy Maximizationmentioning
confidence: 99%
“…Note that the optimization problem defining F (λ) is of the form given in (12). Hence, according to Lemma 2.2, F (λ) has a unique optimizer q with components q j = 2 µ−λ j , where µ ∈ R needs to be chosen such that q ∈ ∆ M , i.e.,…”
Section: B Capacity Approximation Schemementioning
confidence: 99%
See 1 more Smart Citation