skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 2347220

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. The article examines neural network learning of the sparse array configurations in optimum beamforming. Unlike iterative greedy, convex, and global optimization methods for optimum array design, deep learning enables fast reconfigurations of the sparse array in rapid dynamic propagation environments. We employ three different convolutional neural network architectures with varying simplification and parameter counts. The network is trained to select M out of N uniformly spaced antennas to achieve maximum signal-to-interference and noise ratio (SINR) beamforming. Different values of M are considered, including N = 2 M, for studying network performance under an increased number of subarray classes. We consider one desired source and one interference of arbitrary angle, and delineate the learning results for the two cases where the network is trained with the desired source assuming fixed and varying angles. We discuss the benefits of reducing the number of possible configurations due to sidelobe level reductions. It is also shown that the network performance significantly improves with data augmentations and by removing redundant array configurations which produce the same SINR. 
    more » « less
    Free, publicly-accessible full text available June 1, 2026
  2. Free, publicly-accessible full text available May 3, 2026