750 research outputs found

    Energy-Efficient Cooperative Protocols for Full-Duplex Relay Channels

    Full text link
    In this work, energy-efficient cooperative protocols are studied for full-duplex relaying (FDR) with loopback interference. In these protocols, relay assistance is only sought under certain conditions on the different link outages to ensure effective cooperation. Recently, an energy-efficient selective decode-and-forward protocol was proposed for FDR, and was shown to outperform existing schemes in terms of outage. Here, we propose an incremental selective decode-and-forward protocol that offers additional power savings, while keeping the same outage performance. We compare the performance of the two protocols in terms of the end-to-end signal-to-noise ratio cumulative distribution function via closed-form expressions. Finally, we corroborate our theoretical results with simulation, and show the relative relay power savings in comparison to non-selective cooperation in which the relay cooperates regardless of channel conditions

    Symbol-Level Selective Full-Duplex Relaying with Power and Location Optimization

    Get PDF
    In this paper, a symbol-level selective transmission for full-duplex (FD) relaying networks is proposed to mitigate error propagation effects and improve system spectral efficiency. The idea is to allow the FD relay node to predict the correctly decoded symbols of each frame, based on the generalized square deviation method, and discard the erroneously decoded symbols, resulting in fewer errors being forwarded to the destination node. Using the capability for simultaneous transmission and reception at the FD relay node, our proposed strategy can improve the transmission efficiency without extra cost of signalling overhead. In addition, targeting on the derived expression for outage probability, we compare it with half-duplex (HD) relaying case, and provide the transmission power and relay location optimization strategy to further enhance system performance. The results show that our proposed scheme outperforms the classic relaying protocols, such as cyclic redundancy check based selective decode-and-forward (S-DF) relaying and threshold based S-DF relaying in terms of outage probability and bit-error-rate. Moreover, the performances with optimal power allocation is better than that with equal power allocation, especially when the FD relay node encounters strong self-interference and/or it is close to the destination node.Comment: 34 pages (single-column), 14 figures, 2 tables, accepted pape

    Diversity-Multiplexing Tradeoffs in MIMO Relay Channels

    Full text link
    A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol is needed to achieve the optimal DMT if the relay is constrained to half-duplex operation. For the latter case, static protocols are considered as well, and the corresponding achievable DMT performance is characterized.Comment: To appear at IEEE Global Communications Conf. (Globecom), New Orleans, LA, Nov. 200

    Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective

    Full text link
    We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or non-clustered). We first study the multiple antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link is increased, whereas CF continues to perform optimally. We also study the multiple antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the idealistic assumption of full-duplex relays and a clustered network, this virtual multi-input multi-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on Information Theory, version 2: Final version, to appear IEEE IT, title changed, extra figures adde

    On the Outage Probability of the Full-Duplex Interference-Limited Relay Channel

    Get PDF
    In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and interfering users are distributed as a Poisson point process. In this case, the asymptotic error probability is upper bounded by the outage probability (OP). We investigate the outage behavior for well-known cooperative schemes, namely, decode-and-forward (DF) and compress-and-forward (CF) considering fading and path loss. For DF we determine the exact OP and develop upper bounds which are tight in typical operating conditions. Also, we find the correlation coefficient between source and relay signals which minimizes the OP when the density of interferers is small. For CF, the achievable rates are determined by the spatial correlation of the interferences, and a straightforward analysis isn't possible. To handle this issue, we show the rate with correlated noises is at most one bit worse than with uncorrelated noises, and thus find an upper bound on the performance of CF. These results are useful to evaluate the performance and to optimize relaying schemes in the context of full-duplex wireless networks.Comment: 30 pages, 4 figures. Final version. To appear in IEEE JSAC Special Issue on Full-duplex Wireless Communications and Networks, 201
    • …
    corecore