Precoder design for space-time coded systems over correlated Rayleigh fading channels using convex optimization

A class of computationally efficient linear precoders for space-time block coded multiple-input multiple-output wireless systems is derived based on the minimization of the exact symbol error rate (SER) and its upper bound. Both correlations at the transmitter and receiver are assumed to be present, and only statistical channel state information in the form of the transmit and receive correlation matrices is assumed to be available at the transmitter. The convexity of the design based on SER minimization is established and exploited. The advantage of the developed technique is its low complexity. We also find various relationships of the proposed designs to the existing precoding techniques, and derive very simple closed-form precoders for special cases such as two or three receive antennas and constant receive correlation. The numerical simulations illustrate the excellent SER performance of the proposed precoders

Spectrum Sharing in Wireless Networks via QoS-Aware Secondary Multicast Beamforming

Secondary spectrum usage has the potential to considerably increase spectrum utilization. In this paper, quality-of-service (QoS)-aware spectrum underlay of a secondary multicast network is considered. A multiantenna secondary access point (AP) is used for multicast (common information) transmission to a number of secondary single-antenna receivers. The idea is that beamforming can be used to steer power towards the secondary receivers while limiting sidelobes that cause interference to primary receivers. Various optimal formulations of beamforming are proposed, motivated by different ldquocohabitationrdquo scenarios, including robust designs that are applicable with inaccurate or limited channel state information at the secondary AP. These formulations are NP-hard computational problems; yet it is shown how convex approximation-based multicast beamforming tools (originally developed without regard to primary interference constraints) can be adapted to work in a spectrum underlay context. Extensive simulation results demonstrate the effectiveness of the proposed approaches and provide insights on the tradeoffs between different design criteria

Power allocation in wireless multi-user relay networks

In this paper, we consider an amplify-and-forward wireless relay system where multiple source nodes communicate with their corresponding destination nodes with the help of relay nodes. Conventionally, each relay equally distributes the available resources to its relayed sources. This approach is clearly sub-optimal since each user experiences dissimilar channel conditions, and thus, demands different amount of allocated resources to meet its quality-of-service (QoS) request. Therefore, this paper presents novel power allocation schemes to i) maximize the minimum signal-to-noise ratio among all users; ii) minimize the maximum transmit power over all sources; iii) maximize the network throughput. Moreover, due to limited power, it may be impossible to satisfy the QoS requirement for every user. Consequently, an admission control algorithm should first be carried out to maximize the number of users possibly served. Then, optimal power allocation is performed. Although the joint optimal admission control and power allocation problem is combinatorially hard, we develop an effective heuristic algorithm with significantly reduced complexity. Even though theoretically sub-optimal, it performs remarkably well. The proposed power allocation problems are formulated using geometric programming (GP), a well-studied class of nonlinear and nonconvex optimization. Since a GP problem is readily transformed into an equivalent convex optimization problem, optimal solution can be obtained efficiently. Numerical results demonstrate the effectiveness of our proposed approach

On the 3-D structure and dissipation of reconnection-driven flow-bursts

The structure of magnetic reconnection-driven outflows and their dissipation are explored with large-scale, 3-D particle-in-cell (PIC) simulations. Outflow jets resulting from 3-D reconnection with a finite length x-line form fronts as they propagate into the downstream medium. A large pressure increase ahead of this ``reconnection jet front'' (RJF), due to reflected and transmitted ions, slows the front so that its velocity is well below the velocity of the ambient ions in the core of the jet. As a result, the RJF slows and diverts the high-speed flow into the direction perpendicular to the reconnection plane. The consequence is that the RJF acts as a thermalization site for the ion bulk flow and contributes significantly to the dissipation of magnetic energy during reconnection even though the outflow jet is subsonic. This behavior has no counterpart in 2-D reconnection. A simple analytic model predicts the front velocity and the fraction of the ion bulk flow energy that is dissipated

Racing Multi-Objective Selection Probabilities

In the context of Noisy Multi-Objective Optimization, dealing with uncertainties requires the decision maker to define some preferences about how to handle them, through some statistics (e.g., mean, median) to be used to evaluate the qualities of the solutions, and define the corresponding Pareto set. Approximating these statistics requires repeated samplings of the population, drastically increasing the overall computational cost. To tackle this issue, this paper proposes to directly estimate the probability of each individual to be selected, using some Hoeffding races to dynamically assign the estimation budget during the selection step. The proposed racing approach is validated against static budget approaches with NSGA-II on noisy versions of the ZDT benchmark functions

On the Cause of Supra-Arcade Downflows in Solar Flares

A model of supra-arcade downflows (SADs), dark low density regions also known as tadpoles that propagate sunward during solar flares, is presented. It is argued that the regions of low density are flow channels carved by sunward-directed outflow jets from reconnection. The solar corona is stratified, so the flare site is populated by a lower density plasma than that in the underlying arcade. As the jets penetrate the arcade, they carve out regions of depleted plasma density which appear as SADs. The present interpretation differs from previous models in that reconnection is localized in space but not in time. Reconnection is continuous in time to explain why SADs are not filled in from behind as they would if they were caused by isolated descending flux tubes or the wakes behind them due to temporally bursty reconnection. Reconnection is localized in space because outflow jets in standard two-dimensional reconnection models expand in the normal (inflow) direction with distance from the reconnection site, which would not produce thin SADs as seen in observations. On the contrary, outflow jets in spatially localized three-dimensional reconnection with an out-of-plane (guide) magnetic field expand primarily in the out-of-plane direction and remain collimated in the normal direction, which is consistent with observed SADs being thin. Two-dimensional proof-of-principle simulations of reconnection with an out-of-plane (guide) magnetic field confirm the creation of SAD-like depletion regions and the necessity of density stratification. Three-dimensional simulations confirm that localized reconnection remains collimated.Comment: 16 pages, 5 figures, accepted to Astrophysical Journal Letters in August, 2013. This version is the accepted versio

Network Lifetime Maximization With Node Admission in Wireless Multimedia Sensor Networks

Wireless multimedia sensor networks (WMSNs) are expected to support multimedia services such as delivery of video and audio streams. However, due to the relatively stringent quality-of-service (QoS) requirements of multimedia services (e.g., high transmission rates and timely delivery) and the limited wireless resources, it is possible that not all the potential sensor nodes can be admitted into the network. Thus, node admission is essential for WMSNs, which is the target of this paper. Specifically, we aim at the node admission and its interaction with power allocation and link scheduling. A cross-layer design is presented as a two-stage optimization problem, where at the first stage the number of admitted sensor nodes is maximized, and at the second stage the network lifetime is maximized. Interestingly, it is proved that the two-stage optimization problem can be converted to a one-stage optimization problem with a more compact and concise mathematical form. Numerical results demonstrate the effectiveness of the two-stage and one-stage optimization frameworks