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 study the capacity of a class of deterministic discrete memoryless interference channels. Recent studies show that, in general, interference alignment is required to achieve capacity in interference channels. While interference alignment in general needs structured coding, we identify two scenarios where random coding achieves capacity and leads to single-letter capacity characterizations in deterministic...
Motivated by cognitive radio applications, we consider mitigating the effect of interference by exploiting known properties about its signal structure. Specifically, we analyze communication between a source and destination with an interferer that induces random variations in the source-destination channel. The interferer transmits a sequence chosen uniformly from a randomly generated codebook, which...
This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium (NE) game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the...
In this paper, we study bandwidth management of a wireless/optical based access/metro network in support of voice and data services. For voice services, we use a finite state Markov Chain to estimate the blocking probability of voice circuits over an Adaptive modulation and coding wireless channel, as a function of the channel parameters. For data services, we evaluate a rate matching and a buffer...
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.