In multiple-input multiple-output radar systems, it is usually desirable to steer transmitted power in the region-of-interest. To do this, conventional methods optimize the waveform covariance matrix, R, for the desired beampattern, which is then used to generate actual transmitted waveforms. Both steps require constrained optimization, therefore, use iterative and expensive algorithms. In this paper, we provide a closed-form solution to design covariance matrix for the given beampattern using the planar array, which is then used to derive a novel closed-form algorithm to directly design the finite-alphabet constant-envelope (FACE) waveforms. The proposed algorithm exploits the two-dimensional fast-Fourier-transform. The performance of our proposed algorithm is compared with existing methods that are based on semi-definite quadratic programming with the advantage of a considerably reduced complexity.

Simulators capable of computing scattered fields from objects of uncertain shapes are highly useful in electromagnetics and photonics, where device designs are typically subject to fabrication tolerances. Knowledge of statistical variations in scattered fields is useful in ensuring error-free functioning of devices. Oftentimes such simulators use a Monte Carlo (MC) scheme to sample the random domain, where the variables parameterize the uncertainties in the geometry. At each sample, which corresponds to a realization of the geometry, a deterministic electromagnetic solver is executed to compute the scattered fields. However, to obtain accurate statistics of the scattered fields, the number of MC samples has to be large. This significantly increases the total execution time. In this work, to address this challenge, the Multilevel MC (MLMC [1]) scheme is used together with a (deterministic) surface integral equation solver. The MLMC achieves a higher efficiency by “balancing” the statistical errors due to sampling of the random domain and the numerical errors due to discretization of the geometry at each of these samples. Error balancing results in a smaller number of samples requiring coarser discretizations. Consequently, total execution time is significantly shortened.

We consider secret-key agreement with public discussion over Rayleigh fastfading channels with transmit correlation. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the transmit correlation matrix. First, We derive the expression of the key capacity under the considered setup. Then, we show that the optimal transmit strategy achieving the key capacity consists in transmitting Gaussian signals along the eingenvectors of the channel covariance matrix. The powers allocated to each channel mode are determined as the solution of a numerical optimization problem that we derive. We also provide a waterfilling interpretation of the optimal power allocation. Finally, we develop a necessary and sufficient condition for beamforming to be optimal, i.e., transmitting along the strongest channel mode only is key capacity-achieving.

Estimating the probability that a sum of random variables (RVs) exceeds a given threshold is a well-known challenging problem. Closed-form expressions for the sum distribution do not generally exist, which has led to an increasing interest in simulation approaches. A crude Monte Carlo (MC) simulation is the standard technique for the estimation of this type of probability. However, this approach is computationally expensive, especially when dealing with rare events. Variance reduction techniques are alternative approaches that can improve the computational efficiency of naive MC simulations. We propose an Importance Sampling (IS) simulation technique based on the well-known hazard rate twisting approach, that presents the advantage of being asymptotically optimal for any arbitrary RVs. The wide scope of applicability of the proposed method is mainly due to our particular way of selecting the twisting parameter. It is worth observing that this interesting feature is rarely satisfied by variance reduction algorithms whose performances were only proven under some restrictive assumptions. It comes along with a good efficiency, illustrated by some selected simulation results comparing the performance of our method with that of an algorithm based on a conditional MC technique.

A hybrid electromagnetics (EM)-circuit simulator for analyzing complex systems consisting of EM devices loaded with nonlinear multi-port lumped circuits is described. The proposed scheme splits the computational domain into two subsystems: EM and circuit subsystems, where field interactions are modeled using Maxwell and Kirchhoff equations, respectively. Maxwell equations are discretized using a discontinuous Galerkin time domain (DGTD) scheme while Kirchhoff equations are discretized using a modified nodal analysis (MNA)-based scheme. The coupling between the EM and circuit subsystems is realized at the lumped ports, where related EM fields and circuit voltages and currents are allowed to “interact’’ via numerical flux. To account for nonlinear lumped circuit elements, the standard Newton-Raphson method is applied at every time step. Additionally, a local time-stepping scheme is developed to improve the efficiency of the hybrid solver. Numerical examples consisting of EM systems loaded with single and multiport linear/nonlinear circuit networks are presented to demonstrate the accuracy, efficiency, and applicability of the proposed solver.

In energy harvesting communications, the transmitters have to adapt transmission to availability of energy harvested during the course of communication. The performance of the transmission depends on the channel conditions which vary randomly due to mobility and environmental changes. In this work, we consider the problem of power allocation taking into account the energy arrivals over time and the degree of channel state information (CSI) available at the transmitter, in order to maximize the throughput. In this work, the CSI at the transmitter is not perfect and may include estimation errors. We solve this problem with respect to the causality and energy storage constraints. We determine the optimal offline policy in the case where the channel is assumed to be perfectly known at the receiver. Different cases of CSI availability are studied for the transmitter. We obtain the power policy when the transmitter has either perfect CSI or no CSI. We also investigate of utmost interest the case of fading channels with imperfect CSI. Furthermore, we analyze the asymptotic average throughput in a system where the average recharge rate goes asymptotically to zero and when it is very high.

When marrying randomized distributed space-time coding (RDSTC) to geographical routing, new performance horizons can be created. In order to reach those horizons however, routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geographical routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes.