Interference Relay Channel with Precoded Dynamic Decode and Forward Protocols

2011 ◽  
Author(s):  
M. Plainchault ◽  
N. Gresset ◽  
Ghaya Rekaya-Ben Othman
Keyword(s):  
Relay Channel ◽  
Decode And Forward

scholarly journals MmWave V2X Cooperative Diversity Relay Channel with Feedback Delay and Link Blockage

2021 ◽  
Author(s):  
Elyes Balti
Keyword(s):  
Cooperative Diversity ◽  
Signal To Noise Ratio ◽  
Base Station ◽  
Maximal Ratio Combining ◽  
High Signal ◽  
Relay Channel ◽  
Framework Analysis ◽  
Decode And Forward ◽  
Multiple Transmit ◽  
To Receive

In this work, we present a framework analysis of a millimeter wave (mmWave) vehicular communications systems. Communications between vehicles take place through a cooperative relay which acts as an intermediary base station (BS). The relay is equipped with multiple transmit and receive antennas and it employs decode-and-forward (DF) to process the signal. Also, the relay applies maximal ratio combining (MRC), and maximal ratio transmission (MRT), respectively, to receive and forward the signal.As the vehicles' speeds are relative high, the channel experiences a fast fading and this time variation is modeled following the Jake's autocorrelation model. We also assume narrowband fading channel. Closed-form expressions of the reliability metrics such as the outage probability and the mean rate are derived. Capitalizing on these performances, we derive the high signal-to-noise-ratio (SNR) asymptotes to get full insights into the system gains such as the diversity and coding gains.

scholarly journals AWGN and Rayleigh Fading Behavior of the Wireless Decode-and-Forward Relay Channel with Arbitrary Time and Power Allocation

2018 ◽  
Vol 10 (1) ◽  
pp. 248
Author(s):  
Muhammad Zarol Fitri Khairol Fauz ◽  
Elsheikh Mohamed Ahmed Elsheikh
Keyword(s):  
Mutual Information ◽  
Power Allocation ◽  
Fading Channels ◽  
Time Allocation ◽  
Rayleigh Fading ◽  
Cellular Systems ◽  
Base Stations ◽  
Relay Channel ◽  
Decode And Forward ◽  
Half Duplex

Relying has in use for decades to tackle some of the challenges of wireless communication such as extending transmitting distance, transmitting over rough terrains. Diversity achieved through relaying is also a means to combat the random behavior of fading channels. In this work, effect of time and power allocation on relay performance is studied. The channel considered is the three-node channel with half-duplex constraint on the relay. The relaying technique assumed is decode-and-forward. Mutual information is used as the criteria to measure channel performance. There is half-duplex constraint and a total transmission power constraint on the relay source node and the relay node. A model is established to analyze the mutual information as a function of time allocation and power allocation in the case of AWGN regime. The model is extended to the Rayleigh fading scenario. In both AWGN and Rayleigh fading, results showed that the importance of relaying is more apparent when more resources are allocated to the relay. It was also shown that quality of the source to destination link has direct impact on the decision to relay or not to relay. Relatively good source to destination channel makes relaying less useful. The opposite is true for the other two links, namely the source to relay channel and the relay to destination channel. When these two channels are good, relaying becomes advantageous. When applied to cellular systems, we concluded that relaying is more beneficial to battery-operated mobile nodes than to base stations.

scholarly journals Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

10.14311/1438 ◽  
2011 ◽  
Vol 51 (5) ◽  
Author(s):  
M. Hekrdla
Keyword(s):  
Optimization Problem ◽  
Practical Case ◽  
Relay Channel ◽  
Decode And Forward ◽  
Channel State ◽  
Wireless Network Coding ◽  
Non Linear ◽  
Frequency Modulations ◽  
Optimization Search ◽  
Uniformly Most Powerful

We address the issue of the parametric performance of the Hierarchical-Decode-and-Forward (HDF) strategy in a wireless 2-way relay channel. Promising HDF, representing the concept of wireless network coding, performs well with a pre-coding strategy that requires Channel State Information (CSI) on the transceiver side. Assuming a practical case when CSI is available only on the receiver side and the channel conditions do not allow adaptive strategies, the parametrization causes significant HDF performance degradation for some modulation alphabets. Alphabets that are robust to the parametrization (denoted Uniformly Most Powerful (UMP)) have already been proposed restricting on the class of non-linear multi-dimensional frequency modulations. In this work, we focus on the general design of unrestricted UMP alphabets. We formulate an optimization problem which is solved by standard non-linear convex constrained optimization algorithms, particularly by Nelder-Mead global optimization search, which is further refined by the local interior-pointsmethod.

scholarly journals A New Coding Paradigm for the Primitive Relay Channel

Algorithms ◽  
2019 ◽  
Vol 12 (10) ◽  
pp. 218 ◽  
Author(s):  
Marco Mondelli ◽  
S. Hamed Hassani ◽  
Rüdiger Urbanke
Keyword(s):  
Upper And Lower Bounds ◽  
Achievable Rate ◽  
Polar Codes ◽  
Relay Channel ◽  
Decode And Forward ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Polar Coding ◽  
Separate Channel ◽  
Special Case

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.

scholarly journals Combining Coded Signals with Arbitrary Modulations in Orthogonal Relay Channels

2008 ◽  
Vol 2008 ◽  
pp. 1-4 ◽  
Author(s):  
Brice Djeumou ◽  
Samson Lasaulce ◽  
Antoine O. Berthet
Keyword(s):  
Maximum Likelihood ◽  
Mean Square Error ◽  
Minimum Mean Square Error ◽  
Relay Channels ◽  
Mean Square ◽  
Relay Channel ◽  
Frequency Division ◽  
Decode And Forward ◽  
Convolutional Encoder

We consider a relay channel for which the following assumptions are made. (1) The source-destination and relay-destination channels are orthogonal (frequency division relay channel). (2) The relay implements the decode-and-forward protocol. (3) The source and relay implement the same channel encoder, namely, a convolutional encoder. (4) They can use arbitrary and possibly different modulations. In this framework, we derive the best combiner in the sense of the maximum likelihood (ML) at the destination and the branch metrics of the trellis associated with its channel decoder for the ML combiner and also for the maximum ratio combiner (MRC), cooperative-MRC (C-MRC), and the minimum mean-square error (MMSE) combiner.

Sign in / Sign up

Export Citation Format

Share Document