#### DMCA

## Distributed Compression for MIMO Coordinated Networks with a Backhaul Constraint

Citations: | 17 - 1 self |

### Citations

12152 |
Elements of Information Theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...hat the conditional Karhunen-Loève transform (CKLT) is an optimal linear transformation [22]. First, recall that multiplying a vector by a non-singular matrix ( does not change the mutual information =-=[20]-=-, i.e., ... |

2855 | Capacity of multi-antenna Gaussian channels,” European Trans
- Telatar
- 1999
(Show Context)
Citation Context .... Accordingly, the capacity region of the network equals that of a multiple-input, multiple-output (MIMO) multi-access channel, with a suprareceiver containing all the antennas of all cooperative BSs =-=[6]-=-. Manuscript received August 26, 2008; revised March 2, 2009; accepted June 2, 2009. The associate editor coordinating the review of this paper and approving it for publication was J. M. Shea. A. del ... |

1247 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 1973
(Show Context)
Citation Context ...ch a compression is the direct extension of BergerTung coding to the decoding side information case [15]. In turn, Berger-Tung compression is the lossy counterpart of the Slepian-Wolf lossless coding =-=[16]-=-. D-WZ coding is thus the compression scheme proposed to be used, as detailed below. Summary of Contributions. This paper considers a singlefrequency network with ... |

1136 | Inequalities: Theory of Majorization and Its Applications - Marshall, Olkin, et al. - 2009 |

1122 |
Nonlinear Programming. Athena Scientific,
- Bertsekas
- 1999
(Show Context)
Citation Context ... BSs. In particular, the optimum ”compression noise” covariances are obtained by means of an iterative algorithm, constructed using dual decomposition and a non-linear block coordinate approach [17], =-=[18]-=-. The second part of the paper extends the analysis to multiple users transmitting simultaneously: ∙ First, the sum-rate of the network is derived in Sec. V, adapting single-user results. Later, the w... |

1044 | The rate-distortion function for source coding with side information at the decoder II
- Wyner
- 1978
(Show Context)
Citation Context ...ng. We build upon these results to extend the analysis to the MIMO case with constant channel gains. The compression of signals with side information at the decoder was introduced by Wyner and Ziv in =-=[12]-=-, [13]. They showed that side information at the encoder is useless (i.e., the rate-distortion tradeoff remains unchanged) to compress a single, Gaussian source when the side information is available ... |

190 | Dual methods for nonconvex spectrum optimization of multicarrier systems - Yu, Lui - 2006 |

177 | A Tutorial on Decomposition Methods for Network Utility Maximization - Palomar, Chiang - 2006 |

130 | The Matrix Cookbook
- Petersen, Pedersen
- 2012
(Show Context)
Citation Context ...nspose of A and complex conjugate of ... |

102 |
Gaussian multiterminal source coding
- Oohama
- 1997
(Show Context)
Citation Context ...his paper considers a new approach for the network: distributed compression. The cooperative BSs, upon receiving their signals, distributively compress them using a multisource lossy compression code =-=[9]-=-. Then, via the lossless backhaul, they transmit the compressed signals to the central unit (also a BS), which decompresses them using its own received signal as side information. Then it estimates th... |

102 | Optimized signaling for MIMO interference systems with feedback," IEEE Transactions on Signal Processing [See also - Ye, Blum - 2003 |

89 | The distributed Karhunen-Loéve transform
- Gastpar, Dragotti, et al.
(Show Context)
Citation Context ... out using a Transform Coding (TC) approach. TC consists of BS1 first transforming its received vector using an invertible linear function and then separately compressing the resulting scalar streams =-=[22]-=-. In particular, we show that the conditional Karhunen-Loève transform (CKLT) is an optimal linear transformation [22]. First, recall that multiplying a vector by a non-singular matrix ( does not chan... |

73 |
Coordinating multiple antenna cellular networks to achieve enormous spectral efficiency
- Foschini, Karakayali, et al.
- 2006
(Show Context)
Citation Context ...reviewed in [1] to overcome it, including coordinated scheduling and interference cancelation. However, a more complex but spectrally efficient solution can be proposed: coordinated cellular networks =-=[2]-=-. They consist of singlefrequency networks where base stations (BSs) cooperate to: i) beamform towards the mobile terminals in the downlink, and ii) coherently detect them in the uplink [3]. Hereafter... |

50 | Overcoming Interference in Spatial Multiplexing MIMO Cellular Networks
- Andrews, Choi, et al.
- 2007
(Show Context)
Citation Context ... I. INTRODUCTION THE current trend to reduce the frequency reuse factor of cellular networks makes inter-cell interference a critical problem. A wide range of multi-antenna techniques are reviewed in =-=[1]-=- to overcome it, including coordinated scheduling and interference cancelation. However, a more complex but spectrally efficient solution can be proposed: coordinated cellular networks [2]. They consi... |

40 |
On the maximum common rate achievable in a coordinated network
- Karakayali, Foschini, et al.
- 2006
(Show Context)
Citation Context ...r networks [2]. They consist of singlefrequency networks where base stations (BSs) cooperate to: i) beamform towards the mobile terminals in the downlink, and ii) coherently detect them in the uplink =-=[3]-=-. Hereafter, we restrain ourselves to the uplink channel. Preliminary research on the uplink performance of coordinated networks consider all BSs connected via a lossless backhaul with unlimited capac... |

37 | The Wyner-Ziv Problem with Multiple Sources
- Gastpar
- 2004
(Show Context)
Citation Context ...e to date. Indeed, this is an open problem for which, to the best of authors knowledge, the tightest lower bound (in a rate-distortion sense) is obtained with Distributed Wyner-Ziv (D-WZ) compression =-=[14]-=-. Such a compression is the direct extension of BergerTung coding to the decoding side information case [15]. In turn, Berger-Tung compression is the lossy counterpart of the Slepian-Wolf lossless cod... |

36 |
A framework for optimizing the uplink performance of distributed antenna systems under a constrained backhaul
- Marsch, Fettweis
- 2007
(Show Context)
Citation Context ...coding [7], consisting on a demodulating scheme distributively carried out among BSs, based on local decisions and belief propagation. Decoding delay appears to be its main drawback. ii) Quantization =-=[8]-=-, where BSs quantize their observations and forward them to the decoding unit. Its main limitation relies on its inability to take profit of signal correlation between BSs, which introduces redundancy... |

32 | A dual decomposition approach to the sum power Gaussian vector multiple access channel sum capacity problem
- Yu
- 2003
(Show Context)
Citation Context ...own as Non-Linear Gauss-Seidel algorithm [24, Section II-C]. been previously used to e.g., solve the sum-capacity problem of MIMO multiple access channels with individual and sumpower constraint [25] =-=[26]-=-. We define it for our problem as: A ... |

29 |
An information theoretic view of distributed antenna processing in cellular systems
- Somekh, Simeone, et al.
- 2007
(Show Context)
Citation Context ...reafter, we restrain ourselves to the uplink channel. Preliminary research on the uplink performance of coordinated networks consider all BSs connected via a lossless backhaul with unlimited capacity =-=[4]-=- [5]. Accordingly, the capacity region of the network equals that of a multiple-input, multiple-output (MIMO) multi-access channel, with a suprareceiver containing all the antennas of all cooperative ... |

27 | Distributed decoding in a cellular multiple-access channel
- Aktas, Evans, et al.
- 2008
(Show Context)
Citation Context ... about the costs of upgrading their backhaul to support e.g., High-speed Packet Access (HSPA). To deal with a realistic backhaul constraint, two approaches have been proposed: i) Distributed decoding =-=[7]-=-, consisting on a demodulating scheme distributively carried out among BSs, based on local decisions and belief propagation. Decoding delay appears to be its main drawback. ii) Quantization [8], where... |

19 |
Distributed MIMO Receiver - Achievable Rates and Upper Bounds
- Sanderovich, Shamai
- 2009
(Show Context)
Citation Context ...hich decompresses them using its own received signal as side information. 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. We build upon these results to extend the analysis to the MIMO case with constant channel gains. The compression of... |

11 | Gaussian multiple-access channels with intersymbol interference: Capacity region and multiuser water-filling - Cheng, Verdú - 1993 |

11 | Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices - Malick, Sendov |

9 | Conjugate gradient projection approach for MIMO Gaussian broadcast channels
- Liu, Hou, et al.
- 2007
(Show Context)
Citation Context ... the gradient projection method (GP) [18, Section 2.3]. GP has been used to e.g., compute transmit covariances for MIMO interference channels and the WSR of MIMO broadcast channels [29, Section IV-C] =-=[30]-=-. It is defined as follows: let (27), and consider the initial point { A0 1 , ⋅⋅⋅ , A0 } ... |

8 |
Communication via decentralized processing
- Steinberg, Kramer
- 2008
(Show Context)
Citation Context ...BS), which decompresses them using its own received signal as side information. 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. We build upon these results to extend the analysis to the MIMO case with constant channel gains. The compress... |

7 | 2007, ‘Achievable Rates of Compressand-Forward Cooperative Relaying on Gaussian Vector Channels
- Simoens, Muñoz, et al.
(Show Context)
Citation Context ... ... |

4 |
L.: Base-station selection in cooperative single frequency cellular network
- Kamoun, Mazet
- 2007
(Show Context)
Citation Context ...ter, we restrain ourselves to the uplink channel. Preliminary research on the uplink performance of coordinated networks consider all BSs connected via a lossless backhaul with unlimited capacity [4] =-=[5]-=-. Accordingly, the capacity region of the network equals that of a multiple-input, multiple-output (MIMO) multi-access channel, with a suprareceiver containing all the antennas of all cooperative BSs ... |

3 |
Successive Wyner-Ziv coding scheme and its implications to the quadratic Gaussian CEO problem,” submitted
- Chen, Berger
- 2006
(Show Context)
Citation Context ...ound (in a rate-distortion sense) is obtained with Distributed Wyner-Ziv (D-WZ) compression [14]. Such a compression is the direct extension of BergerTung coding to the decoding side information case =-=[15]-=-. In turn, Berger-Tung compression is the lossy counterpart of the Slepian-Wolf lossless coding [16]. D-WZ coding is thus the compression scheme proposed to be used, as detailed below. Summary of Cont... |

2 |
Iterative water-filling for Gaussian multiple-access channels
- Yu, Rhee, et al.
- 2004
(Show Context)
Citation Context ...so known as Non-Linear Gauss-Seidel algorithm [24, Section II-C]. been previously used to e.g., solve the sum-capacity problem of MIMO multiple access channels with individual and sumpower constraint =-=[25]-=- [26]. We define it for our problem as: A ... |

2 | Some properties of a class of symmetric functions - Guan - 2007 |

1 |
Convex Optimization, 1
- Boyd, Vandenberghe
- 2004
(Show Context)
Citation Context ...rary ... |