paper-with-me

Papers

Radix-2 Self-Recursive Sparse Factorizations of Delay Vandermonde Matrices for Wideband Multi-Beam Antenna Arrays

2022-06-01 · S. M. Perera, A. Madanayake, R. J. Cintra

This paper presents a self-contained factorization for the Vandermonde matrices associated with true-time delay based wideband analog multi-beam beamforming using antenna arrays. The proposed factorization contains sparse and orthogonal matrices. Novel self-recursive radix-2 algorithms for Vandermonde matrices associated with true time delay based delay-sum filterbanks are presented to reduce the circuit complexity of multi-beam analog beamforming systems. The proposed algorithms for Vandermonde matrices by a vector attain $\mathcal{O}(N \log N)$ delay-amplifier circuit counts. Error bounds for the Vandermode matrices associated with true-time delay are established and then analyzed for numerical stability. The potential for real-world circuit implementation of the proposed algorithms will be shown through signal flow graphs that are the starting point for high-frequency analog circuit realizations.

📄 PDF Abstract BibTeX arXiv:2206.00779

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Identification of Butterfly Sparse Matrix Factorizations

2021-10-04 · Léon Zheng, Elisa Riccietti, Rémi Gribonval

Fast transforms correspond to factorizations of the form $\mathbf{Z} = \mathbf{X}^{(1)} \ldots \mathbf{X}^{(J)}$, where each factor $ \mathbf{X}^{(\ell)}$ is sparse and possibly structured. This paper investigates essent…

Testing RadiX-Nets: Advances in Viable Sparse Topologies

2023-11-06 · Kevin Kwak, Zack West, Hayden Jananthan, Jeremy Kepner

The exponential growth of data has sparked computational demands on ML research and industry use. Sparsification of hyper-parametrized deep neural networks (DNNs) creates simpler representations of complex data. Past res…

RadiX-Net: Structured Sparse Matrices for Deep Neural Networks

2019-04-30 · Ryan A. Robinett, Jeremy Kepner

The sizes of deep neural networks (DNNs) are rapidly outgrowing the capacity of hardware to store and train them. Research over the past few decades has explored the prospect of sparsifying DNNs before, during, and after…

Message-Passing GNNs Fail to Approximate Sparse Triangular Factorizations

2025-02-03 · Vladislav Trifonov, Ekaterina Muravleva, Ivan Oseledets

Graph Neural Networks (GNNs) have been proposed as a tool for learning sparse matrix preconditioners, which are key components in accelerating linear solvers. This position paper argues that message-passing GNNs are fund…

Graph Attention

Inverse LDM' and LU Factorizations of a Partitioned Matrix with the Square-root and Division Free Version for V-BLAST

2019-12-10

This letter proposes the inverse LDM' and LU factorizations of a matrix partitioned into 2x2 blocks, which include the square-root and division free version. The proposed squareroot and division free inverse LDM' factori…