Department Publications

In this paper, we address the problem of direction of arrival (DOA) estimation for multiple targets in the presence of sensor failures in a sparse array. Generally, sparse arrays are known with very high-resolution capabilities, where N physical sensors can resolve up to uncorrelated sources. However, among the many configurations introduced in the literature, the arrays that provide the largest hole-free co-array are the most susceptible to sensor failures. We propose here two machine learning (ML) methods to mitigate the effect of sensor failures and maintain the DOA estimation performance and resolution. The first method enhances the conventional spatial smoothing using deep neural network (DNN), while the second one is an end-to-end data-driven method. Numerical results show that both approaches can significantly improve the performance of MRA with two failed sensors. The data-driven method can …

A low-complexity multibeamforming scheme for uniform linear arrays is proposed based on warped and approximated discrete Fourier transform (DFT), albeit in the spatial domain. Conventional DFT- and approximated-DFT-based multibeamformers provide a low-complexity alternatives to produce multiple simultaneous beams with fixed beam profiles. The proposed approach aims to produce configurable (i.e., steerable) multibeam profiles using the warped DFT. Design examples are presented for an 8-element uniform linear array verifying, 81% and 18 % reduction in multiplier and adder complexities, respectively, when compared to a conventional narrowband multibeamformer having dedicated steering weights for each beam. Three system configurations are proposed using approximations for warped transform and the DFT. Hardware designs implemented on Xilinx Ultrascale KCU105 FPGA device verify 5.2 …

Broadband beamformers designed as two-dimensional (2-D) spatially-interpolated finite-extent impulse responses (FIR) filters, using a cascade structure, cannot employ sparse linear arrays despite significantly reducing the computational complexity. This happens due to the fact that the 2-D masking filter requires spatial samples equal to the spatial order at the input. Therefore, the output of the 2-D spatially-interpolated prototype filter should be computed for more than one spatial index. In order to address this limitation, we propose a 2-D spatially-interpolated FIR filter using a parallel structure. With the proposed structure, both 2-D spatially-interpolated prototype filter and the 2-D masking filter need to compute the output only for one spatial index, therefore allowing to employ sparse linear arrays. In order to support broadband beamforming, we design the 2-D FIR filter to have a parallelogram passband …

The use of approximate transforms in conjunction with approximate adder hardware is explored towards implementing low-complexity multi-beam antenna arrays. The use of approximate adders is motivated by the efficient look up table (LUT) usage on field programmable gate arrays (FPGA) resulting in better area and time complexities on hardware. 8-beam and 16-beam hardware architectures for multi-beamforming are designed using previously reported 8-point and 16-point spatial approximate-DFT (ADFT) algorithms, respectively, albeit with approximate adders. Designs have been implemented on Xilinx Kintex UltraScale KCU105 FPGA device verifying 31.5% reduction in (FPGA) LUT count and 58.08% improvement in critical path delay with a maximum beam error of 0.6 degrees and maximum peak side lobe level deviation 0.21 dB for the 8-beam case, when compared to ADFT with accurate adders with the …