Results 221 to 230 of about 25,659 (256)
Some of the next articles are maybe not open access.

Capacity theorems for the relay channel

IEEE Transactions on Information Theory, 1979
A relay channel consists of an input x_{l} , a relay output y_{1} , a channel output y , and a relay sender x_{2} (whose transmission is allowed to depend on the past symbols y_{1} . The dependence of the received symbols upon the inputs is given by p(y,y_{1}|x_{1},x_{2}) . The channel is assumed to be memoryless.
Thomas M. Cover, Abbas El Gamal
openaire   +1 more source

On the capacity of the interference channel with a relay

2008 IEEE International Symposium on Information Theory, 2008
Capacity gains due to relaying in wireless networks with multiple source-destination pairs are analyzed. A two- source, two-receiver network with the relay is considered. The focus is on the scenario in which, due to channel conditions, the relay can observe the signal from only one source. The relay can thus help the intended receiver of this message,
Ivana Maric   +2 more
openaire   +1 more source

Joint source-channel mappings for the relay channel

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
The three-node relay channel with a Gaussian source is studied for transmission subject to a low-delay constraint. A joint source-channel coding design algorithm is proposed and numerically evaluated. The designed system is compared to a reference system, based on modular source and channel coding, and the distortion-rate function for the Gaussian ...
Johannes Karlsson, Mikael Skoglund
openaire   +1 more source

Polar coding for relay channels

2015 IEEE International Symposium on Information Theory (ISIT), 2015
Polar coding schemes are developed for the decode-forward relaying (digital-to-digital interface) and the compress-forward relaying (analog-to-digital interface) in the three-node relay channel. For decode-forward, a technique based on the recent universal polarization method is applied to create the desired nested structure.
openaire   +1 more source

Rateless coding for wireless relay channels

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
We propose a novel coding framework for wireless relay channels based on rateless codes, which allows for a natural extension to multiple antenna and multiple relay settings. The relaying protocol is half-duplex, and relays independently choose when to collaborate, if at all.
Jeff Castura, Yongyi Mao
openaire   +1 more source

Partial converse for a relay channel

IEEE Transactions on Information Theory, 1988
A special case of the general discrete memoryless relay channel is studied. This channel consists of an input x, a relay output z, a channel output y, and a noiseless channel of capacity C/sub r/ allowing the relay sender to send additional information to the decoder. The channel is described by a collection of distributions (p(y, z mod x)).
openaire   +2 more sources

Parallel relay broadcast channels

2010 IEEE International Symposium on Information Theory, 2010
In this paper, we study the achievable rate regions of parallel relay broadcast channels. We present two system models, the parallel unshared-relay broadcast channel and the parallel shared-relay broadcast channel. In the first system, each relay node is peculiar to one of the users and does not assist any other user.
openaire   +1 more source

Multiple‐access relay channels with non‐causal channel state information at the relay

Transactions on Emerging Telecommunications Technologies, 2014
AbstractIn this paper, we study state‐dependent multiple‐access relay channel (MARC). (i) Inner and outer bounds are derived for two‐user state‐dependent discrete memoryless MARC in which channel state information is known non‐causally at the relay (informed relay).
Mohammad Osmani-Bojd   +1 more
openaire   +1 more source

Sensitivity of Achievable Rates for the Relay Channel. Application to Relaying with Channel Estimation Error

2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07, 2007
This paper investigates the sensitivity of the achievables rates for the full-duplex relay channel to small additive disturbances on channel links. The focus is on two relaying strategies - the decode-and-forward (DF) mode and the compress-and-forward (CF) mode.
Abdellatif Zaidi, Luc Vandendorpe
openaire   +1 more source

Receiver Design for Wireless Relay Channels with Regenerative Relays

2007 IEEE International Conference on Communications, 2007
We develop a general framework for design of receivers for the wireless relay channel. We derive the optimum detectors for various degrees of channel state information (CSI) at the destination. We consider both the case when the destination has access to full knowledge of the CSI and the case when it only knows the statistics of the channel.
Majid Nasiri Khormuji, Erik G. Larsson
openaire   +1 more source

Home - About - Disclaimer - Privacy