Achievability of symmetric capacity via equal-amplitude diagonal entries

About 12 years old · traced to

Let K≥2K\geq 2 and let PP denote the common SNR of a symmetric KK-user Gaussian multiple access channel. For real numbers β2,…,βK\beta_2,\ldots,\beta_K satisfying ∣βk∣≥1|\beta_k|\geq 1, let L~\tilde{L} be the matrix defined in the source. The condition of equal-amplitude diagonal entries is

∣L~kk∣=∣L~jj∣for all k,j.|\tilde{L}_{kk}|=|\tilde{L}_{jj}|\quad\text{for all }k,j.

Achievability conjecture. There exists a positive number P∗(K)P^*(K) such that, for every P≥P∗(K)P\geq P^*(K), one can choose real numbers β2,…,βK\beta_2,\ldots,\beta_K with ∣βk∣≥1|\beta_k|\geq 1 so that the diagonal entries of L~\tilde{L} have equal amplitude.

The equal-amplitude condition is the condition used in the paper to achieve the symmetric capacity. The preceding discussion notes that the two-user case requires P≥1.5P\geq 1.5, while the general threshold is not determined in the source.

References

Primary source

Jingge Zhu and Michael Gastpar, “Gaussian Multiple Access via Compute-and-Forward”, arXiv:1407.8463 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.