Fast Blind MIMO Decoding through Vertex Hopping

TL;DR

This paper introduces a fast, practical algorithm for blind MIMO decoding that estimates data symbols without channel information, achieving near-optimal error rates and real-time performance in typical systems.

Contribution

It presents a novel algorithm that efficiently solves the non-convex blind decoding problem using linear programming techniques, enabling real-time applications.

Findings

Error performance close to zero-forcing with perfect CSI

Algorithm suitable for real-time decoding in modest-sized MIMO systems

Empirical results demonstrate practical efficiency and accuracy

Abstract

We present an algorithm that efficiently performs blind decoding of MIMO signals. That is, given no channel state information (CSI) at either the transmitter or receiver, our algorithm takes a block of samples and returns an estimate of the underlying data symbols. In prior work, the problem of blind decoding was formulated as a non-convex optimization problem. In this work, we present an algorithm that efficiently solves this non-convex problem in practical settings. This algorithm leverages concepts of linear and mixed-integer linear programming. Empirically, we show that our technique has an error performance close to that of zero-forcing with perfect CSI at the receiver. Initial estimates of the runtime of the algorithm presented in this work suggest that the real-time blind decoding of MIMO signals is possible for even modest-sized MIMO systems.