Communication Via Decentralized Processing

Sanderovich, Amichai; Shamai, Shlomo; Steinberg, Yossef; Kramer, Gerhard

doi:10.1109/tit.2008.924659

Cited by 146 publications

(265 citation statements)

References 33 publications

Supporting

Mentioning

253

Contrasting

Order By: Relevance

“…• Naive CF -the fading gain s N W Z = s 2 + , where the CDF of s RT E N W Z allows computation of maximal achievable RTE rates, as in (37)- (38).…”

Section: Discussionmentioning

confidence: 99%

“…The compress and forward (CF) and amplify and forward (AF) techniques make use of lossy source coding techniques, to ensure high communication rates, when the cooperative receiver does not decode the message. This is done in [20], [21], among many others. Here, we deal with one transmitter that sends the same information to two colocated users, through independent, block Rayleigh fading channels [22].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Broadcast Cooperation Strategies for Two Colocated Users

Steiner

Sanderovich

Shamai

2007

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from the transmitter to the destined user. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). This gives rise to the broadcast approach used by the transmitter. The broadcast approach facilitates reliable transmission rates adapted to the actual channel conditions, designed to maximize average throughput. It also allows in our network setting to improve the cooperation between the colocated users. With the broadcast approach, users can decode something out of the message, with almost any fading realization. The better the channel quality, the more layers that can be decoded.Such an approach is useful when considering average rates, rather than outage vs. rate. The cooperation between the users is performed over an additive white Gaussian channels (AWGN), with a relaying power constraint, and unlimited bandwidth. One type of cooperation studied is the amplify-forward (AF) cooperation. Another is the Wyner-Ziv (WZ) compression and forwarding (CF) technique. And finally, decode and forward (DF) cooperation is investigated. In this paper, we extend these methods using the broadcast approach, for the case of relaxed decoding delay constraint. For this case a separated processing of the layers, which includes multi-session cooperation is shown to be beneficial. Further, closed form expressions for infinitely many AF sessions and recursive expressions for the more complex WZ are given. Numerical results for the various cooperation strategies demonstrate the efficiency of multi-session cooperation. Our results can be extended straightforwardly to a setting of a single transmitter sending common information for two cooperating users.

show abstract

“…• Naive CF -the fading gain s N W Z = s 2 + , where the CDF of s RT E N W Z allows computation of maximal achievable RTE rates, as in (37)- (38).…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Broadcast Cooperation Strategies for Two Colocated Users

Steiner

Sanderovich

Shamai

2007

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…Achievability schemes for uplink MCP model under the individual backhaul capacity constraint have been studied extensively in the literature [4], [5], [6], [7], [8]. However, most existing schemes require joint decoding of the transmitted signals and the quantized signals, which is prohibitively complex to implement; the resulting rate region itself is also complex to evaluate.…”

Section: Introductionmentioning

confidence: 99%

Approximate bounds for limited backhaul uplink multicell processing with single-user compression

Zhou

2013

2013 13th Canadian Workshop on Information Theory

View full text Add to dashboard Cite

Abstract-This paper studies single-user compression for the uplink multi-cell processing (MCP) model where multiple basestations are connected to a central processor via noiseless backhaul links with a sum capacity constraint. The proposed scheme is based on the virtual multiple-access channel (V-MAC) architecture, where the base-stations quantize the received signals and send the quantized bits to the central processor, and at the decoder side the central processor first recovers the quantized signals then decodes the user messages in a successive manner. This paper focuses on the use of single-user compression in the V-MAC architecture, which is significantly simpler to implement than Wyner-Ziv compression. The main result of this paper is that single-user compression can achieve the sum capacity of the MCP model to within a constant gap under two specific scenarios. First, we define a diagonally dominant channel criterion and show the constant-gap result for the case when the covariance matrix of the received signals across the base-stations is κ-strictly diagonally dominant for some constant κ > 1. Second, we show that the constant-gap result holds for a special class of Wyner channel models in the weak interference regime.

show abstract

“…Then it estimates the users' messages. Distributed compression has been previously proposed for coordinated networks in [10], [11]. In those works, authors consider single-antenna BSs with block and ergodic fading.…”

Section: Introductionmentioning

confidence: 99%

“…Such a coding/decoding scheme is equivalent to that presented in [10, Theorem 1] and we don't claim it is optimal. Indeed, two weaknesses can be identified: i) as pointed out in [10], BS 0 is assumed to decompress without errors, which is unnecessarily restrictive. In fact, it would be enough forcing the user's message to be decoded without errors, and ii) D-WZ is not shown to be optimal.…”

Section: Introductionmentioning

confidence: 99%

Distributed compression for MIMO coordinated networks with a backhaul constraint

Coso

Simoens

2009

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-We consider the uplink of a backhaul-constrained, MIMO coordinated network. That is, a single-frequency network with + 1 multi-antenna base stations (BSs) that cooperate in order to decode the users' data, and that are linked by means of a common lossless backhaul, of limited capacity R. To implement the receive cooperation, we propose distributed compression: BSs, upon receiving their signals, compress them using a multi-source lossy compression code. Then, they send the compressed vectors to a central BS, which performs users' decoding. Distributed Wyner-Ziv coding is proposed to be used, and is designed in this work. The first part of the paper is devoted to a network with a unique multi-antenna user, that transmits a predefined Gaussian space-time codeword. For such a scenario, the "compression noise" covariance at the BSs is optimized, considering the user's achievable rate as the performance metric. In particular, for = 1 the optimum covariance is derived in closed form, while for > 1 an iterative algorithm is devised. The second part of the contribution focusses on the multi-user scenario. For it, the achievable rate region is obtained by means of the optimum "compression noise" covariances for sum-rate and weighted sum-rate, respectively. Index Terms-MAC, multiple relay channel, decode-andforward.

show abstract

Communication Via Decentralized Processing

Cited by 146 publications

References 33 publications

Broadcast Cooperation Strategies for Two Colocated Users

Broadcast Cooperation Strategies for Two Colocated Users

Approximate bounds for limited backhaul uplink multicell processing with single-user compression

Distributed compression for MIMO coordinated networks with a backhaul constraint

Contact Info

Product

Resources

About