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.
In this paper, we investigate the performance of a symmetric two-user interference channel with a full-duplex relay (IFRC) from the perspective of diversity-multiplexing tradeoff (DMT). The sources and destinations are all assumed to be equipped with single antenna and the relay is equipped with multiple antennas. We first find a DMT upper bound of the channel by using a channel capacity upper bound...
In this paper, we propose a transmission scheme for the two-user symmetric multiple antenna interference channel (IFC) and show that the proposed transmission scheme can achieve the optimal diversity-multiplexing tradeoff (DMT) of the channel. The proposed transmission scheme requires only limited channel state information at the transmitter (CSIT) and is suitable for practical implementation. The...
In this paper, we investigate the diversity-multiplexing tradeoff (DMT) of the delay-limited symmetric two-user fading interference channel (IFC) with full-duplex source cooperation. Upper and lower bounds on the channel DMT are derived and shown to be tight, i.e., the lower bound meets the upper bound. The DMT behavior of the channel is thus fully determined. The upper bound is derived based on a...
In this paper, diversity-multiplexing tradeoff (DMT) of two-user interference channels with source cooperation is studied. A DMT upper bound is derived based on a capacity upper bound. The tightness of the upper bound is evaluated using an achievable DMT derived from a decode-and-forward (DF) based cooperation scheme. We show that in some channel scenarios, the upper bound can be achieved by the DF-based...
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.