Multiple-access relaying with network coding: iterative network/channel decoding with imperfect CSI
TL;DR: Two joint network/channel decoding algorithms, which take into account possible decoding error at the relay, are developed in both DF and DMF relay protocols and a practical method to forward the relays error characterization to the destination (quantization of the BER) is proposed.
read more
Abstract: In this paper, we study the performance of the four-node multiple-access relay channel with binary Network Coding (NC) in various Rayleigh fading scenarios. In particular, two relay protocols, decode-and-forward (DF) and demodulate-and-forward (DMF) are considered. In the first case, channel decoding is performed at the relay before NC and forwarding. In the second case, only demodulation is performed at the relay. The contributions of the paper are as follows: (1) two joint network/channel decoding (JNCD) algorithms, which take into account possible decoding error at the relay, are developed in both DF and DMF relay protocols; (2) both perfect channel state information (CSI) and imperfect CSI at receivers are studied. In addition, we propose a practical method to forward the relays error characterization to the destination (quantization of the BER). This results in a fully practical scheme. (3) We show by simulation that the number of pilot symbols only affects the coding gain but not the diversity order, and that quantization accuracy affects both coding gain and diversity order. Moreover, when compared with the recent results using DMF protocol, our proposed DF protocol algorithm shows an improvement of 4 dB in fully interleaved Rayleigh fading channels and 0.7 dB in block Rayleigh fading channels.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributed Spatial Modulation: A Cooperative Diversity Protocol for Half-Duplex Relay-Aided Wireless Networks
TL;DR: It is mathematically proved that DSM allows the source to achieve second-order diversity and compared against state-of-the-art cooperative protocols, it is shown to provide a better error probability.
61
On the Achievable Diversity of Repetition-Based and Relay Selection Network-Coded Cooperation
TL;DR: This paper provides a mathematical framework for the analysis, design, and optimization of network-coded cooperative diversity (NCCD) protocols and concludes that repetition- based NCCD protocols are capable of achieving full-diversity under more restrictive assumptions than repetition-based protocols.
24
Performance Analysis of Network Coded Cooperation with Channel Coding and Adaptive DF-Based Relaying in Rayleigh Fading Channels
TL;DR: A near-optimal receiver is proposed that performs network decoding and channel decoding in a single decoding step of an equivalent super code and an upper bound and a tight approximation of the Bit Error Rate for all sources are derived.
Finite-SNR analysis for partial relaying cooperation with channel coding and opportunistic relay selection
TL;DR: This paper studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination and proposes a novel partial relaying-based cooperation (PARC) scheme to improve the system diversity in the finite signal-to-noise ratio (SNR) regime.
•Dissertation
Joint Network/Channel Decoding over Noisy Wireless Networks
Xuan Thang Vu
- 14 Jan 2014
TL;DR: It is shown that with a proper Convolutional Code (CC), partial relaying can achieve full diversity gain and same coding gain as the classical (full) relaying protocol in finite signal-to-noise ratio region while it obtains a better spectrum usage.
1
References
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
13.5K
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
6.8K
•Journal Article
Optimal decoding of linear codes for minimizing symbol error rate
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of Markov source observed through a discrete memoryless channel is considered.
6.8K
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
5.1K