Computer Science – Information Theory
Scientific paper
2010-01-23
Computer Science
Information Theory
Submitted to ISIT 2010
Scientific paper
It is known that the capacity of parallel (e.g., multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. Recent results have shown that parallel interference channels are not separable, i.e., joint coding is needed to achieve capacity in general. This work studies the separability, from a sum-capacity perspective, of single hop Gaussian interference networks with independent messages and arbitrary number of transmitters and receivers. The main result is that the only network that is always (for all values of channel coefficients) separable from a sum-capacity perspective is the MAC-Z-BC network, i.e., a network where a MAC component and a BC component are linked by a Z component. The sum capacity of this network is explicitly characterized.
Cadambe Viveck R.
Jafar Syed A.
No associations
LandOfFree
Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-514827