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.
We consider the Gaussian interference channel with an intermediate relay. The known achievable schemes for this channel are based on decode-and-forward (DF) relaying, whose performance depends on the signal-to-noise (SNR) ratio of the received signal at the relay. Consequently, when the source-to-relay (S-R) links are weak, the resulting achievable rates have room for improvement. In this work, we...
This paper analyzes Gaussian interference channels with more than two users and integer channel gains, and finds a new achievable set of rates using lattice codebooks. It combines lattices with alignment schemes inspired by the ones developed for degrees of freedom (DoF) analysis and shows that similar rate gains can be achieved for finite SNR interference networks as well. In essence, this work can...
This paper studies the K > 2 user cognitive radio network. In this paper, there are one licensed transmit-receive pair and K - 1 cognitive transmit-receive pairs wishing to communicate simultaneously. For the case of a class of ??very strong?? interference channels, this paper shows that all users can simultaneously communicate as if all cross-channels in the interference network were absent.
The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2) log2 P at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the degrees-of-freedom of three or more user, real, scalar GIFCs, viewed as a function of the channel coefficients, is discontinuous at points where all of the coefficients...
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.