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 study the long-term throughput performance of repetition protocols coupled with power control for multiple access block-fading channels. We propose to use the feedback bits to inform the transmitter about the decoding status and the instantaneous channel quality. We determine the throughput of simple and practically inspired protocols; we show remarkable throughput improvements, especially...
In wireless X networks where all transmitters send the independent messages to all receivers, the theoretical degrees of freedom (DOF) and interference alignment (IA) scheme for its achievability are given by Cadambe and Jafar. However, IA scheme for wireless X network may be infeasible in practice unless the transmitters have the perfect channel information. In addition, if the transmitter with single...
In this paper, we introduce a low overhead scheme for the uplink channel allocation within a single cell of Cognitive Radio Wireless Mesh Network (CR-WMNs). The scheme does not rely on using a Common Control Channel (CCC). The mechanism is based on Physical layer Network Coding (PNC), in which two Secondary Users (SUs) are allowed to transmit synchronously over a randomly selected channel from a set...
In this paper, we will analyze how different amount of receiver side information (RSI) available at the receivers of a broadcast channel will affect the overall network throughput. Two transmission schemes, namely random linear network coding (RLNC) and round robin scheduling (RRS), are considered. Taking into account the differing amount of RSI available at each receiver, closed-form expressions...
In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete memoryless case: simultaneous encoding for the sub-messages in the first one and superposition encoding in the second one, both with rate splitting and Gel'fand-Pinsker...
The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is strong, the capacity region is obtained for both the discrete memoryless channel and Gaussian channel. A boundary point of the capacity region...
We consider the joint source-channel coding problem of sending a Gaussian source over a single input-single output (SISO) fading channel when the decoder has additional correlated side information whose quality is also time-varying. We assume a block fading model for both the channel and side information qualities, and assume perfect state information at the receiver, while the transmitter has only...
Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be greatly improved if the bit-level interleaver takes a trivial form (BICM-T), i.e., if it does not interleave the bits at all. The reported gains reach a few decibels and are obtained using a less complex BICM system. In this paper, we give a formal explanation...
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.