Dynamic Selective Decode and Forward in wireless relay networks

In this paper, we investigate the benefit of Joint Network Channel Coding (JNCC) for a new class of Multiple Access Relay Channel (MARC), defined as follows: (1) Independent sources communicate with a single destination in the presence of a relay; (2) The relay is half-duplex and applies a Selective Decode and Forward (SDF) strategy, i.e, it forwards only a deterministic function of the error-free decoded messages; (3) The sources are allowed to transmit simultaneously during the listening phase of the relay, but are constrained to remain silent during its transmission phase. We refer this model to as Semi-Orthogonal MARC (SOMARC), which leverages better the broadcast nature of the radio channel than its more conservative orthogonal counterpart, referred to as Orthogonal MARC (OMARC). All links are subject to slow fading and additive white Gaussian noise. This paper aims at measuring the advantage brought by the SOMARC over OMARC from both an information-theoretic and a practical code design perspective.

In this paper, we investigate the benefit of Joint Network Channel Coding (JNCC) for a new class of Multiple Access Relay Channel (MARC), defined as follows: (1) Independent sources communicate with a single destination in the presence of a relay; (2) The relay is half-duplex and applies a Selective Decode and Forward (SDF) strategy, i.e, it forwards only a deterministic function of the error-free decoded messages; (3) The sources are allowed to transmit simultaneously during both the listening phase and the transmission phase of the relay. We refer this model to as Non-Orthogonal MARC (NOMARC), which better leverages the broadcast nature of the radio channel than its more conservative orthogonal counterpart, i.e., Orthogonal MARC (OMARC). This paper aims at measuring the advantage brought by NOMARC/JNCC over OMARC/JNCC from both an information-theoretic and a practical code design perspectives.

In wireless communication systems, the intended receiver is able to obtain the perfect channel state information (CSI) as long as the training sequence is sufficiently long, and then through a quantized feedback channel (QFC), the transmitter gets imperfect CSI caused by the quantized noise. In general, the design of efficient coding schemes for wireless channels with imperfect CSI at the transmitter (I-CSIT) is difficult and challenging, and one possible method is to construct such a scheme by using channel feedback. In the literature, it has already been shown that the classical Schalkwijk-Kailath (SK) scheme for the additive white Gaussian noise (AWGN) channel with noiseless feedback is a highly efficient coding scheme since its coding complexity is extremely low and the decoding error doubly exponentially decays as the coding blocklength tends to infinity. Existing SK-type schemes mainly focus on the case that perfect CSI is known at the transceiver, and adopt modulo lattice function to eliminate the impact of feedback channel noise (often considered as AWGN) on the performance of SK-type schemes. However, for channels with I-CSIT and QFC, this does not work since the distribution of quantized noise is unknown and I-CSIT brings additional non-convergence estimation error to the transceiver, leading to the application of SK-type schemes to practical wireless scenarios becomes challenging. In this paper, first, for the quasi-static fading channel with I-CSIT and QFC, we design a modulo lattice based SK-type scheme where the receiver adopts an auxiliary signal to decode the message, and numerical results show that the rate of our scheme almost approaches that of the same model with perfect CSI at the transceiver and noise-free feedback for some cases. Next, we further extend the above scheme to the two-path fading scenario, which is modeled as the two-ray channel with I-CSIT and QFC. Treating the signal of the second path as a relay, our extended scheme combines the amplify-and-forward relay strategy and the previously proposed scheme for the same model without ISI. However, this extended scheme cannot be applied to multi-path fading scenario, to this end, we propose a new SK-type scheme for the multi-path fading case. The intuition behind this scheme is to transform the multi-path fading channel into a fading MIMO channel by discrete fourier transform (DFT), and then apply the SK-type scheme to the MIMO channel in frequency domain and use inverse DFT to obtain the codeword in time domain. The study of this paper may provide a way to design efficient coding scheme for fading channels in the presence of imperfect CSI and quantized feedback.

In this paper, an efficient QoS aware resource allocation algorithm is proposed for wireless relay networks. This algorithm is yielded by considering G/G/1 queue for each subcarrier and using effective capacity concept to model the transmission delay in wireless relay networks. The objective is to minimize the transmission power considering support of QoS parameters. The constant user arrival rate is assumed throughout the paper. An extended Kalman filter also is used to estimate the residual times and vacation times of the relays and subcarriers. Based on the channel state information and queue state information, proposed algorithm assigns proper subcarriers to the relays. Then, the optimum subcarriers and relays are allocated for optimum power efficient transmission to the users.

This paper addresses channel state information (CSI) estimation in a wireless relay network, which consists of a base station (BS), a relay station (RS), and a mobile station (MS). We propose a method for the BS to obtain the instantaneous CSIs of the three links (BS-RS, BS-MS, and RS-MS links) with minimized overhead. The CSI availability plays an important role for the BS to adapt its transmission strategies to the given channel conditions. Our proposed method exploits the fact that the link condition between fixed BS and fixed RS tends to be stable, and the frequent CSI update is not necessary for this link. In order for the BS to obtain the CSI of the distant link (i.e. RS-MS link), RS amplifies a pilot signal received from MS with a pre-defined amplification factor, and forwards it to BS. This enables the BS to obtain the CSI of the RS-MS link based on the received pilot signal and pre-knowledge on the CSI of BS-RS link. We show by computer simulation that our proposed method can reduce the required overhead for CSI estimation with little degradation on the accuracy of the obtained CSI.

In this journal, we present a joint network/channel decoding (JNCD) algorithm for a wireless network that consists of M users. Previous works studied a small 2-user network. In our work, we consider a network that consists of M mobile station (MS), one relay (R) and one base station (BS). The network/coding process is done on the relay. In order to evaluate the performances ofJNCD,wewill fix another network which does not contain a relay. Then, the adopted reference chain will contain only M senders (MS) and one receiver (BS). The obtained results will be evaluated with a network simulator:Opnet Modeler. Then, we present two grouping algorithm: the first treat the impact of the number of nodes in each group in the network, and the second present the impact of transmission channel characteristics on node grouping.

We propose to use joint network-channel coding based on turbo codes for the multiple-access relay channel. Such a system can be used for the cooperative uplink for two mobile stations to a base station with the help of a relay. We compare the proposed system with a distributed turbo code for the relay channel and with a system which uses separate network-channel coding for the multiple-access relay channel. Simulation results confirm that the systems with network coding for the multiple-access relay channel gain cooperative diversity compared to the system with the distributed turbo code for the relay channel. Moreover, the results show that joint network-channel coding outperforms separate network-channel coding. The reason for this is that the redundancy which is contained in the transmission of the relay can be exploited more efficiently with joint network-channel coding

The design of trellis coded modulation (TCM) schemes for QAM constellations to counteract simultaneous flat fading and additive white Gaussian noise (AWGN) is considered. Motivated by the results of Divsalar and Simon (see IEEE Trans. Commun., vol.36, p.1004, 1988), and incorporating some recent ideas from Boulle and Belfiore (1992), we develop novel 2-D TCM schemes that attain diversity of order two even for a trellis structure that includes parallel paths with one symbol per edge. An algorithm is described that transforms codes designed for the AWGN channel into codes that achieve significant gains over flat fading channel, while preserving their coding gain over AWGN channel. Their performance is assessed via computer simulation for some representative TCM-QAM schemes under the assumption of uncorrelated fading and perfect channel state information (CSI). Finally, the effects of finite interleaving as well as imperfect CSI on code performance are investigated. >

In this paper, we investigate the capacity performance of non-orthogonal transmission schemes under imperfect channel state information (CSI) caused by feedback delay and thermal noise for various values of the signal to noise ratio (SNRinput). We use orthogonal transmission, i.e. singular value decomposition (SVD), as a benchmark. With perfect CSI, the multiplexing schemes achieve higher capacity than single data stream transmission under high SNRinput (30dB). In terms of the delayed CSI, the capacity of all multiplexing schemes converges and multiplexing schemes are only beneficial for large antenna systems (4times2) and high SNRinput (20dB). When the CSI is corrupted by thermal noise, a 20dB SNR can be tolerated in the CSI estimation.

In this letter, an AGV based relay selection mechanism is developed to ensure relays reporting true information in wireless relay networks. The source selects relays based on the channel state information (CSI) of relay-destination links. Selfish relays may report fake CSI in order to obtain a better chance of being selected, whereas the source is not able to tell the reported in real or in false. In the proposed scheme, a relay node receives some payoffs from the destination with respect to the achievable data rate and also some compensations from the others in terms of the reported CSI of all relays. This mechanism not only enforces truth-telling upon relay nodes with maximum payoff but also ensures fairness among them. The equilibrium of payoff is attained when relay nodes report their true CSI. Simulation results demonstrate the theoretical solutions.

ABSTRACTUser cooperation has evolved as a popular coding technique in wireless relay networks (WRNs). Using the neighboring nodes as relays to establish a communication between a source and a destination achieves an increase of the diversity order. The relay nodes can be seen as a distributed multi‐antenna system, which can be exploited for transmit diversity by using distributed space–time block coding (STBC). In this paper, we investigate the bit error rate (BER) of multi‐hop WRNs employing distributed STBC at the relay nodes. We develop the general model of WRNs using distributed STBC, and we derive the pairwise error probability and an approximation of the BER. We examine the impact of several parameters, such as distributed STBC at the relays, the number of relays, the distances between the nodes, and the channel state information available at the receivers, on the BER performance of the multi‐hop WRN. The obtained results provide guidelines about the expected error performance and the design of channel estimation for these networks. Copyright © 2011 John Wiley & Sons, Ltd.

We propose the Optimum Power Allocation (OPA) scheme for Distributed Antenna Systems(DAS) in the time-varying Rayleigh fading channel. Recently, the OPA schemes which uses the Channel State Information (CSI) including a small scale (fast) fading have been proposed. However, the channel is changing vary fast over time due to small scale fading, therefore Bit Error Rate (BER) increases. Because of this reason, we derive the OPA for minimizing BER in DAS, which only uses a large scale fading to CSI and excepts a small scale fading. The simulation results show that the proposed OPA achieves better BER performance than conventional OPA considering a small scale fading in time-varying Rayleigh fading channel, and also has similar performance in Rayleigh flat-fading environment. The BER performance of proposed OPA which derived in Rayleigh fading channel is similar to minimum BER of Ricean fading channel which has small Line-of-Sight (LOS).

Nowadays, the majority of new GNSS applications targets dynamic users in urban environments; therefore the decoder input in GNSS receivers needs to be adapted to the urban propagation channel to avoid mismatched decoding when using soft input channel decoding. The aim of this paper consists thus in showing that the GNSS signals demodulation performance is significantly improved integrating an advanced soft detection function as decoder input in urban areas. This advanced detection function takes into account some a priori information on the available Channel State Information (CSI). If no CSI is available, one has to blindly adapt the detection function in order to operate close to the perfect CSI case. This will lead to avoid mismatched decoding due to, for example, the consideration by default of the Additive White Gaussian Noise (AWGN) channel for the derivation of soft inputs to be fed to soft input decoders. As a consequence the decoding performance will be improved in urban areas. The expressions of the soft decoder input function adapted for an urban environment is highly dependent on the available CSI at the receiver end. Based on different model of urban propagation channels, several CSI contexts will be considered namely perfect CSI, partial statistical CSI and no CSI. Simulation results will be given related to the GPS L1C demodulation performance with these different advanced detection function expressions in an urban environment. The results presented in this paper are valid for any kind of soft input decoders, such as Viterbi decoding for trellis based codes, the MAP/BCJR decoding for turbo-codes and the Belief Propagation decoding for LDPC codes.

We propose to construct a joint channel-network coding (knosswn as Random Linear Coding) scheme based on improved turbo codes for the distributed storage in wireless communication network with k data nodes, s storage nodes (k<s) and a data collector. This framework extends the classical distributed storage with erasure channel to AWGN and fading channel scenario. We investigate the throughput performance of the Joint Channel-Network Coding (JCNC) system benefits from network coding, compared with that of system without network coding based only on store and forward (S-F) approach. Another helpful parameter: node degree (L) indicates how many storage nodes one data packet should fall onto. L characterizes the en/decoding complexity of the system. Moreover, this proposed framework can be extended to ad-hoc and sensor network easily.

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing tradeoff (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT optimality is that quantizing at the noise level suffices to achieve the cut-set bound approximately and hence the relay does not need any instantaneous channel state information (CSI). However, DMT only captures the high SNR performance and potentially, limited CSI at the relay can help improve the performance in moderate SNR regimes. In this work we propose an optimization framework for QMF relaying in slow fading relay channels. Focusing on vector Gaussian quantizers, for the full-duplex relay we optimize the outage probability by finding the best quantization level according to the available CSI at the relay and the channel statistics. For the half-duplex relay we find good relay schedules using the same framework. Numerical evaluations show the improvement of taking the CSI into account over noise-level quantization and static schedules in moderate SNR regimes.