The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As the spectral efficiency of wireless communications systems increases, and the frequency reuse pattern shifts towards universal frequency reuse, the capacity of future wireless and mobile systems will becomes interference limited. We explore the interference pattern of a shared channel in order to establish optimal distributed resource allocation techniques in that channel considering the mutual...
A bound on the capacity of the causal dirty paper problem with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise the capacity is upper bounded by log2 (1 + (SNR)/e) bits per real dimension. This bound is useful for SNR ≤ e(e - 2).
Genie based arguments are used to derive new outer bounds on the sum capacity of the two user, symmetric three user, one-to-many and many-to-one Gaussian interference channels. Using these bounds, it is shown that treating interference as noise achieves the sum capacity in a low interference regime, where the interference parameters are below certain thresholds.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.