Results 241 to 250 of about 12,709 (276)

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

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

Compress-and-Forward via Multilevel Coding

2019 IEEE International Symposium on Information Theory (ISIT), 2019
We investigate the performance of discrete (coded) modulations in the full-duplex compress-and-forward relay channel using multilevel coding. We numerically analyze the rates assigned to component binary codes of all levels. LDPC codes are used as the component binary codes to provide error protection.
Heping Wan, Anders Høst-Madsen, Aria Nosratinia   +2 more
openaire   +1 more source

When is compress-and-forward optimal?

2010 Information Theory and Applications Workshop (ITA), 2010
In many known examples where compress-and-forward (CF) for relay networks is capacity achieving, it is only trivially so, i.e., it falls back to hashing without quantization. A potentially better strategy is to decode as much as possible and to compress the residual information, i.e., a combination of decode-and-forward (DF) and CF (Cover and El Gamal ...
Si-Hyeon Lee, Sae-Young Chung
openaire   +1 more source

A novel decoding structure in compress-and-forward systems

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010
A novel joint decompression and forward error correction (FEC) decoding structure for a compress-and-forward relay system is proposed. We notice the possibility of iterative processing between the decompressor and the FEC decoder for the original source information and propose a turbo-like structure to allow interaction and extrinsic information ...
Yinan Qi, Reza Hoshyar, Rahim Tafazolli
openaire   +1 more source

Compressing IP forwarding tables for fun and profit

Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012
About what is the smallest size we can compress an IP Forwarding Information Base (FIB) down to, while still guaranteeing fast lookup? Is there some notion of FIB entropy that could serve as a compressibility metric? As an initial step in answering these questions, we present a FIB data structure, called Multibit Burrows-Wheeler transform (MBW), that ...
Gábor Rétvári, Zoltán Csernátony, Attila Korösi, János Tapolcai, András Császár, Gábor Enyedi, Gergely Pongrácz   +6 more
openaire   +1 more source

Compressed-and-forward: Compressive sensing for cooperative communication

2012 International Symposium on Intelligent Signal Processing and Communications Systems, 2012
Cooperative communication has been shown that it is an effective way to achieve spatial diversity in order to combat the user-outage caused by effects fading channel. Except for amplify-and-forward (AF) and decode-and-forward (DF), compressed-and-forward (CF) is also an efficient forwarding strategy.
Chia-Hung Yeh, Yu-Liang Lin, Cheng-Chih Liu, Wan-Jen Huang   +3 more
openaire   +1 more source

Compress-and-forward on a multiaccess relay channel with computation at the receiver

2013 IEEE International Conference on Communications (ICC), 2013
We study a system in which two sources communicate with a destination with the help of a half-duplex relay. We consider a decoding strategy, based on the compute-and-forward strategy, in which the destination decodes two integer-valued linear combinations that relate the transmitted codewords.
El Soussi, Mohieddine, Zaidi, Abdellatif, Vandendorpe, Luc   +2 more
openaire   +2 more sources

Optimal data compression and forwarding in wireless sensor networks

IEEE Communications Letters, 2010
In this letter, we present a Linear Programming framework for modeling dynamic data compression and decompression in conjunction with flow balancing in wireless sensor networks. Using the developed framework, we investigated the sensor network lifetimes for different network sizes with various data compression and flow balancing strategies. Our results
Bülent Tavli, Ibrahim Ethem Bagci, Onur Ceylan   +2 more
openaire   +2 more sources