Results 1  10
of
2,184
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
A New Method of Measuring Propagation Coefficients and Characteristic Impedance in Blood Vessels
"... True propagation coefficients of pulse wave harmonics in an artery can be determined in vivo by measuring pulsatile blood pressure and flow at each of two points along the length of the vessel. These coefficients, which are complex numbers that describe the attenuation and the phase shift imposed on ..."
Abstract
 Add to MetaCart
True propagation coefficients of pulse wave harmonics in an artery can be determined in vivo by measuring pulsatile blood pressure and flow at each of two points along the length of the vessel. These coefficients, which are complex numbers that describe the attenuation and the phase shift imposed
Unitary SpaceTime Modulation for MultipleAntenna Communications in Rayleigh Flat Fading
 IEEE Trans. Inform. Theory
, 1998
"... Motivated by informationtheoretic considerations, we propose a signalling scheme, unitary spacetime modulation, for multipleantenna communication links. This modulation is ideally suited for Rayleigh fastfading environments, since it does not require the receiver to know or learn the propagation ..."
Abstract

Cited by 308 (18 self)
 Add to MetaCart
the propagation coefficients. Unitary spacetime modulation uses constellations of T \cross M spacetime signals {\Phi_l, l= 1,...L},where T represents the coherence interval during which the fading is approximately constant, and M > M . We design some multipleantenna signal constellations and simulate
propagation
, 1998
"... Uncertainty and equifinality in calibrating distributed roughness coefficients in a flood ..."
Abstract
 Add to MetaCart
Uncertainty and equifinality in calibrating distributed roughness coefficients in a flood
Propagation Rate Coefficients of Styrene and
, 1997
"... Introduction. Nearcritical or supercritical carbon dioxide is rapidly becoming an attractive alternative as a continuous phase in homogeneous1 and heterogeneous radical polymerizations.2 A review on chain polymerizations in supercritical fluids appeared recently.3 At ..."
Abstract
 Add to MetaCart
Introduction. Nearcritical or supercritical carbon dioxide is rapidly becoming an attractive alternative as a continuous phase in homogeneous1 and heterogeneous radical polymerizations.2 A review on chain polymerizations in supercritical fluids appeared recently.3 At
4. C. William Gear, Numerical Initial Value Problems in Ordinary Differential Equations, Prentice Hall, 1971. PROCEDURE Consider the modification of the nonlinear Schrödinger equation given by
"... lasers for the case of a nonlinear complexpropagation coefficient, ” J. Opt. Soc. ..."
Abstract
 Add to MetaCart
lasers for the case of a nonlinear complexpropagation coefficient, ” J. Opt. Soc.
Balancing Domain Decomposition
 Comm. Numer. Meth. Engrg
, 1993
"... The NeumannNeumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite element discretizations of difficult problems with strongly discontinuous coefficients [6]. However, this algorithm suffers from the need to sol ..."
Abstract

Cited by 200 (12 self)
 Add to MetaCart
The NeumannNeumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite element discretizations of difficult problems with strongly discontinuous coefficients [6]. However, this algorithm suffers from the need
Bayesian compressive sensing via belief propagation
 IEEE Trans. Signal Processing
, 2010
"... Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, subNyquist signal acquisition. When a statistical characterization of the signal is available, Bayesian inference can comple ..."
Abstract

Cited by 125 (19 self)
 Add to MetaCart
complement conventional CS methods based on linear programming or greedy algorithms. We perform approximate Bayesian inference using belief propagation (BP) decoding, which represents the CS encoding matrix as a graphical model. Fast encoding and decoding is provided using sparse encoding matrices, which
WalkSums and Belief Propagation in Gaussian Graphical Models
 Journal of Machine Learning Research
, 2006
"... We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of variables as a sum over all walks between those variables in the graph. The weight of each walk is given by a product of edg ..."
Abstract

Cited by 101 (16 self)
 Add to MetaCart
of edgewise partial correlation coefficients. This representation holds for a large class of Gaussian graphical models which we call walksummable. We give a precise characterization of this class of models, and relate it to other classes including diagonally dominant, attractive, nonfrustrated
Balancing domain decomposition for problems with large jumps in coefficients
 Math. Comp
, 1996
"... Abstract. The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory introdu ..."
Abstract

Cited by 87 (10 self)
 Add to MetaCart
Abstract. The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory
Results 1  10
of
2,184