Design of Wideband Multifunction Antenna Array Based on Multiple Interleaved Subarrays

A new Modified Iterative Fourier Technique (MIFT) is proposed for the design of interleaved linear antenna arrays which operate at different frequencies with no grating lobes, low-sidelobe levels, and wide bandwidths. In view of the Fourier transform mapping between the element excitations and array factor of uniform linear antenna array, the spectrum of the array factor is first acquired with FFT and its energy distributions are investigated thoroughly. The relationship between the carrier frequency and the element excitation is obtained by the density-weighting theory. In the following steps, the element excitations of interleaved subarrays are carefully selected in an alternate manner, which ensures that similar patterns can be achieved for interleaved subarrays. The Peak Sidelobe Levels (PSLs) of the interleaved subarrays are further reduced by the iterative Fourier transform algorithm. Numerical simulation results show that favorable design of the interleaved linear antenna arrays with different carrier frequencies can be obtained by the proposed method with favorable pattern similarity, low PSL, and wide bandwidths

Thinned Virtual Array for Cramer Rao Bound Optimization in MIMO Radar

By transmitting multiple independent waveforms at the transmit side and processing echoes of spatial targets at the receive side, Multiple Input Multiple Output (MIMO) radar enjoys virtual array aperture expansion and more degree of freedom (DOF), both of which favors the application of direction finding or estimation of direction of arrival (DOA). The expanded virtual aperture provides higher angular resolution which also promotes the precision of DOA estimation, and the extra DOF brought by waveform diversity can be leveraged to focus energy in certain spatial region for better direction-finding capacity. However, beamspace methods which match certain beampatterns suffer from deteriorated performance and complexity in implementation, and the advantage of virtual array aperture is limited by its virtual element redundancy. As an important performance indicator of DOA estimation, Cramer–Rao Bound (CRB) is closely connected to the array configuration of the system. To reduce the complexity of the system and improve CRB performance at the same time, in this paper, the virtual array of MIMO radar is designed directly by selecting outputs from matched filters at the receive side. For the sake of fair comparison, both scenarios with and without priori directions are considered to obtain optimized virtual array configuration, respectively. The original combinatorial problems are approximated by sequential convex approximations methods which produce solutions with efficiency. Numerical results demonstrate that the proposed method can provide thinned virtual arrays with excellent CRB performance

Data-Driven and Low-Sparsity False Data Injection Attacks in Smart Grid

Recent researches on data-driven and low-sparsity data injection attacks have been presented, respectively. To combine the two main goals (data-driven and low-sparsity) of research, this paper presents a data-driven and low-sparsity false data injection attack strategy. The proposed attacking strategy (EID: Eliminate-Infer-Determine) is divided into three stages. In the first step, the intercepted data is preprocessed by sparse optimization techniques to eliminate the outliers. The recovered data is then exploited to learn about the system matrix based on the parallel factorization algorithm in the second step. In the third step, the approximated system matrix is applied for the design of sparse attack vector based on the convex optimization. The simulation results show that the EID attack strategy achieves a better performance than the improved ICA-based attack strategy in constructing perfect sparse attack vectors. What is more, data-driven implementation of the proposed strategy is also presented which ensures attack performance even without the prior information of the system

The expansion of a single point CTV.

<p>The expansion of a single point CTV.</p

Agent-based Markets: Equilibrium Strategies and Robustness

Agent-based modelling (ABM) is broadly adopted to empirically study the market microstructure. Researchers set up market mechanisms and behaviour rules for participating traders, modelled as agents, and observe the simulation results. However, these results can qualitatively change if trader incentives are ignored - an equilibrium analysis is key to ABM. Empirical game-theoretic analysis (EGTA) is widely adopted to compute the equilibria of these agent-based markets. In this paper, we investigate the equilibrium strategy profiles, including their induced market performance, and their robustness to different simulation parameters. For two mainstream trading mechanisms, continuous double auctions and call markets, we find that EGTA is needed for solving the game as pure strategies are not a good approximation of the equilibrium. Moreover, EGTA gives generally sound and robust solutions regarding different market and model setups, with the notable exception of agents' risk attitude. We also consider heterogeneous EGTA, a more realistic generalisation of EGTA whereby traders can modify their strategies during the simulation, and show that fixed strategies lead to sufficiently good analyses, especially taking the computation cost into the consideration

Call Markets With Adaptive Clearing Intervals

Trading mechanisms play a fundamental role in the health of financial markets. For example, it is believed that continuous double auctions constitute fertile soil for predatory behaviour and toxic order flows. To this end, frequent call markets have been proposed as an alternative design choice to address the latency arbitrage opportunities built in those markets. This paper studies the extent to which adaptive rules to define the length of the clearing intervals affect the performance of frequent call markets

The values for spherical and cylindrical concave regions of CTVs.

<p>The values for spherical and cylindrical concave regions of CTVs.</p