Fading Correlations for Wireless Cooperative Communications: Diversity and Coding Gains

Qian, Shen; He, Jiguang; Juntti, Markku; Matsumoto, Tad

doi:10.1109/access.2017.2699785

Cited by 10 publications

(11 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rayleigh block fading. Extension to Nakagami-m fading and temporally and spatially correlated fading was investigated in [52], [53]. The brief summary of the related work on the one-way relay network can be found in Table III. In [41], the achievable rate region was first obtained by following the Slepian-Wolf theorem.…”

Section: One-way Relay Networkmentioning

confidence: 99%

“…BSC was utilized to characterize the S-R link and research was conducted to analyze the influence of source-relay correlation on the outage probability and diversity order [41]. Rayleigh block fading was assumed in many publications, e.g., [40], [41] for S-D and R-D links, and [25], [52] for all the links. Extension to Nakagami-m block fading was studied in [53].…”

Section: A Channel Typementioning

confidence: 99%

“…The crossover probability p represents the strength of the source-relay correlation. Two extreme cases are: 1) p = 0 stands for full correlation, [25], [40], [41], and (c) Exact rate region derived from the theorem for source coding with a helper [25], [52], [53].…”

Section: A Channel Typementioning

confidence: 99%

“…Assuming that the S-D and R-D links can support the rates R 1 and R 2 , respectively, the achievable rate regions considered in [25], [40], [41], [52], [53] are shown in Fig. 7, where u 1 denotes the binary uniformly distributed information sequence from the source, u 2 denotes the decoded binary information sequence at the relay, and the correlation information between u 1 and u 2 is p.…”

Section: B Achievable Rate Region Analysismentioning

confidence: 99%

See 3 more Smart Citations

A Tutorial on Lossy Forwarding Cooperative Relaying

Tervo

Zhou

et al. 2019

IEEE Commun. Surv. Tutorials

Self Cite

View full text Add to dashboard Cite

Lossy decode-and-forward (DF) relaying, also referred to as lossy forwarding (LF), can significantly enhance the transmission reliability and expand the communication coverage at the cost of a small increase in computational effort compared to its DF counterpart. Furthermore, it can further simplify the operations at the relay nodes by removing the error-detecting operation, e.g., cyclic redundancy check, which is used in the conventional DF systems. Due to these advantages, LF has been intensively investigated with the aim of its applications to various cooperative communication networks with different topologies. This paper offers a comprehensive literature review on the LF relaying strategy and makes comparisons between LF and DF. Five basic exemplifying scenarios are taken into consideration. These are the three-node network, the single-source multi-relay network with direct source-to-destination link, the multiple access relay channel, the two-way relay network, and the general multi-source multi-relay network. The paper includes not only theoretical performance limit analyses, but also performance evaluation by employing low-complexity accumulator aided turbo codes at the sources and relays as well as joint decoding at the destination. As expected, the performance enhancement in terms of outage probability, frame error rate, and-outage achievable rate by LF over DF is significant, which is demonstrated in

show abstract

Section: One-way Relay Networkmentioning

confidence: 99%

Section: A Channel Typementioning

confidence: 99%

Section: A Channel Typementioning

confidence: 99%

Section: B Achievable Rate Region Analysismentioning

confidence: 99%

See 2 more Smart Citations

A Tutorial on Lossy Forwarding Cooperative Relaying

Tervo

Zhou

et al. 2019

IEEE Commun. Surv. Tutorials

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [2], a novel lossy-forward (LF) relaying scheme, which was developed based on the DF relaying, has been proposed. The basic idea behind the LF relaying is the relay system, as a whole, can be seen as a distributed turbo code, and hence it can achieve turbo-cliff-like bit-error-rate (BER) performance in additive white Gaussian noise (AWGN) channels [3]. Prior studies on the LF relaying only focus on one-way relaying, and TW with the LF relaying has not been considered.…”

Section: Introductionmentioning

confidence: 99%

Performance analysis for two-way lossy-forward relaying with random Rician K-factor

Qian

Juntti

et al. 2017

IEICE ComEX

Self Cite

View full text Add to dashboard Cite

A novel lossy-forward (LF) cooperative communication scheme based on the decode-and-forward (DF) protocol allowing source-relay link errors is proposed recently. The LF relaying scheme always allows the relay to forward the decoded information to the destination even though it may contain errors. The knowledge of the correlation between received information sequences is exploited in the decoding process at the destination to improve the system performance. In this paper, we derive exact expressions of the outage probability upper bound for a two-way LF relay system over Rician fading channels with random K-factor. The K-factor follows empirical distributions derived from measurement data. It is found that the two-way relaying with LF is superior to that with DF scheme in terms of the outage performance. Keywords: outage probability, two-way relaying, lossy-forward, random K-factor, multiple access channel (MAC) Classification: Wireless Communication Technologies References[1] M. Chen and A. Yener, "Power allocation for F/TDMA multiuser two-way relay networks," IEEE Trans.

show abstract