Results 1 - 10
of
7,541
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract
-
Cited by 296 (42 self)
- Add to MetaCart
, and for this model, the capacity of even a network with a single relay node is open for 30 years. In this paper, we present a deterministic approach to this problem by focusing on the signal interaction rather than the noise. To this end, we propose a deterministic channel model which is analytically simpler than
A Deterministic Approach to Throughput Scaling in Wireless Networks
- Transactions on Information Theory
, 2004
"... Abstract—We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other ..."
Abstract
-
Cited by 148 (3 self)
- Add to MetaCart
nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain throughput for a general class of network configurations in a fixed area
A deterministic approach to the Skorokhod problem by
"... Abstract: We prove an existence and uniqueness result for the solutions to the Skorokhod problem on uniformly prox-regular sets through a deterministic approach. This result can be applied in order to investigate some regularity properties of the value function for differential games with reflection ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract: We prove an existence and uniqueness result for the solutions to the Skorokhod problem on uniformly prox-regular sets through a deterministic approach. This result can be applied in order to investigate some regularity properties of the value function for differential games
Deterministic Approach to Polarization Mode Dispersion
, 2004
"... Polarization Mode Dispersion (PMD) is considered to be one of the most serious obstacles in the high speed optical telecommunication systems. This thesis focuses on a deterministic approach to both compensation and emulation of PMD. Most PMD compensation schemes in the literature rely on feedback lo ..."
Abstract
- Add to MetaCart
Polarization Mode Dispersion (PMD) is considered to be one of the most serious obstacles in the high speed optical telecommunication systems. This thesis focuses on a deterministic approach to both compensation and emulation of PMD. Most PMD compensation schemes in the literature rely on feedback
A Deterministic Approach to Wireless Relay Networks
, 2007
"... We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-toend capacity when there is a single so ..."
Abstract
-
Cited by 135 (23 self)
- Add to MetaCart
We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-toend capacity when there is a single
A Deterministic Approach To Stochastic Approximation
, 1994
"... : A deterministic approach is proposed for proving the convergence of stochastic algorithms of the most general form, under necessary conditions on the input noise, and reasonable and verifiable conditions on the (non-necessarily continuous) mean field. A condition is also given for obtaining conver ..."
Abstract
- Add to MetaCart
: A deterministic approach is proposed for proving the convergence of stochastic algorithms of the most general form, under necessary conditions on the input noise, and reasonable and verifiable conditions on the (non-necessarily continuous) mean field. A condition is also given for obtaining
Stochastic and Deterministic Approaches to Estimation in H∞
, 1993
"... This paper examines system identification methods from frequency response data that have recently emerged under the title of `Estimation in H∞'. We briefly review this work and examine in detail the effects of model order on linear algorithms. This leads to a model order selection criterion whi ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
which has not been previously discussed in the literature. All the existing literature in this area examines data corrupted by disturbances with deterministic descriptions. Here we develop a theory of estimation in H1 when the disturbances have mild stochastic descriptions. This theory covers issues
Results 1 - 10
of
7,541