A Low-Complexity Blind Iterative Projections Approach for Beamforming and Channel Estimation

We propose a novel data-driven approach for beam-forming and channel estimation based on a computationally efficient alternative projections method. Unlike traditional blind beamforming techniques, our method does not require training symbols or specific signal properties such as constant modulus or finite-alphabet symbols. This makes our proposed approach more versatile and robust. Our approach is provably convergent, unlike algorithms such as the Least Means Squares that can diverge if the step size parameter is not properly chosen. Additionally, our method converges to the optimal eigenvector solution as the batch size increases. We show that the iterations can be drastically reduced, and the performance can be enhanced in a static channel by initializing the algorithm with the estimate formed at the prior batch. Through rigorous analysis and simulations, we demonstrate the effectiveness of our proposed method.

Authors

Institutions

Publication Details

Published
2025-03-06
DOI
https://doi.org/10.1109/ncc63735.2025.10983243
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Low-Complexity Blind Iterative Projections Approach for Beamforming and Channel Estimation

Jeffrey H. Reed, Yash Vasavada, Aarushi Dhami
Speech and Audio Processing
article

A Low-Complexity Blind Iterative Projections Approach for Beamforming and Channel Estimation

Jeffrey H. Reed, Yash Vasavada, Aarushi Dhami
article en

Abstract

We propose a novel data-driven approach for beam-forming and channel estimation based on a computationally efficient alternative projections method. Unlike traditional blind beamforming techniques, our method does not require training symbols or specific signal properties such as constant modulus or finite-alphabet symbols. This makes our proposed approach more versatile and robust. Our approach is provably convergent, unlike algorithms such as the Least Means Squares that can diverge if the step size parameter is not properly chosen. Additionally, our method converges to the optimal eigenvector solution as the batch size increases. We show that the iterations can be drastically reduced, and the performance can be enhanced in a static channel by initializing the algorithm with the estimate formed at the prior batch. Through rigorous analysis and simulations, we demonstrate the effectiveness of our proposed method.

Virginia Tech (US), Dhirubhai Ambani University (IN)
Climate action
Openalex Percentile: Top 89%
Speech and Audio Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.