|
Problemy Peredachi Informatsii, 2014, Volume 50, Issue 2, Pages 20–30
(Mi ppi2137)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Information Theory
On the capacity of a multiple-access vector adder channel
A. A. Frolov, V. V. Zyablov Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
We investigate the capacity of the $Q$-frequency $S$-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the conditions $Q\to\infty$, $S=\gamma Q$, $0<\gamma<\infty$) upper and lower bounds on the relative (per subchannel) capacity are derived. The lower bound for the coordinated case is shown to increase with $\gamma$. At the same time, the relative capacity for the uncoordinated case is upper bounded by a constant.
Received: 25.09.2013 Revised: 27.02.2014
Citation:
A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Probl. Peredachi Inf., 50:2 (2014), 20–30; Problems Inform. Transmission, 50:2 (2014), 133–143
Linking options:
https://www.mathnet.ru/eng/ppi2137 https://www.mathnet.ru/eng/ppi/v50/i2/p20
|
Statistics & downloads: |
Abstract page: | 429 | Full-text PDF : | 97 | References: | 69 | First page: | 17 |
|