Sparse Millimeter Wave Channel Estimation From Partially Coherent Measurements
W. Yi (TU Delft - Electrical Engineering, Mathematics and Computer Science)
A-J. van der van der Veen – Mentor (TU Delft - Signal Processing Systems)
Nitin Myers – Graduation committee member (TU Delft - Team Nitin Myers)
G. Joseph – Graduation committee member (TU Delft - Signal Processing Systems)
Peyman Mohajerin Esfahani – Coach (TU Delft - Team Peyman Mohajerin Esfahani)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This project develops a channel estimation technique for millimeter wave (mmWave) communication systems. Our method exploits the sparse structure in mmWave channels for low training overhead and accounts for the phase errors in the channel measurements due to phase noise at the oscillator. Specifically, in IEEE 802.11ad/ay-based mmWave systems, the phase errors within a beam refinement protocol packet are almost the same, while the errors across different packets are substantially different.
We show that standard compressed sensing algorithms that treat phase noise as a constant fail when channel measurements are acquired over multiple beam refinement protocol packets. Most of the methods that have addressed this problem treat phase noise as purely random, missing the inherent structure within the measurement packets. We present a novel algorithm called partially coherent matching pursuit for sparse channel estimation under practical phase noise perturbations. The proposed approach leverages this partially coherent structure in the phase errors across multiple packets. Our algorithm iteratively detects the support of sparse signal and employs alternating minimization to jointly estimate the signal and the phase errors.
We numerically show that our algorithm can reconstruct the channel accurately at a lower complexity than the benchmarks, and derive a preliminary support detection bound as a performance guarantee.