ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the KK-user quasi-static scalar fading broadcast channel without transmit CSI,

Yk=AkX+Zk,k=1,…,K,Y_k = \sqrt{A_k}X + Z_k,\quad k=1,\ldots,K,

where Zk∼CN(0,1)Z_k \sim \mathcal{CN}(0,1)), XX has average power constraint ρ\rho, each AkA_k is constant over the coding block and known only at decoder kk, and the AkA_k are mutually independent. Let Gk(ϵk)G_k(\epsilon_k) denote the corresponding ϵk\epsilon_k-outage channel-gain quantile, and let Rdpc(ρ,ϵ‾)\mathcal{R}^\mathrm{dpc}(\rho,\underline{\epsilon}) be the DPC outage achievable rate region defined by the power-allocation parameters γk≥0\gamma_k\geq 0 with ∑k=1Kγk=1\sum_{k=1}^K\gamma_k=1.

DPC optimality conjecture. If the KK decoders are ordered such that

G1(ϵ1)≥G2(ϵ2)≥⋯≥GK(ϵK),G_1(\epsilon_1) \geq G_2(\epsilon_2) \geq \cdots \geq G_K(\epsilon_K),

then Rdpc(ρ,ϵ‾)\mathcal{R}^\mathrm{dpc}(\rho,\underline{\epsilon}) is the boundary of the ϵ‾\underline{\epsilon}-outage capacity region Cout(ρ,ϵ‾)\mathcal{C}^\mathrm{out}(\rho,\underline{\epsilon}).

The conjecture extends the established two-user comparison between DPC and time division to the general KK-user quasi-static fading broadcast channel. Its motivation is that, after replacing each fading gain by its outage quantile and ordering the decoders by these gains, the DPC region coincides with the capacity region of the corresponding degraded broadcast channel without fading. The supplied text gives no resolution, so the conjecture is recorded as open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.