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 generic relay system for small cells. The main features include the selection decode-and-forward (DF) scheme, Rician and Rayleigh fading, single or repeated transmissions in direct link, and maximal-ratio combining at destination. We are able to derive a set of closed-form expressions for the end-to-end performance. Based on these formulas, we define...
This paper considers the layered transmission between the source and the destination over two relays using super-position coding (SC). In this two-hop decode-and-forward (DF) relaying system, because of the network topology, the receiver continuously decodes only the base layer of the direct transmission from the source; the enhancement layer is decoded with a delay based on the transmission from...
This paper proposes Raptor codes-structured wireless super-dense networks serving a massive number of users with passive nodes constructing a precode of Raptor codes for future wireless networks. Passive nodes do not have their own information and only forward information from the neighboring nodes to the destination node. Similar to the capability of precode of Raptor coding scheme to protect information...
In this paper wireless communications network is considered to transmit source information to destination. N number sources transmitting data to a destination receiver, through M relays nodes by employing random linear network coding (RLNC). Two methods of failure decoding probability on performance of wireless communication are explained and discussed in this paper. The major parameter that will...
Interference forwarding by a relay enhances the interference level and enables the cancellation of the interference. If the interfering source to relay link is not strong, then the relay can decode a part of the interference and forward it to the destination, and the destination can cancel only that part of the interference. It is known as partial decode-and-forward (PDF) and partial interference...
In this paper, we investigate the physical-layer network coding (PNC) scheme based on successive interference cancellation (SIC) in multi-way relay channels (MWRC). We consider a scenario where all users simultaneously transmit signals to the relay in the up-link stage while the relay broadcasts a coded message in the down-link stage. In order to extract the network codes from superimposed signals...
We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users' codebooks, i.e., they perform oblivious processing. The destination, or central processor, however, is...
Previous approaches to compute-and-forward (C&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperform...
Uplink and downlink cloud radio access networks are modeled as two-hop K-user L-relay networks, whereby small base-stations act as relays and are connected to a central processor via orthogonal links of finite capacity. Simplified versions of noisy network coding and distributed decode-forward are used to establish inner bounds on the capacity region for uplink and downlink communications, respectively...
The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower bound is achieved by Marton's coding which facilitates dependence among the multiple-access channel inputs. The upper bound uses Ozarow's technique to augment the system with an auxiliary random variable. The bounds are...
To achieve strong coordination in a network, nodes benefit from access to a source of common randomness. Most studies pertaining to strong coordination assume the existence of a source of common randomness accessible to all nodes in the network. This assumption, however, is not practical in a decentralized network. We analyze the problem of strong coordination in a three-terminal line network with...
We study a two-hop cache-aided network, where a layer of relay nodes connects a server and a set of end users, i.e., a combination network. We consider the case where both the relay nodes and the end users have caching capabilities. We provide upper and lower bounds which are applicable to any combination network, noting that previous work had focused on models where the relays do not have caches...
Relay selection is a simple yet effective means to improve the reliability and coverage of wireless cooperative networks. However, it suffers from inefficient use of the available bandwidth resources. This paper introduces the use of content caching at relays in order to tackle this problem and improve the performance of relay selection. Three cache placement schemes are considered: one based on the...
We consider two-user relay-aided uplink nonorthogonal multiple access (NOMA) with noisy network coding (NNC) at the relay. The NNC-based cooperation strategy at the relay relies on noisy quantization followed by joint source-channel coding, while at the destination it utilizes joint decoding using the non-orthogonal signals received from the sources and the relay. After presenting the information...
In this paper, we propose a design of spatially coupled repeat-accumulate (SC-RA) codes over a three-phase bidirectional relay. The channels between the nodes are assumed binary input additive white Gaussian noise (BIAWGN) channels, while decode-and-forward (DF) relaying is considered at the relay. We present low complexity density evolution analysis for the proposed bidirectional relay code, which...
We consider a multiple access relay channel (MARC) network consisting of two sources, one relay, and one common destination applying compute-and-forward (CF) strategy. We show that the direct application of CF to the MARC network results in poor error performance bounded by (p + 1)−1, the probability of rank deficiency of the coefficient matrix over Fp. To solve this problem, we propose two practical...
This paper is concerned with practical quantizer design for Compress-and-Forward (CF) in combination with Orthogonal Frequency Division Multiplexing (OFDM) in the 3-node relay channel. The Information Bottleneck (IB) method is an appropriate tool for this task as it maximizes relevant information given a specific restriction on the rate. Optimal quantization is not possible due the high complexity...
In this paper we propose a two-way spectrum sharing protocol for the overlay cognitive radio network consisting of two primary users (PUs) and two secondary users (SUs). One of the SUs acts as a relay to assist the communication between the PUs while at the same time allowing for two-way transmission with the other SU. The communication process is done in two phases. In the first phase, the PUs and...
We study the problem of joint information and energy transfer in a two-hop channel with a Radio frequency (RF) energy harvesting relay. We consider a finite battery size at the relay and deterministic energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory...
A relay assisted system using Hybrid-STBC-VBLAST for Multiple Access Channel (MAC) is proposed in this paper. The proposed system encodes information at handsets of multiple users using Space Time Block Coding (STBC); decodes and re-encodes using Hybrid-STBC-VBLAST at relay; and decodes using Maximum-likelihood (ML) at destination. The results are evaluated for 4 to 8 transmit antennas of relay and...
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.