One-Bit Sphere Decoding for Uplink Massive MIMO Systems With One-Bit ADCs
TLDR
In this paper, a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit sphere decoding for an uplink massive MIMO system with one bit analog-to-digital converters is proposed.Abstract:
This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit sphere decoding for an uplink massive multiple-input multiple-output system with one-bit analog-to-digital converters. The idea of the proposed algorithm is to estimate the transmitted symbol vector sent by uplink users (a codeword vector) by searching over a sphere, which contains a collection of codeword vectors close to the received signal vector at the base station in terms of a weighted Hamming distance . To reduce the computational complexity for the construction of the sphere, the proposed algorithm divides the received signal vector into multiple subvectors each with a reduced dimension. Then, it generates multiple spheres in parallel, where each sphere is centered at the subvector and contains a list of subcodeword vectors. The detection performance of the proposed algorithm is also analyzed by characterizing the probability that the proposed algorithm performs worse than the MLD. The analysis shows how the dimension of each sphere and the size of the subcodeword list are related to the performance-complexity tradeoff achieved by the proposed algorithm. Simulation results demonstrate that the proposed algorithm achieves near-MLD performance, while reducing the computational complexity compared to the existing MLD method.read more
Citations
More filters
Journal ArticleDOI
Massive MIMO Systems for 5G and Beyond Networks-Overview, Recent Trends, Challenges, and Future Research Direction.
Robin Chataut,Robert Akl +1 more
TL;DR: This paper presents a comprehensive overview of the key enabling technologies required for 5G and 6G networks, highlighting the massive MIMO systems and discusses all the fundamental challenges related to pilot contamination, channel estimation, precoding, user scheduling, energy efficiency, and signal detection.
Journal ArticleDOI
Supervised-Learning-Aided Communication Framework for MIMO Systems With Low-Resolution ADCs
TL;DR: Simulations demonstrate the detection error reduction of the proposed framework compared to conventional detection techniques that are based on channel estimation.
Journal ArticleDOI
Overview of Precoding Techniques for Massive MIMO
TL;DR: In this paper, the authors provide insights on linear precoding algorithms for massive MIMO systems and discuss the performance and energy efficiency of the precoders. And they also present potential future directions of linear precoder algorithms.
Journal ArticleDOI
Robust Data Detection for MIMO Systems With One-Bit ADCs: A Reinforcement Learning Approach
TL;DR: In this paper, the authors proposed a reinforcement learning method for multiple-input multiple-output (MIMO) systems with one-bit analog-to-digital converters using reinforcement learning approach.
Journal ArticleDOI
SVM-Based Channel Estimation and Data Detection for One-Bit Massive MIMO Systems
TL;DR: In this paper, a Support Vector Machine (SVM) based joint channel estimation and data detection (CE-DD) method is proposed for massive MIMO systems with one-bit ADCs, which makes use of both to-be-decoded data vectors and the pilot data vectors to improve the estimation and detection performance.
References
More filters
Journal ArticleDOI
Analog-to-digital converter survey and analysis
TL;DR: The state-of-the-art of ADCs is surveyed, including experimental converters and commercially available parts, and the distribution of resolution versus sampling rate provides insight into ADC performance limitations.
MonographDOI
Modern Coding Theory
TL;DR: This summary of the state-of-the-art in iterative coding makes this decision more straightforward, with emphasis on the underlying theory, techniques to analyse and design practical iterative codes systems.
Journal ArticleDOI
On maximum-likelihood detection and the search for the closest lattice point
TL;DR: A novel algorithm is developed that is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction in complexity compared to the Viterbo-Boutros sphere decoder and is supported by intuitive arguments and simulation results in many relevant scenarios.
Journal ArticleDOI
On the sphere-decoding algorithm I. Expected complexity
Babak Hassibi,Haris Vikalo +1 more
TL;DR: For the "sphere decoding" algorithm of Fincke and Pohst, a closed-form expression is found for the expected complexity, both for the infinite and finite lattice, which suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can be implemented in real time.
Journal ArticleDOI
Algorithm and implementation of the K-best sphere decoding for MIMO detection
Zhan Guo,P. Nilsson +1 more
TL;DR: The implementation results show that it is feasible to achieve near-ML performance and high detection throughput for a 4/spl times/4 16-QAM MIMO system using the proposed algorithms and the VLSI architecture with reasonable complexity.