MIMO Gaussian Broadcast Channels with Confidential and Common Messages

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.Comment: Submitted to 2010 IEEE International Symposium on Information Theory, Austin, Texa

The MIMO wiretap channel

We study the MIMO wiretap channel, a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers. Our technique involves a careful study of a Sato-like upper bound via the solution of a certain algebraic Riccati equation

Mixed Delay Constraints at Maximum Sum-Multiplexing Gain

International audienceCoding schemes are proposed for Wyner's soft-handoff model and for the sectorized hexagonal model when some of the messages are delay-sensitive and cannot profit from transmitter or receiver cooperation. For the soft-handoff network we also provide a converse. It matches the multiplexing-gain achieved by our scheme when the multiplexing gain of the delay-sensitive messages is low or moderate or when the cooperation links have high capacities. In these cases, the sum-multiplexing gain is the same as if only delay-tolerant messages (which can profit from cooperation) were sent. A similar conclusion holds for the sectorized hexagonal model, when the capacities of the cooperation links are large