Achievability proof of some multiuser channel coding theorems using backward decoding

Zeng, Chaohuang; Kuhlmann, F.; Buzo, A.

doi:10.1109/18.45272

Cited by 56 publications

(59 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For sufficiently large, the expression is always increasing in and so is in (17). Following Definition 4 exactly, we conclude that multihop with is more bandwidth efficient for lower values of , with the single-hop scheme being the most bandwidth efficient.…”

Section: )mentioning

confidence: 75%

“…Indeed, we have shown in [22] that, for a given rate , the number of nodes yielding the least required power can be approximately computed as (18) where denotes the positive integer closest to and is the principal branch of the Lambert function. The approximation (18) is obtained by replacing the discrete variable by the continuous variable in (17) and minimizing by setting the derivative to zero. This yields (19) which can be solved for , giving (20) The result (18) is obtained from (20) by using the approximation .…”

Section: )mentioning

confidence: 99%

“…In fact, above certain rates, single-hop communication performs significantly better. Second, we present an IC scheme based on backward decoding [15]- [17], capable of canceling all interference in a linear multihop network at an arbitrarily small rate loss. This technique, called recursive backward IC, can significantly improve the performance of multihop transmission in the bandwidth-limited regime at a complexity and delay cost.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Bandwidth- and power-efficient routing in linear wireless networks

Sikora

Laneman

Haenggi

et al. 2006

IEEE Trans. Inform. Theory

212

161

View full text Add to dashboard Cite

Abstract-The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and 1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of (log ) are achievable over linear wireless networks even without synchronous cooperation.

show abstract

Section: )mentioning

confidence: 75%

Section: )mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Bandwidth- and power-efficient routing in linear wireless networks

Sikora

Laneman

Haenggi

et al. 2006

IEEE Trans. Inform. Theory

212

161

View full text Add to dashboard Cite

show abstract

“…DERIVING THE RATE REGION From the above mentioned channel model, the upper bounds on the achievable rate region can be derived using the technique of forward and backward decoding [18][19][20] employed in [11,12]. This technique is the revised version of the one employed in [9].…”

Section: Related Workmentioning

confidence: 99%

“…Hence, clearly the effect of transmitter cooperation is higher than the receiver cooperation. Also, by appropriate selection of power values in (20), transmitter and/or receiver cooperation can be explored. Similarly to (20), the other rate constraints described in (2), (3), and (4) can also be derived.…”

Section: Related Workmentioning

confidence: 99%

Bounds on achievable rates for cooperative channel coding

Pandya¹,

Pottie²

Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.

View full text Add to dashboard Cite

Abstract-We address the problem of cooperative coding among pairs of transmitters and corresponding pairs of receivers. This may be used, for example, to overcome gaps in a multihop networks. We derive upper bounds on the achievable rates for several cooperation scenarios. We show that transmitter cooperation provides significantly more improvement in rate than receiver cooperation. Based on the theoretical results, we also discuss the possible practical implementation techniques.

show abstract