On capacity of gaussian 'cheap' relay channel

Khojastepour, Mohammad A.; Sabharwal, Ashutosh; Aazhang, Behnaam

doi:10.1109/glocom.2003.1258542

Cited by 154 publications

(207 citation statements)

References 9 publications

Supporting

Mentioning

205

Contrasting

Order By: Relevance

“…Then we briefly review the coding strategy which leads to the highest achievable rate [12] with DF relaying. The construction of bilayer codes [5] is described as a practical realization of the coding strategy.…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

Bilayer LDPC convolutional codes for half-duplex relay channels

Thobaben

Skoglund

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

Abstract-In this paper we present regular bilayer LDPC convolutional codes for half-duplex relay channels. For the binary erasure relay channel, we prove that the proposed code construction achieves the capacities for the source-relay link and the source-destination link provided that the channel conditions are known when designing the code. Meanwhile, this code enables the highest transmission rate with decode-and-forward relaying. In addition, its regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. Numerical results are provided for both binary erasure channels (BEC) and AWGN channels. In BECs, we can observe that the gaps between the decoding thresholds and the Shannon limits are impressively small. In AWGN channels, the bilayer LDPC convolutional code clearly outperforms its block code counterpart in terms of bit error rate.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…The highest transmission rate using decode-and-forward protocol for the half-duplex relay channel with orthogonal receive components is given as [12] R DF = sup…”

Section: B Achievable Ratementioning

confidence: 99%

Bilayer LDPC convolutional codes for half-duplex relay channels

Thobaben

Skoglund

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

show abstract

“…A comprehensive discussion of this case is provided in [9], [5] and [10]. In this setting, we assume that there exists a positive fraction t ∈ [0, 1] such that the relay is listening (receiving) during a proportion t of the time, and transmitting during a proportion 1 − t of the time.…”

Section: A Half Duplex Relaymentioning

confidence: 99%

On Maximizing Coverage in Gaussian Relay Networks

Aggarwal

Bennatan

Calderbank

2007

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

View full text Add to dashboard Cite

Abstract-Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizing coverage. When the objective is maximizing rate, different locations of the destination favor different strategies. When the objective is coverage for a given rate, and the relay is able to decode, DF is uniformly superior in that it provides coverage at any point served by CF. When the channel model is modified to include random fading, we show that the monotone ordering of coverage regions is not always maintained. While the coverage provided by DF is sensitive to changes in the location of the relay and the path loss exponent, CF exhibits a more graceful degradation with respect to such changes. The techniques used to approximate coverage regions are new and may be of independent interest.

show abstract

“…A comprehensive literature survey as well as a classification of random coding strategies is given in [4]. There has also been work on determining the capacity or rate region of various half-duplex constrained relay channels [5], [6] and networks [7], however, under the assumption that the time-division schedule is determined a priori.…”

Section: Introductionmentioning

confidence: 99%

Coding strategies for noise-free relay cascades with half-duplex constraint

Lutz

Hausl

Kötter

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node intends to transmit information to the same destination. We introduce two relay channel models, capturing the half-duplex constraint, and within the framework of these models capacity is determined for the first network type. It turns out that capacity is significantly higher than the rates which are achievable with a straightforward time-sharing approach. A capacity achieving coding strategy is presented based on allocating the transmit and receive time slots of a node in dependence of the node's previously received data. For the networks of the second type, an upper bound to the rate region is derived from the cut-set bound. Further, achievability of the cut-set bound in the single relay case is shown given that the source rate exceeds a certain minimum value.

show abstract

On capacity of gaussian 'cheap' relay channel

Cited by 154 publications

References 9 publications

Bilayer LDPC convolutional codes for half-duplex relay channels

Bilayer LDPC convolutional codes for half-duplex relay channels

On Maximizing Coverage in Gaussian Relay Networks

Coding strategies for noise-free relay cascades with half-duplex constraint

Contact Info

Product

Resources

About