Sparse Array DFT Beamformers for Wideband Sources

Sparse arrays are popular for performance optimization while keeping the hardware and computational costs down. In this paper, we consider sparse arrays design method for wideband source operating in a wideband jamming environment. Maximizing the signal-to-interference plus noise ratio (MaxSINR) is adopted as an optimization objective for wideband beamforming. Sparse array design problem is formulated in the DFT domain to process the source as parallel narrowband sources. The problem is formulated as quadratically constraint quadratic program (QCQP) alongside the weighted mixed $l_{1-\infty}$-norm squared penalization of the beamformer weight vector. The semidefinite relaxation (SDR) of QCQP promotes sparse solutions by iteratively re-weighting beamformer based on previous iteration. It is shown that the DFT approach reduces the computational cost considerably as compared to the delay line approach, while efficiently utilizing the degrees of freedom to harness the maximum output SINR offered by the given array aperture

Adaptive Sparse Array Beamformer Design by Regularized Complementary Antenna Switching

In this work, we propose a novel strategy of adaptive sparse array beamformer design, referred to as regularized complementary antenna switching (RCAS), to swiftly adapt both array configuration and excitation weights in accordance to the dynamic environment for enhancing interference suppression. In order to achieve an implementable design of array reconfiguration, the RCAS is conducted in the framework of regularized antenna switching, whereby the full array aperture is collectively divided into separate groups and only one antenna in each group is switched on to connect with the processing channel. A set of deterministic complementary sparse arrays with good quiescent beampatterns is first designed by RCAS and full array data is collected by switching among them while maintaining resilient interference suppression. Subsequently, adaptive sparse array tailored for the specific environment is calculated and reconfigured based on the information extracted from the full array data. The RCAS is devised as an exclusive cardinality-constrained optimization, which is reformulated by introducing an auxiliary variable combined with a piece-wise linear function to approximate the $l_0$-norm function. A regularization formulation is proposed to solve the problem iteratively and eliminate the requirement of feasible initial search point. A rigorous theoretical analysis is conducted, which proves that the proposed algorithm is essentially an equivalent transformation of the original cardinality-constrained optimization. Simulation results validate the effectiveness of the proposed RCAS strategy

Optimum sparse subarray design for multitask receivers

The problem of optimum sparse array configuration to maximize the beamformer output signal-to-interference plus noise ratio (MaxSINR) in the presence of multiple sources of interest (SOI) has been recently addressed in the literature. In this paper, we consider a shared aperture system where optimum sparse subarrays are allocated to individual SOIs and collectively span the entire full array receiver aperture. Each subarray may have its own antenna type and can comprise a different number of antennas. The optimum joint sparse subarray design for shared aperture based on maximizing the sum of the subarray beamformer SINRs is considered with and without SINR threshold constraints. We utilize Taylor series approximation and sequential convex programming (SCP) techniques to render the initial non-convex optimization a convex problem. The simulation results validate the shared aperture design solutions for MaxSINR for both cases where the number of sparse subarray antennas is predefined or left to comstitute an optimization variable