Binary MIMO Detection via Homotopy Optimization and Its Deep Adaptation
arXiv:2004.12587 · doi:10.1109/TSP.2020.3048232
Abstract
In this paper we consider maximum-likelihood (ML) MIMO detection under one-bit quantized observations and binary symbol constellations. This problem is motivated by the recent interest in adopting coarse quantization in massive MIMO systems--as an effective way to scale down the hardware complexity and energy consumption. Classical MIMO detection techniques consider unquantized observations, and many of them are not applicable to the one-bit MIMO case. We develop a new non-convex optimization algorithm for the one-bit ML MIMO detection problem, using a strategy called homotopy optimization. The idea is to transform the ML problem into a sequence of approximate problems, from easy (convex) to hard (close to ML), and with each problem being a gradual modification of its previous. Then, our attempt is to iteratively trace the solution path of these approximate problems. This homotopy algorithm is well suited to the application of deep unfolding, a recently popular approach for turning certain model-based algorithms into data-driven, and performance enhanced, ones. While our initial focus is on one-bit MIMO detection, the proposed technique also applies naturally to the classical unquantized MIMO detection. We performed extensive simulations and show that the proposed homotopy algorithms, both non-deep and deep, have satisfactory bit-error probability performance compared to many state-of-the-art algorithms. Also, the deep homotopy algorithm has attractively low computational complexity.
References in corpus (16)
- Adam: A Method for Stochastic Optimization
- TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
- Learning to Optimize: Training Deep Neural Networks for Wireless Resource Management
- Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
- Learning to Detect
- Model-Driven Deep Learning for MIMO Detection
- Bayes-Optimal Joint Channel-and-Data Estimation for Massive MIMO with Low-Precision ADCs
- Massive MIMO with 1-bit ADC
- Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds
- A Framework for One-Bit and Constant-Envelope Precoding over Multiuser Massive MISO Channels
- Deep Learning Based Sphere Decoding
- The ADMM penalized decoder for LDPC codes
- Symbol Error Rate Performance of Box-relaxation Decoders in Massive MIMO
- On Graduated Optimization for Stochastic Non-Convex Problems
- Optimal Data Detection in Large MIMO
- Homotopy Analysis for Tensor PCA