×

zbMATH — the first resource for mathematics

Duality, dirty paper coding, and capacity for multiuser wireless channels. (English) Zbl 1073.94512
Blaum, Mario (ed.) et al., Information, coding and mathematics. Proceedings of workshop honoring Professor Bob McEliece on his 60th birthday, Pasadena, CA, USA, May 24–25, 2002. Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-7079-9/hbk). The Kluwer International Series in Engineering and Computer Science 687, 239-256 (2002).
Summary: We determine a duality between broadcast and multiple access channels that can be used to obtain the capacity region and optimal transmission strategy for one channel based on the capacity-achieving transmission strategy and region for the dual channel. This duality result is applicable to additive Gaussian noise and fading channels for several different notions of fading channel capacity, including ergodic capacity, outage capacity, and minimum rate capacity. We show that duality can be used to obtain any of these capacities for the fading broadcast channel from the same capacity on the dual MAC channel, and vice versa. We then apply this general result to obtain the minimum rate capacity of the fading multiple access channel, which also yields the ergodic and outage capacity as special cases. Next we turn our attention to broadcast channels with multiple antennas at the transmitter and receiver (the MIMO channel). Since this channel is in general non-degraded, its capacity region remains an unsolved problem. We establish a duality between the achievable region of the MIMO broadcast channel using Costa’s “dirty-paper” coding and the capacity region of the MIMO multiple-access channel, which is easy to compute. We also show that the dirty paper achievable region yields the sum-rate capacity of the MIMO broadcast channel.
For the entire collection see [Zbl 1054.94001].
MSC:
94A40 Channel models (including quantum) in information and communication theory
94A24 Coding theorems (Shannon theory)
94A05 Communication theory
PDF BibTeX XML Cite