Results 231 to 240 of about 105,769,074 (273)

Generalized compress-and-forward strategy for relay networks

2008 IEEE International Symposium on Information Theory, 2008
In this paper, we present a new generalization of the well- known Compress-and-Forward strategy for relay networks. We propose an offset decoding at destination, where destination considers an ordered partition of relays and decodes information of any partition with the help of information from prior partitions.
Mohammad Hossein Yassaee, Mohammad Reza Aref   +1 more
exaly   +2 more sources

An achievable rate for relay networks based on compress-and-forward strategy

IEEE Communications Letters, 2010
Compress-and-Forward (CF) is a well-known coding strategy proposed for relay channels. Few works which were done about the generalization of the CF strategy to the relay networks, are based on irregular encoding/successive decoding. In this paper, a new generalization of the CF strategy to the relay networks based on regular encoding/backward decoding ...
Sadaf Salehkalaibar, Leila Ghabeli, Mohammad Reza Aref   +2 more
exaly   +2 more sources

Scalar and Vector Compress and Forward for the Two Way Relay Channels

2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), 2016
Both scalar and vector quantization are studied when Compress and Forward (CF) is performed in the Two Way Relay Channels. The optimization schemes of these two kinds of quantizers aiming to maximize the sum rate are proposed. The optimization schemes are a combination of the Information Bottleneck (IB) method and the Bi- Section method.
Volker Kuehn
exaly   +2 more sources

On the generalization of decode-and-forward and compress-and-forward for Gaussian relay channels

2011 IEEE Information Theory Workshop, 2011
In this paper, the generalization of the decode-and-forward (DF) and compress-and-forward (CF) relaying schemes is studied for the case in which Gaussian codebooks are used for signalling over scalar Gaussian memoryless channels. Three SNR regions are identified wherein the generalized DF-CF scheme reduces to either the DF or the CF scheme. In addition,
Ramy H Gohary, Halim Yanikomeroglu
exaly   +2 more sources

Joint decode/compress and forward based cooperative multiple access

2012 20th Signal Processing and Communications Applications Conference (SIU), 2012
In this paper, we develop encoding and decoding strategies for a two user cooperative multiple access channel, based on the joint use of decode-forward and compress-forward techniques. We derive the resulting achievable rate expressions. We compare our results with some known rate regions for bidirectional cooperation, and demonstrate through ...
Mehmet Günes, Onur Kaya
exaly   +2 more sources

Compress-and-forward strategy for the relay broadcast channel with confidential messages

2016 IEEE International Conference on Communications Workshops (ICC), 2016
In this paper, we re-visit the relay broadcast channel with confidential messages (RBC-CM) by considering a compress-and-forward (CF) inner bound on the capacity-equivocation region of the RBC-CM. This CF inner bound is further explained via a degraded Gaussian example, and we show that in some particular cases, the CF strategy performs better than the
Bin Dai 0003, Linman Yu, Zheng Ma 0001
exaly   +2 more sources

Achievable rate regions for broadcast channels with compress-and-forward relaying

2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012
The achievable rate regions are studied for the broadcast systems with relay links via the compress-and-forward strategy. In many cases, we can benefit more from compress-and-forward relaying in broadcast channels than from decode-and-forward relaying. In particular, we can achieve physical layer security when using the compress-and-forward scheme.
exaly   +2 more sources

Compute-compress-and-forward

2015 IEEE International Symposium on Information Theory (ISIT), 2015
Compute-and-forward (CF) can harness interference in a multi-hop relay network by allowing a relay to decode and forward a combination of source messages. However, the total forwarding rate of the relays belonging to one hop may far exceed the total information rate of the sources, which implies information redundancy and spectral inefficiency.
Yihua Tan, Xiaojun Yuan 0002
openaire   +1 more source