Results 241 to 250 of about 13,573 (269)

Compress-spread-forward with multiterminal source coding and complete complementary sequences

IEEE Transactions on Communications, 2009
We propose a new technique, compress-spread forward (CSF), for high-performance wireless streaming from two base stations in parallel. CSF uses multiterminal source coding for efficient source compression and complete complementary sequences for error ...
Vladimir Stanković, Zixiang Xiong, Lina Stankovic   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

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   +2 more sources

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   +2 more sources

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   +2 more sources

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

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
openaire   +2 more sources

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   +2 more sources

On the optimality of successive decoding in compress-and-forward relay schemes

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010
In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the compressed observation of the relay, and then decodes the original message of the source. Recently, two modified compressand- forward relay schemes were proposed, and in both of
Xiugang Wu, Liang-Liang Xie
openaire   +3 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