Learn More
—A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression. The utility of the inner bound is demonstrated by examples(More)
Multi user multiple-input multiple-output (MIMO) systems provide high capacity with the benefits of space division multiple access. The channel state information at the base station (BS) or access point (AP) is very important since it allows joint processing of all users' signals which results in a significant performance improvement and increased data(More)
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region(More)
— We propose and parameterize an empirical model of the outdoor-to-indoor and indoor-to-indoor distributed (cooperative) radio channel, using experimental data in the 2.4 GHz band. In addition to the well-known physical effects of path loss, shadowing, and fading, we include several new aspects in our model that are specific to multiuser distributed(More)
— Since multi-antenna (MIMO) systems are becoming more popular thanks to their inherent potential for capacity improvement, interference from MIMO transceivers is an increasingly serious concern. Spatial multiplexing schemes are particularly vulnerable to multiuser interference. Fortunately, this interference can be mitigated, when the channel matrices show(More)
—Certain deterministic interference channels have been shown to accurately model Gaussian interference channels in the asymptotic low-noise regime. Motivated by this correspondence , we investigate a K user-pair, cyclically symmetric, deterministic interference channel in which each receiver experiences interference only from its neighboring transmitters(More)
—It is shown that simultaneous nonunique decoding is rate-optimal for the general K-sender, L-receiver discrete memoryless interference channel when encoding is restricted to randomly generated codebooks, superposition coding, and time sharing. This result implies that the Han–Kobayashi inner bound for the two-user-pair interference channel cannot be(More)