Results 1  10
of
11
Optimal linear precoding strategies for wideband noncooperative systems based on game theory – Part II: Algorithms
 IEEE Trans. Signal Process
, 2008
"... In this twoparts paper we propose a decentralized strategy, based on a gametheoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipointtomultipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and band ..."
Abstract

Cited by 83 (10 self)
 Add to MetaCart
(Show Context)
In this twoparts paper we propose a decentralized strategy, based on a gametheoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipointtomultipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and bandwidth. We assume, as optimality criterion, the achievement of a Nash equilibrium and consider two alternative optimization problems: 1) the competitive maximization of mutual information on each link, given constraints on the transmit power and on the spectral mask imposed by the radio spectrum regulatory bodies; and 2) the competitive maximization of the transmission rate, using finite order constellations, under the same constraints as above, plus a constraint on the average error probability. In Part I of the paper, we start by showing that the solution set of both noncooperative games is always nonempty and contains only pure strategies. Then, we prove that the optimal precoding/multiplexing scheme for both games leads to a channel diagonalizing structure, so that both matrixvalued problems can be recast in a simpler unified vector power control game, with no performance penalty. Thus, we study this simpler game and derive sufficient conditions ensuring the uniqueness of the Nash equilibrium. Interestingly, although derived under stronger constraints,
Capacity theorems for the multipleaccess relay channel
 In Allerton Conference on Communications, Control and Computing
, 2004
"... Outer bounds for the discrete memoryless multipleaccess relay channel (MARC) are obtained that exploit the causal relationship between the source and relay inputs. A novel offset encoding technique that facilitates window decoding at the destination is presented for a decodeandforward strategy, w ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
(Show Context)
Outer bounds for the discrete memoryless multipleaccess relay channel (MARC) are obtained that exploit the causal relationship between the source and relay inputs. A novel offset encoding technique that facilitates window decoding at the destination is presented for a decodeandforward strategy, where the relay decodes the source messages before forwarding to the destination. A compressandforward strategy for the MARC and an amplifyandforward strategy for the Gaussian MARC are also presented. 1
Fifty Years of Shannon Theory
, 1998
"... A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication. ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
Hierarchical sensor networks: capacity bounds and cooperative strategies using the multipleaccess relay channel model
 In Proc. of IEEE Conf. on Sensor and Ad Hoc Communication and Networks
, 2004
"... Abstract — A threetier hierarchical wireless sensor network is considered that consists of a cluster of sensors, an intermediate relay with better computing and communication capabilities than the sensors, and a central server or access point. Such a network can be modeled as a multipleaccess rela ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
(Show Context)
Abstract — A threetier hierarchical wireless sensor network is considered that consists of a cluster of sensors, an intermediate relay with better computing and communication capabilities than the sensors, and a central server or access point. Such a network can be modeled as a multipleaccess relay channel (MARC) with additive white Gaussian noise and fading. Capacity bounds for this network are presented with and without constraints on simultaneous reception and transmission by the relay. The results identify cooperative strategies between the relay and sensors for increasing network capacity. These strategies also preserve limited battery resources by eliminating the need for cooperation between sensors. I.
Distributed Compression for MIMO Coordinated Networks with a Backhaul Constraint
"... Abstract—We consider the uplink of a backhaulconstrained, MIMO coordinated network. That is, a singlefrequency network with ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Abstract—We consider the uplink of a backhaulconstrained, MIMO coordinated network. That is, a singlefrequency network with
Ergodic Fading Interference Channels: SumCapacity and Separability
, 2009
"... The sumcapacity of ergodic fading Gaussian twouser interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the subclasses of uniformly strong (every fading state is strong) and ergodic very strong twosided IFCs (a ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The sumcapacity of ergodic fading Gaussian twouser interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the subclasses of uniformly strong (every fading state is strong) and ergodic very strong twosided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (CMAC), is proved. It is also shown that this capacityachieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading CMAC are developed. For the subclass of uniformly weak IFCs (every fading state is weak), genieaided outer bounds are developed. The bounds are shown to be achieved by ignoring interference and separable coding for onesided fading IFCs. Finally, for the subclass of onesided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.
The amplifybased multiplerelay multipleaccess channel: Capacity region and MACBC duality
 Proc. IEEE Information Theory Workshop
, 2007
"... The amplifybased multiplerelay multipleaccess channel: capacity region and MACBC duality A. del Coso, C. Ibars ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
The amplifybased multiplerelay multipleaccess channel: capacity region and MACBC duality A. del Coso, C. Ibars
1 Uplink Rate Region of a Coordinated Cellular Network with Distributed Compression
"... Abstract — We consider the uplink of a backhaulconstrained coordinated cellular network. That is, a singlefrequency network with N multiantenna base stations (BSs) that cooperate in order to decode the users ’ data, and that are linked by means of a lossless backhaul with limited capacity. To imp ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We consider the uplink of a backhaulconstrained coordinated cellular network. That is, a singlefrequency network with N multiantenna base stations (BSs) that cooperate in order to decode the users ’ data, and that are linked by means of a lossless backhaul with limited capacity. To implement cooperation among receivers, we propose distributed compression: the cooperative BSs, upon receiving their signals, compress them using a distributed WynerZiv code. Then, they send the compressed vectors to the central unit (also a BS), which implements decoding. In this paper, the achievable rate region of such a network is studied (particularized for the 2user case). We devise an iterative algorithm that solves the weighted sumrate optimization, and derives the optimum compression codebooks at the BSs. The extension to more than two users is straightforward. I.
Fifty Years of Shannon Theory
, 1998
"... A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication. ..."
Abstract
 Add to MetaCart
(Show Context)
A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
1 Distributed Compression for the Uplink of a BackhaulConstrained Coordinated Cellular Network
, 2008
"... We consider a backhaulconstrained coordinated cellular network. That is, a singlefrequency network with N+1 multiantenna 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 receive ..."
Abstract
 Add to MetaCart
We consider a backhaulconstrained coordinated cellular network. That is, a singlefrequency network with N+1 multiantenna 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 receive cooperation, we propose distributed compression: N BSs, upon receiving their signals, compress them using a multisource lossy compression code. Then, they send the compressed vectors to a central BS, which performs users ’ decoding. Distributed WynerZiv coding is proposed to be used, and is optimally designed in this work. The first part of the paper is devoted to a network with a unique multiantenna user, that transmits a predefined Gaussian spacetime codeword. For such a scenario, the compression codebooks at the BSs are optimized, considering the user’s achievable rate as the performance metric. In particular, for N = 1 the optimum codebook distribution is derived in closed form, while for N> 1 an iterative algorithm is devised. The second part of the contribution focusses on the multiuser scenario. For it, the achievable rate region is obtained by means of the optimum compression codebooks for sumrate and weighted sumrate, respectively.