Performance Analysis of MIMO-MRC in Double-Correlated Rayleigh Environments

We consider multiple-input multiple-output (MIMO) transmit beamforming systems with maximum ratio combining (MRC) receivers. The operating environment is Rayleigh-fading with both transmit and receive spatial correlation. We present exact expressions for the probability density function (p.d.f.) of the output signal-to-noise ratio (SNR), as well as the system outage probability. The results are based on explicit closed-form expressions which we derive for the p.d.f. and c.d.f. of the maximum eigenvalue of double-correlated complex Wishart matrices. For systems with two antennas at either the transmitter or the receiver, we also derive exact closed-form expressions for the symbol error rate (SER). The new expressions are used to prove that MIMO-MRC achieves the maximum available spatial diversity order, and to demonstrate the effect of spatial correlation. The analysis is validated through comparison with Monte-Carlo simulations.Comment: 25 pages. Submitted to the IEEE Transactions on Communication

Multiuser Scheduling in a Markov-modeled Downlink using Randomly Delayed ARQ Feedback

We focus on the downlink of a cellular system, which corresponds to the bulk of the data transfer in such wireless systems. We address the problem of opportunistic multiuser scheduling under imperfect channel state information, by exploiting the memory inherent in the channel. In our setting, the channel between the base station and each user is modeled by a two-state Markov chain and the scheduled user sends back an ARQ feedback signal that arrives at the scheduler with a random delay that is i.i.d across users and time. The scheduler indirectly estimates the channel via accumulated delayed-ARQ feedback and uses this information to make scheduling decisions. We formulate a throughput maximization problem as a partially observable Markov decision process (POMDP). For the case of two users in the system, we show that a greedy policy is sum throughput optimal for any distribution on the ARQ feedback delay. For the case of more than two users, we prove that the greedy policy is suboptimal and demonstrate, via numerical studies, that it has near optimal performance. We show that the greedy policy can be implemented by a simple algorithm that does not require the statistics of the underlying Markov channel or the ARQ feedback delay, thus making it robust against errors in system parameter estimation. Establishing an equivalence between the two-user system and a genie-aided system, we obtain a simple closed form expression for the sum capacity of the Markov-modeled downlink. We further derive inner and outer bounds on the capacity region of the Markov-modeled downlink and tighten these bounds for special cases of the system parameters.Comment: Contains 22 pages, 6 figures and 8 tables; revised version including additional analytical and numerical results; work submitted, Feb 2010, to IEEE Transactions on Information Theory, revised April 2011; authors can be reached at [email protected]/[email protected]/[email protected]

Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling

Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data vector as well as in the regression matrix. However, existing TLS approaches do not account for sparsity possibly present in the unknown vector of regression coefficients. On the other hand, sparsity is the key attribute exploited by modern compressive sampling and variable selection approaches to linear regression, which include noise in the data, but do not account for perturbations in the regression matrix. The present paper fills this gap by formulating and solving TLS optimization problems under sparsity constraints. Near-optimum and reduced-complexity suboptimum sparse (S-) TLS algorithms are developed to address the perturbed compressive sampling (and the related dictionary learning) challenge, when there is a mismatch between the true and adopted bases over which the unknown vector is sparse. The novel S-TLS schemes also allow for perturbations in the regression matrix of the least-absolute selection and shrinkage selection operator (Lasso), and endow TLS approaches with ability to cope with sparse, under-determined "errors-in-variables" models. Interesting generalizations can further exploit prior knowledge on the perturbations to obtain novel weighted and structured S-TLS solvers. Analysis and simulations demonstrate the practical impact of S-TLS in calibrating the mismatch effects of contemporary grid-based approaches to cognitive radio sensing, and robust direction-of-arrival estimation using antenna arrays.Comment: 30 pages, 10 figures, submitted to IEEE Transactions on Signal Processin

Effect of curvature on the backscattering from leaves

Using a model previously developed for the backscattering cross section of a planar leaf at X-band frequencies and above, the effect of leaf curvature is examined. For normal incidence on a rectangular section of a leaf curved in one and two dimensions, an integral expression for the backscattered field is evaluated numerically and by a stationary phase approximation, leading to a simple analytical expression for the cross section reduction produced by the curvature. Numerical results based on the two methods are virtually identical, and in excellent agreement with measured data for rectangular sections of coleus leaves applied to the surfaces of styrofoam cylinders and spheres of different radii

Combined EISCAT radar and optical multispectral and tomographic observations of black aurora

Black auroras are recognized as spatially well-defined regions within a uniform diffuse auroral background where the optical emission is significantly reduced. Black auroras typically appear post-magnetic midnight and during the substorm recovery phase, but not exclusively so. We report on the first combined multimonochromatic optical imaging, bistatic white-light TV recordings and incoherent scatter radar observations of black aurora by EISCAT of the phenomenon. From the relatively larger reduction in luminosity at 4278 Å than at 8446 Å we show that nonsheared black auroras are most probably not caused by downward directed electrical fields at low altitude. From the observations, we determine this by relating the height and intensity of the black aurora to precipitating particle energy within the surrounding background diffuse aurora. The observations are more consistent with an energy selective loss cone. Hence the mechanism causing black aurora is most probably active in the magnetosphere rather than close to Earth

Application of serious games to sport, health and exercise

Use of interactive entertainment has been exponentially expanded since the last decade. Throughout this 10+ year evolution there has been a concern about turning entertainment properties into serious applications, a.k.a "Serious Games". In this article we present two set of Serious Game applications, an Environment Visualising game which focuses solely on applying serious games to elite Olympic sport and another set of serious games that incorporate an in house developed proprietary input system that can detect most of the human movements which focuses on applying serious games to health and exercise

Customizing kernel functions for SVM-based hyperspectral image classification

Previous research applying kernel methods such as support vector machines (SVMs) to hyperspectral image classification has achieved performance competitive with the best available algorithms. However, few efforts have been made to extend SVMs to cover the specific requirements of hyperspectral image classification, for example, by building tailor-made kernels. Observation of real-life spectral imagery from the AVIRIS hyperspectral sensor shows that the useful information for classification is not equally distributed across bands, which provides potential to enhance the SVM's performance through exploring different kernel functions. Spectrally weighted kernels are, therefore, proposed, and a set of particular weights is chosen by either optimizing an estimate of generalization error or evaluating each band's utility level. To assess the effectiveness of the proposed method, experiments are carried out on the publicly available 92AV3C dataset collected from the 220-dimensional AVIRIS hyperspectral sensor. Results indicate that the method is generally effective in improving performance: spectral weighting based on learning weights by gradient descent is found to be slightly better than an alternative method based on estimating ";relevance"; between band information and ground trut

Measurement Bounds for Sparse Signal Ensembles via Graphical Models

In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models, allowing a correlated ensemble of sparse signals to be jointly recovered from a collection of separately acquired compressive measurements. In this paper, we introduce a framework for modeling sparse signal ensembles that quantifies the intra- and inter-signal dependencies within and among the signals. This framework is based on a novel bipartite graph representation that links the sparse signal coefficients with the measurements obtained for each signal. Using our framework, we provide fundamental bounds on the number of noiseless measurements that each sensor must collect to ensure that the signals are jointly recoverable.Comment: 11 pages, 2 figure

Optimal Timer Based Selection Schemes

Timer-based mechanisms are often used to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a monotone non-increasing function of its local suitability metric. The best node is selected successfully if no other node's timer expires within a 'vulnerability' window after its timer expiry, and so long as the sink can hear the available nodes. In this paper, we show that the optimal metric-to-timer mapping that (i) maximizes the probability of success or (ii) minimizes the average selection time subject to a minimum constraint on the probability of success, maps the metric into a set of discrete timer values. We specify, in closed-form, the optimal scheme as a function of the maximum selection duration, the vulnerability window, and the number of nodes. An asymptotic characterization of the optimal scheme turns out to be elegant and insightful. For any probability distribution function of the metric, the optimal scheme is scalable, distributed, and performs much better than the popular inverse metric timer mapping. It even compares favorably with splitting-based selection, when the latter's feedback overhead is accounted for.Comment: 21 pages, 6 figures, 1 table, submitted to IEEE Transactions on Communications, uses stackrel.st

Solution of a second order difference equation using the bilinear relations of Riemann

A recently proposed technique to solve a class of second order functional difference equations arising in electromagnetic diffraction theory is further investigated by applying it to a case of intermediate complexity. The proposed approach is conceptually simple and relies on first obtaining well-defined branched solutions to a pair of associated first order difference equations. The construction of these branched expressions leads to an equation system whose solution requires relationships akin to Riemann’s bilinear relations for differentials of the first and third kinds; their derivation necessitates the application of Cauchy’s theorem on Riemann surfaces of, in this particular instance, genera one and three. Branch-free solutions of the second order difference equation are then obtained by taking appropriate linear combinations of the branched solutions of the first order equations. Analysis and computation demonstrate that the resulting expressions have the desired analytical properties and recover known solutions in the appropriate limit. © 2002 American Institute of Physics.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/71093/2/JMAPAQ-43-3-1598-1.pd