Triplet-Based Wireless Channel Charting: Architecture and Experiments
Paul Ferrand, Alexis Decurninge, Luis G. Ordo\~nez, Maxime, Guillaud

TL;DR
This paper introduces a triplet-based approach for wireless channel charting that uses self-supervised learning to reduce data dimensionality and extract meaningful features, validated through extensive experiments on Massive MIMO data.
Contribution
It presents a novel triplet-based algorithm for channel charting that learns similarity metrics and performs dimensionality reduction without supervision, with variations including semi-supervised methods.
Findings
The channel chart closely correlates with user location information.
The approach effectively reduces data dimensionality while preserving meaningful relationships.
Semi-supervised variations improve chart accuracy with partial labels.
Abstract
Channel charting is a data-driven baseband processing technique consisting in applying self-supervised machine learning techniques to channel state information (CSI), with the objective of reducing the dimension of the data and extracting the fundamental parameters governing its distribution. We introduce a novel channel charting approach based on triplets of samples. The proposed algorithm learns a meaningful similarity metric between CSI samples on the basis of proximity in their respective acquisition times, and simultaneously performs dimensionality reduction. We present an extensive experimental validation of the proposed approach on data obtained from a commercial Massive MIMO system; in particular, we evaluate to which extent the obtained channel chart is similar to the user location information, although it is not supervised by any geographical data. Finally, we propose and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
