Majid Nasiri Khormuji

Cooperative transmission based on decode-and-forward relaying with partial repetition coding

We propose a novel half-duplex decode-and-forward relaying scheme based on partial repetition coding at the relay. In the proposed scheme, if the relay decodes the received message successfully, it re-encodes the message using the same channel code as the one used at the source, but retransmits only a fraction of the codeword. We analyze the proposed scheme and optimize the cooperation level (i.e., the fraction of the message that the relay should transmit). We compare our scheme with conventional repetition in which the relay retransmits the entire decoded message, with parallel coding, and additionally with dynamic decode-and-forward (DDF). We provide a finite-SNR analysis for all the collaborative schemes. The analysis reveals that the proposed partial repetition method can provide a gain of several dB over conventional repetition. It also shows that in general, power allocation is less important provided that one optimally allocates bandwidth. Surprisingly, the proposed scheme is able to achieve the same performance as that of parallel coding for some relay network configurations, but at a much lower complexity.

Improving Collaborative Transmit Diversity by Using Constellation Rearrangement

The paper proposed an enhancement to cooperative transmit diversity based on uncoded detect-and-forward, by using so-called constellation rearrangement (CR) at the relay. With CR, the relay uses a bit-symbol mapping that is different from the one used by the source. The authors find the optimal bit-symbol mappings for both the source and the relay and the associated optimal detectors, and show that the improvement over conventional relaying with Gray mapping at the source and the relay can amount to a power gain of several dB. This performance improvement comes at no additional power or bandwidth expense, and at virtually no increase in complexity.

On Instantaneous Relaying

The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) is investigated. For such channels, linear relaying is a suboptimal strategy in general. This is because a linear scheme merely repeats the received noisy signal and does not utilize the available degrees of freedom efficiently. At this background, nonlinear, symbol-wise (as opposed to block-wise) relaying strategies are developed to compensate for the shortcomings of the linear strategy. Optimal strategies are presented for two special cases of the general scenario, and it is shown that memoryless relaying can achieve the capacity. Furthermore, for the general Gaussian relay channel, a parametric piecewise linear (PL) mapping is proposed and analyzed. The achievable rates obtained by the PL mapping are computed numerically and optimized for a certain number of design parameters. It is concluded that optimized PL relaying always outperforms conventional instantaneous linear relaying (amplify-and-forward). It is also illustrated that the proposed PL relaying scheme can improve on sophisticated block Markov encoding (i.e., decode-and-forward) when the source-relay link is ill-conditioned (relative to other links). Furthermore, PL relaying can work at rates close to those achieved by side-information encoding (i.e., compress-and-forward), but at a much lower complexity.

Rate-Optimized Constellation Rearrangement for the Relay Channel

We study the instantaneous relay channel where the relays output only depends on the current received signal at the relay. We propose a novel forwarding strategy for this class of relay channels which can outperform amplify-and-forward, detect- and-forward and estimate-and-forward. The proposed scheme is based on a remapping of the signal constellation at the relay.

Receiver Design for Wireless Relay Channels with Regenerative Relays

We develop a general framework for design of receivers for the wireless relay channel. We derive the optimum detectors for various degrees of channel state information (CSI) at the destination. We consider both the case when the destination has access to full knowledge of the CSI and the case when it only knows the statistics of the channel. High-SNR and low-SNR approximations of the detectors are presented as well.

Optimized analog network coding strategies for the white Gaussian multiple-access relay channel

We consider a Gaussian multiple-access relay channel with multiple sources, a relay and a destination. We assume that the received signals at the relay and the destination from different nodes are orthogonal. Additionally, we assume that the relay performs an instantaneous mapping to compress all received signals from different sources into one output symbol. We refer to this as analog network coding. We optimize the analog network coding mapping to maximize the achievable sum rate. We additionally introduce an algorithm to obtain an achievable rate region. The optimized mappings are in general non-linear and provide superior rates compared to those of linear mappings.

Rotation Optimization for MPSK/MQAM Signal Constellations Over Rayleigh Fading Channels

The performance of uncoded phase-shift-keying (PSK) and quadrature amplitude modulation (QAM) schemes over fading channels can be improved by using coded modulation techniques. Improvement is due to the coding gain coupled with interleaving and depends on the complexity of the code. Recently, it was shown that constellation rotation coupled with interleaving can be used to improve the performance of QPSK modulation over block-fading single-input-single-output (SISO) wireless communication channels. This paper considers the use of such a scheme with higher order constellation sets such as 8PSK and 16QAM. A framework is then presented for the calculation of the optimum rotation angle for MPSK/MQAM schemes. A simple cost function based on the union bound of the symbol error probability (SEP) is defined. The optimum rotation angle is then found by minimizing the cost function using the gradient search algorithm. The obtained simulation results show considerable improvement over the conventional unrotated system

On the capacity of molecular communication over the AIGN channel

We study a memoryless molecular communication channel with an additive inverse Gaussian noise (AIGN). We assume that information are encoded in the release time of molecules and the arrival time of the transmitted molecules at the receiver is the release time plus a propagation delay. Motivated by the Brownian motion, the propagation delay is modelled as an inverse Gaussian random variable. Lower- and upper bounds on the capacity are presented. In particular, we develop simple capacity expressions for cases either when the molecules have a high drift velocity or when the medium has a low diffusion coefficient.

Interference Management Using Nonlinear Relaying

We consider the three-node Gaussian relay channel where the relay observes a noisy version of the interference present in the source--destination link. We investigate three fundamental relaying approaches: linear relaying, memoryless nonlinear relaying, and compress-and-forward (CF). For interference-limited cases, we illustrate that optimized memoryless nonlinear relaying almost achieves the capacity.

The relay channel with partial causal state information

We investigate the relay channel with a random parameter whose causal knowledge is available partially at the source, the relay and the destination. We define four different classes of this scenario and establish lower and upper bounds on the resulting capacity. We also show that the bounds are tight in some cases.