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.
This paper considers a communication system where m synchronized transmitters access a shared medium independently of each other with probability p, and upon access each user transmits a signal subject to an average power constraint P. A common receiver observes the sum of the signals transmitted by the active users corrupted by additive Gaussian noise. Let the throughput denote the sum of the achievable...
Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call ??generation crossing??. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets...
This paper presents an achievable rate region for a 2-user Gaussian Z-interference channel with a noiseless and bidirectional digital communication link between the receivers. The region is achieved by utilizing the rate-splitting encoding technique, and the decode-and-forward and compress-and-forward strategies. In the very strong interference regime, the capacity region is achieved. In the weak...
In this paper, we consider the problem of functional compression for an arbitrary tree network. Suppose we have k possibly correlated source processes in a tree network, and a receiver in its root wishes to compute a deterministic function of these processes. Other nodes of this tree (called intermediate nodes) are allowed to perform some computations to satisfy the node's demand. Our objective is...
In this paper, we propose a new achievable rate for two-level relay networks by introducing a new strategy named simultaneous partial and backward decoding. In the proposed method, benefitting from regular encoding/backward decoding strategy, different message parts transmitted in the network are simultaneously decoded at the relays and the receiver. The proposed strategy is shown to achieve better...
This paper proposes two types of new decoding algorithms for a network coding aided relaying (NCR) system, which adopts multiple antennas at both the transmitter and receiver. In the NCR system, the relay station (RS) decodes the data received from both the base station (BS) as well as from the mobile station (MS) and combines the decoded signals into a single data stream before forwarding it to both...
We study a special class of diamond channels which was introduced by Schein in 2001. In this special class, each diamond channel consists of a transmitter, a noisy relay, a noiseless relay and a receiver. We prove the capacity of this class of diamond channels by providing an achievable scheme and a converse. The capacity we show is strictly smaller than the cut-set bound. Our result also shows the...
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.