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

  title={Radix-2 Self-Recursive Sparse Factorizations of Delay Vandermonde Matrices for Wideband Multi-Beam Antenna Arrays},
  author={Sirani M. Perera and Arjuna Madanayake and Renato J. Cintra},
  journal={IEEE Access},
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… 

Tables from this paper

Beamspace Channel Estimation for Wideband Millimeter-Wave MIMO: A Model-Driven Unsupervised Learning Approach

A model-driven unsupervised learning network, named learned denoising-based generalized expectation consistent (LDGEC) signal recovery network, which significantly outperforms state-of-the-art compressive sensing-based algorithms when the receiver is equipped with a small number of RF chains and low-resolution ADCs.

An Overview of Signal Processing Techniques for Terahertz Communications

This tutorial overviews classical problems of waveform design and modulation, beamforming and precoding, index modulation, channel estimation, channel coding, and data detection in THz transceiver design, and focuses on ultramassive multiple-input–multiple-output (UM-MIMO) systems and reconfigurable intelligent surfaces.

SIABR: A Structured Intra-Attention Bidirectional Recurrent Deep Learning Method for Ultra-Accurate Terahertz Indoor Localization

A Structured Intra-Attention Bidirectional Recurrent (SIABR) deep learning method is proposed to solve the CSI-based three-dimensional (3D) THz indoor localization problem with significantly improved accuracy.

Channel Estimation and Hybrid Combining for Wideband Terahertz Massive MIMO Systems

This work introduces a low-complexity beam squint mitigation scheme based on true-time-delay and proposes a novel variant of the popular orthogonal matching pursuit (OMP) algorithm to accurately estimate the channel with low training overhead.

Ultramassive MIMO Systems at Terahertz Bands: Prospects and Challenges

A holistic overview of THz UM-MIMO systems, which assess recent advancements in transceiver design and channel modeling and discuss the major challenges and shortcomings of such designs by deriving the relationships among communication range, array dimensions, and system performance.

Ultra-Massive MIMO Systems at Terahertz Bands: Prospects and Challenges.

Prospective use cases that can bring THz UM-MIMO into reality in the context of sensing, data centers, cell-free systems, and mid-range wireless communications are highlighted.



Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays

A self-contained factorization for the delay Vandermonde matrix (DVM), which is the super class of the discrete Fourier transform, using sparse and companion matrices is presented, in order to derive a low arithmetic complexity DVM algorithm.

Wideband $N$-Beam Arrays Using Low-Complexity Algorithms and Mixed-Signal Integrated Circuits

Mixed-signal CMOS integrated circuits designs are proposed for the implementation of DVM multibeam algorithms along with low-complexity digital realizations to achieve hybrid beamforming for mmW applications.

Design methodology of an analog 9-beam squint-free wideband IF multi-beamformer for mmW applications

The proposed multi-beam algorithm and circuit structure is simulated within the frequency range 55–65 GHz to demonstrate squinting-free wide-band multi-beams at millimeter wave carrier frequencies for emerging 5G applications.

Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

Effective algorithms for computing the Vandermonde determinant and the determination of a Cauchy matrix and in a number of cases they improve the known estimates.

Fast approximate computations with Cauchy matrices and polynomials

  • V. Pan
  • Computer Science, Mathematics
    Math. Comput.
  • 2017
This work transforms an n-by-n Vandermonde matrix into a Cauchy structured matrix with some special features and approximate the matrix by a generalized hierarchically semiseparable matrix, which is a structured matrix of a different class.

Computational Frameworks for the Fast Fourier Transform

The Radix-2 Frameworks, a collection of general and high performance FFTs designed to solve the multi-Dimensional FFT problem of Prime Factor and Convolution, are presented.

Lower bounds for the condition number of Vandermonde matrices

SummaryWe derive lower bounds for the ∞-condition number of then×n-Vandermonde matrixVn(x) in the cases where the node vectorxT=[x1, x2,...,xn] has positive elements or real elements located

How Bad Are Vandermonde Matrices?

  • V. Pan
  • Computer Science, Mathematics
    SIAM J. Matrix Anal. Appl.
  • 2016
It is proved that any Vandermonde matrix of a large size is badly ill-conditioned unless its knots are more or less equally spaced on or about the circle $C(0,1)=\{x:\,|x|=1\}$.

Complexity of multiplication with vectors for structured matrices

Symmetric functions and the Vandermonde matrix