mlsanityData to 7 Oct 2026

A Low-complexity Structured Neural Network Approach to Intelligently Realize Wideband Multi-beam Beamformers

arXiv 2503.20694 ↗First posted 26 Mar 2025cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

True-time-delay (TTD) beamformers can produce wideband, squint-free beams in both analog and digital signal domains, unlike frequency-dependent FFT beams. Our previous work showed that TTD beamformers can be efficiently realized using the elements of delay Vandermonde matrix (DVM), answering the longstanding beam-squint problem. Thus, building on our work on classical algorithms based on DVM, we propose neural network (NN) architecture to realize wideband multi-beam beamformers using structure-imposed weight matrices and submatrices. The structure and sparsity of the weight matrices and submatrices are shown to reduce the space and computational complexities of the NN greatly. The proposed network architecture has O(pLM logM) complexity compared to a conventional fully connected L-layers network with O(M2L) complexity, where M is the number of nodes in each layer of the network, p is the number of submatrices per layer, and M >> p. We will show numerical simulations in the 24 GHz to 32 GHz range to demonstrate the numerical feasibility of realizing wideband multi-beam beamformers using the proposed neural architecture. We also show the complexity reduction of the proposed NN and compare that with fully connected NNs, to show the efficiency of the proposed architecture without sacrificing accuracy. The accuracy of the proposed NN architecture was shown using the mean squared error, which is based on an objective function of the weight matrices and beamformed signals of antenna arrays, while also normalizing nodes. The proposed NN architecture shows a low-complexity NN realizing wideband multi-beam beamformers in real-time for low-complexity intelligent systems.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 43 references that are in the map. First posted on arXiv 26 Mar 2025.

Builds on

11 of 43 references.

References · 11

  1. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  2. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  3. 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 427
  4. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  5. 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
  6. 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
  7. 2022Exploring Low Rank Training of Deep Neural Networkscited by 30
  8. 2017Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rankcited by 11
  9. 2019CircConv: A Structured Convolution with Low Complexitycited by 8
  10. 2022Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrayscited by 1
  11. 2022Radix-2 Self-Recursive Sparse Factorizations of Delay Vandermonde Matrices for Wideband Multi-Beam Antenna Arrayscited by 1

Built on by

Not cited yet.