Opportunistic noisy network coding for fading relay networks without CSIT

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

The parallel relay network is studied, in which a single source node sends a message to a single destination node with the help of N parallel relays. Channel coefficients are assumed to vary over time and channel state information (CSI) is causally available only at the receiver side (CSIR). Opportunistic noisy network coding is proposed for intelligently exploiting CSIR at each relay in a distributed manner by operating the noisy network coding scheme with adaptive compression. More specifically, each relay opportunistically vector-quantizes the collection of received symbols that is received with channel gains larger than a certain threshold. It then forwards the digital compression information to the destination node using independently generated Gaussian codes. For independent and identically distributed (i.i.d.) Rayleigh fading, the proposed scheme is shown to achieve the ergodic capacity in the large number of relays regime. Furthermore, the proposed scheme is extensively compared with several alternative schemes, the decode-forward scheme, the adaptive amplify-forward scheme, and the non-adaptive noisy network coding scheme over geometric models. We show that the new proposed scheme provides significant gain over these schemes in various cases. © 2002-2012 IEEE.

키워드

Adaptive compression; approximate capacity; compress-forward; fast fading; noisy network coding; parallel relay network; COOPERATIVE DIVERSITY; CAPACITY THEOREMS; POWER ALLOCATION; SNR REGIME; CHANNEL; STRATEGIES
제목
Opportunistic noisy network coding for fading relay networks without CSIT
저자
Jeon, Sang-Woon; Lim, Sung Hoon; Jung, Bang Chul
DOI
10.1109/TWC.2015.2448085
발행일
2015-11
유형
Article
저널명
IEEE Transactions on Wireless Communications
권
14
호
11
페이지
6097 ~ 6110