Topic: Network Information Theory
By: Alex Reznik (Princeton), Sergio Verdu (Princeton), Sanjeev R. Kulkarni (Princeton)
We investigate the Shannon capacity region of multi-array networks. While the general problem is extremely difficult, it is possible to determine effective formulas for achievable rate regions and state converse theorems for specially structured sub-problems of the general problem. In particular, we concentrate on combining and extending well-known results for the basic broadcast, relay and multi-access channels. Where the capacity region is well established it is further possible to address problems of optimal resource allocation, such as, for example, optimizing the distance-bandwidth product, also referred to as the transport capacity. Such results are particularly interesting in the context of additive white Gaussian noise channels with a power-law signal strength degradation with distance.
Questions and comments to the webmaster. This page is copyrighted by the Massachusetts Institute of Technology.